On the optimality and sharpness of Laguerre's lower bound on the smallest eigenvalue of a symmetric positive definite matrix.

DOI10.21136/AM.2017.0022-17zbMath1424.15035arXiv1702.00108OpenAlexW2586739036MaRDI QIDQ2402120

Yusaku Yamamoto

Publication date: 6 September 2017

Published in: Applications of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.00108

zbMATH Keywords

positive definite matriceseigenvalue boundsdqds algorithmLaguerre's methodsingular value computation

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (1)

New upper bounds for the spectral variation of a general matrix

This page was built for publication: On the optimality and sharpness of Laguerre's lower bound on the smallest eigenvalue of a symmetric positive definite matrix.