Year: 1980
Type: article
Abstract: The Lanczos algorithm was originally used to tridiagonalize symmetric matrices, but it was soon replaced by more effective methods based on explicit orthogonal similarity transformations. The algorithm was later revived as an effective scheme for solving sparse symmetric eigenvalue problems. The historical development and the current state of the Lanczos algorithm are surveyed.
Author: David Scott
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: U.S. Department of Energy
OpenAlex ID: W2260115418
