AbstractIn this work, we improve the lower and upper bounds obtained by Zhang and Luo [X. Zhang, R. Luo, Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices, Czechoslovak Math. J. 52 (127) (2002) 537–544] for the nonmaximal eigenvalue λn−1(A) of a symmetric positive matrix
AbstractLet G=(V,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. ...
AbstractLet Pn+ denote the set of all n×n nonnegative matrices. For a function f:R+m→R+ and matrices...
AbstractIn this paper, we present a sharp version of Bauer–Fike’s theorem. We replace the matrix nor...
AbstractWe provide a method for improving bounds for nonmaximal eigenvalues of positive matrices. A ...
AbstractA new lower bound on the smallest eigenvalue τ(A★B) for the Fan product of two nonsingular M...
AbstractLet A be a complex n×n matrix. We find lower bounds for its numerical radius r(A)=max{|x∗Ax|...
AbstractWe consider lower bounds for the largest eigenvalue of a symmetric matrix. In particular we ...
AbstractIf A and B are n×n nonsingular M-matrices, a lower bound on the smallest eigenvalue τ(A☆B) f...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for ‖A-1‖...
AbstractLet A be a weakly chained diagonally dominant (wcdd) M-matrix, an upper bound for ‖A-1‖∞ is ...
AbstractLet A be an n×n matrix with singular values σ1⩾⋯⩾σn. If 1⩽r⩽n, then σr=minH∈Sr‖H‖, where Sr ...
AbstractThe spread of an n×n matrix A with eigenvalues λ1,…,λn is defined by sprA=maxj,k|λj−λk|. We ...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for A-1∞....
AbstractThe bounds of the smallest and largest eigenvalues for rank-one modification of the Hermitia...
AbstractUsing an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds f...
AbstractLet G=(V,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. ...
AbstractLet Pn+ denote the set of all n×n nonnegative matrices. For a function f:R+m→R+ and matrices...
AbstractIn this paper, we present a sharp version of Bauer–Fike’s theorem. We replace the matrix nor...
AbstractWe provide a method for improving bounds for nonmaximal eigenvalues of positive matrices. A ...
AbstractA new lower bound on the smallest eigenvalue τ(A★B) for the Fan product of two nonsingular M...
AbstractLet A be a complex n×n matrix. We find lower bounds for its numerical radius r(A)=max{|x∗Ax|...
AbstractWe consider lower bounds for the largest eigenvalue of a symmetric matrix. In particular we ...
AbstractIf A and B are n×n nonsingular M-matrices, a lower bound on the smallest eigenvalue τ(A☆B) f...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for ‖A-1‖...
AbstractLet A be a weakly chained diagonally dominant (wcdd) M-matrix, an upper bound for ‖A-1‖∞ is ...
AbstractLet A be an n×n matrix with singular values σ1⩾⋯⩾σn. If 1⩽r⩽n, then σr=minH∈Sr‖H‖, where Sr ...
AbstractThe spread of an n×n matrix A with eigenvalues λ1,…,λn is defined by sprA=maxj,k|λj−λk|. We ...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for A-1∞....
AbstractThe bounds of the smallest and largest eigenvalues for rank-one modification of the Hermitia...
AbstractUsing an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds f...
AbstractLet G=(V,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. ...
AbstractLet Pn+ denote the set of all n×n nonnegative matrices. For a function f:R+m→R+ and matrices...
AbstractIn this paper, we present a sharp version of Bauer–Fike’s theorem. We replace the matrix nor...