Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society, the Mathematics of Computation (MCOM) is devoted to research articles of the highest quality in all areas of pure and applied mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.98.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

How to make the Lanczos algorithm converge slowly
HTML articles powered by AMS MathViewer

by D. S. Scott PDF
Math. Comp. 33 (1979), 239-247 Request permission

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
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65F15
  • Retrieve articles in all journals with MSC: 65F15
Additional Information
  • © Copyright 1979 American Mathematical Society
  • Journal: Math. Comp. 33 (1979), 239-247
  • MSC: Primary 65F15
  • DOI: https://doi.org/10.1090/S0025-5718-1979-0514821-5
  • MathSciNet review: 514821