Accession Number:

ADA058005

Title:

How to Make the Lanczos Algorithm Converge Slowly.

Descriptive Note:

Memorandum rept.,

Corporate Author:

CALIFORNIA UNIV BERKELEY ELECTRONICS RESEARCH LAB

Personal Author(s):

Report Date:

1978-01-12

Pagination or Media Count:

18.0

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. Author

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE