Thick-restart Lanczos method for electronic structure calculations
This paper describes two recent innovations related to the restarted Lanczos method for eigenvalue problems, namely the thick-restart technique and dynamic restarting schemes. Previous restarted versions of the Lanczos method use considerably more iterations than the non-restarted versions, largely because too much information is discarded during restarting. The thick-restart technique provides a mechanism to preserve a large portion of the existing basis and dynamic restarting schemes decide exactly how many vectors to save. Combining these two techniques the authors are able to implement an efficient eigenvalue problem solver. This paper will demonstrate its effectiveness on one particular class of problems for which this method is well suited: linear eigenvalue problems generated from non-self consistent electronic structure calculations.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC03-76SF00098; AC36-83CH10093
- OSTI ID:
- 20000631
- Journal Information:
- Journal of Computational Physics, Vol. 154, Issue 1; Other Information: PBD: 1 Sep 1999; ISSN 0021-9991
- Country of Publication:
- United States
- Language:
- English
Similar Records
Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method
A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems