AbstractThe bounds of the smallest and largest eigenvalues for rank-one modification of the Hermitian matrices are studied in this paper. The sharper bounds are obtained. Numerical examples illustrate that our bounds give accurate estimates
AbstractLet A be an n×n matrix with singular values σ1⩾⋯⩾σn. If 1⩽r⩽n, then σr=minH∈Sr‖H‖, where Sr ...
AbstractLet A be a complex n×n matrix. We find lower bounds for its numerical radius r(A)=max{|x∗Ax|...
AbstractWhile extreme eigenvalues of large Hermitian Toeplitz matrices have been studied in detail f...
AbstractLet A be a weakly chained diagonally dominant (wcdd) M-matrix, an upper bound for ‖A-1‖∞ is ...
AbstractFor the generalized eigenvalue problem, we establish upper bounds for the spectral variation...
AbstractIn this note we discuss interlacing inequalities relating the eigenvalues of a partitioned H...
AbstractWe present explicit formulae which allow us to construct elliptic matrices with zero diagona...
AbstractWe consider lower bounds for the largest eigenvalue of a symmetric matrix. In particular we ...
AbstractWe study the eigenvalue perturbations of an n×n real unreduced symmetric tridiagonal matrix ...
AbstractUpper bounds for the spectral variation of two regular matrix pairs have been given in [Guox...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for ‖A-1‖...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for A-1∞....
AbstractFor a complex matrix A, the well-known Lévy–Desplanques theorem states that A is nonsingular...
AbstractIn this work, we improve the lower and upper bounds obtained by Zhang and Luo [X. Zhang, R. ...
AbstractLet A − λB be a definite matrix pencil of order n, i.e., both A and B are n × n Hermitian an...
AbstractLet A be an n×n matrix with singular values σ1⩾⋯⩾σn. If 1⩽r⩽n, then σr=minH∈Sr‖H‖, where Sr ...
AbstractLet A be a complex n×n matrix. We find lower bounds for its numerical radius r(A)=max{|x∗Ax|...
AbstractWhile extreme eigenvalues of large Hermitian Toeplitz matrices have been studied in detail f...
AbstractLet A be a weakly chained diagonally dominant (wcdd) M-matrix, an upper bound for ‖A-1‖∞ is ...
AbstractFor the generalized eigenvalue problem, we establish upper bounds for the spectral variation...
AbstractIn this note we discuss interlacing inequalities relating the eigenvalues of a partitioned H...
AbstractWe present explicit formulae which allow us to construct elliptic matrices with zero diagona...
AbstractWe consider lower bounds for the largest eigenvalue of a symmetric matrix. In particular we ...
AbstractWe study the eigenvalue perturbations of an n×n real unreduced symmetric tridiagonal matrix ...
AbstractUpper bounds for the spectral variation of two regular matrix pairs have been given in [Guox...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for ‖A-1‖...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for A-1∞....
AbstractFor a complex matrix A, the well-known Lévy–Desplanques theorem states that A is nonsingular...
AbstractIn this work, we improve the lower and upper bounds obtained by Zhang and Luo [X. Zhang, R. ...
AbstractLet A − λB be a definite matrix pencil of order n, i.e., both A and B are n × n Hermitian an...
AbstractLet A be an n×n matrix with singular values σ1⩾⋯⩾σn. If 1⩽r⩽n, then σr=minH∈Sr‖H‖, where Sr ...
AbstractLet A be a complex n×n matrix. We find lower bounds for its numerical radius r(A)=max{|x∗Ax|...
AbstractWhile extreme eigenvalues of large Hermitian Toeplitz matrices have been studied in detail f...