Kesheng Wu

and
Horst Simon

1998

For real symmetric eigenvalue problems, there are a number of algorithms that are mathematically equivalent, for example, the Lanczos algorithm, the Arnoldi method and the unpreconditioned Davidson method. The Lanczos algorithm is often preferred because it uses significantly fewer arithmetic operations per iteration. To limit the maximum memory usage, these algorithms are often restarted. In recent years, a number of effective restarting schemes have been developed for the Arnoldi method and the Davidson method. This paper describes a simple restarting scheme for the Lanczos algorithm. This restarted Lanczos algorithm uses as many arithmetic operations as the original algorithm. Theoretically, this restarted Lanczos method is equivalent to the implicitly restarted Arnoldi method and the thick-restart Davidson method. Because it uses less arithmetic operations than the others, it is an attractive alternative for solving symmetric eigenvalue problems.

- Closely related
- LBNL-42982: the restarting schemes
- TRLan software (BSD license)
- More research work by John Wu
- Bitmap Index
- Connected Component Labeling
- Eigenvalue Computation
- Inforamtion available elsewhere on the web
- CiteSeer
- DBLP
- Google Scholar

Disclaimers