Abstract
The Lanczos algorithm can be considered as an iterative method for finding a few eigenvalues and eigenvectors of large sparse symmetric matrices. In the present paper we solve a conjecture posed by Zdenek Strakos and Anne Greenbaum in [Open Questions in the Convergence Analysis of the Lanczos Process for the Real Symmetric Eigenvalue Problem, IMA Research Report, 1992] on the clustering of Ritz values, which occurs in finite precision computations. In particular, we prove that the conjecture is valid in most cases and describe the rare case when it is not. The established upper bounds measuring the quality of Ritz approximations imply also that Ritz values cluster only close to an eigenvalue.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
