Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


How to make the Lanczos algorithm converge slowly

Author: D. S. Scott
Journal: Math. Comp. 33 (1979), 239-247
MSC: Primary 65F15
MathSciNet review: 514821
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The Paige style Lanczos algorithm is an iterative method for finding a few eigenvalues of large sparse symmetric matrices. Some beautiful relationships among the elements of the eigenvectors of a symmetric tridiagonal matrix are used to derive a perverse starting vector which delays convergence as long as possible. Why such slow convergence is never seen in practice is also examined.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F15

Retrieve articles in all journals with MSC: 65F15

Additional Information

PII: S 0025-5718(1979)0514821-5
Keywords: Eigenvalues, Lanczos algorithm, sparse symmetric matrices
Article copyright: © Copyright 1979 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia