期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
LIMIT THEOREMS FOR β-LAGUERRE AND β-JACOBI ENSEMBLES
1
作者 Naqi HUANG Yutao MA 《Acta Mathematica Scientia》 SCIE CSCD 2022年第5期2025-2039,共15页
We use tridiagonal models to study the limiting behavior of β-Laguerre and β-Jacobi ensembles,focusing on the limiting behavior of the extremal eigenvalues and the central limit theorem for the two ensembles.For the... We use tridiagonal models to study the limiting behavior of β-Laguerre and β-Jacobi ensembles,focusing on the limiting behavior of the extremal eigenvalues and the central limit theorem for the two ensembles.For the central limit theorem of β-Laguerre ensembles,we follow the idea in[1]while giving a modified version for the generalized case.Then we use the total variation distance between the two sorts of ensembles to obtain the limiting behavior of β-Jacobi ensembles. 展开更多
关键词 beta-ensembles largest and smallest eigenvalues central limit theorem total variationdistance
下载PDF
A SMALLEST SINGULAR VALUE METHOD FOR SOLVING INVERSE EIGENVALUE PROBLEMS 被引量:1
2
作者 S.F. Xu(Department of Mathematics, Peking University, Beijing) 《Journal of Computational Mathematics》 SCIE CSCD 1996年第1期23-31,共9页
Utilizing the properties of the smallest singular value of a matrix, we propose a new, efficient and reliable algorithm for solving nonsymmetric matrix inverse eigenvalue problems, and compare it with a known method. ... Utilizing the properties of the smallest singular value of a matrix, we propose a new, efficient and reliable algorithm for solving nonsymmetric matrix inverse eigenvalue problems, and compare it with a known method. We also present numerical experiments which illustrate our results. 展开更多
关键词 MATH A smallest SINGULAR VALUE METHOD FOR SOLVING INVERSE eigenvalue PROBLEMS
原文传递
On the Second Smallest and the Largest Normalized Laplacian Eigenvalues of a Graph
3
作者 Xiao-guo TIAN Li-gong WANG You LU 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2021年第3期628-644,共17页
Let G be a simple connected graph with order n.Let L(G)and Q(G)be the normalized Laplacian and normalized signless Laplacian matrices of G,respectively.Letλk(G)be the k-th smallest normalized Laplacian eigenvalue of ... Let G be a simple connected graph with order n.Let L(G)and Q(G)be the normalized Laplacian and normalized signless Laplacian matrices of G,respectively.Letλk(G)be the k-th smallest normalized Laplacian eigenvalue of G.Denote byρ(A)the spectral radius of the matrix A.In this paper,we study the behaviors ofλ2(G)andρ(L(G))when the graph is perturbed by three operations.We also study the properties ofρ(L(G))and X for the connected bipartite graphs,where X is a unit eigenvector of L(G)corresponding toρ(L(G)).Meanwhile we characterize all the simple connected graphs withρ(L(G))=ρ(Q(G)). 展开更多
关键词 second smallest normalized Laplacian eigenvalue normalized Laplacian spectral radius normalized signless Laplacian spectral radius
原文传递
An Inequality for the Perron Pair of an Irreducible and Symmetric Nonnegative Tensor with Application
4
作者 Mao-Lin Che Yi-Min Wei 《Journal of the Operations Research Society of China》 EI CSCD 2017年第1期65-82,共18页
The main purpose of this paper is to consider the Perron pair of an irreducible and symmetric nonnegative tensor and the smallest eigenvalue of an irreducible and symmetric nonsingular M-tensor.We analyze the analytic... The main purpose of this paper is to consider the Perron pair of an irreducible and symmetric nonnegative tensor and the smallest eigenvalue of an irreducible and symmetric nonsingular M-tensor.We analyze the analytical property of an algebraic simple eigenvalue of symmetric tensors.We also derive an inequality about the Perron pair of nonnegative tensors based on plane stochastic tensors.We finally consider the perturbation of the smallest eigenvalue of nonsingular M-tensors and design a strategy to compute its smallest eigenvalue.We verify our results via random numerical examples. 展开更多
关键词 Nonnegative tensor Symmetric tensor Irreducible tensor M-Tensor H-Eigenpair An algebraic simple eigenvalue The Perron pair The smallest eigenvalue Perturbation
原文传递
A DYNAMICS APPROACH TO THE COMPUTATION OF EIGENVECTORS OF MATRICES
5
作者 S. Jiménez L. Vézquez 《Journal of Computational Mathematics》 SCIE CSCD 2005年第6期657-672,共16页
We construct a family of dynamical systems whose evolution converges to the eigenvectors of a general square matrix, not necessarily symmetric. We analyze the convergence of those systems and perform numerical tests. ... We construct a family of dynamical systems whose evolution converges to the eigenvectors of a general square matrix, not necessarily symmetric. We analyze the convergence of those systems and perform numerical tests. Some examples and comparisons with the power methods are presented. 展开更多
关键词 smallest real eigenvalue Iterative method
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部