Computing charge densities with partially reorthogonalized Lanczos

Constantine Bekas, Yousef Saad, Murilo L. Tiago, James R. Chelikowsky

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

This paper considers the problem of computing charge densities in a density functional theory (DFT) framework. In contrast to traditional, diagonalization-based, methods, we utilize a technique which exploits a Lanczos basis, without explicit reference to individual eigenvectors. The key ingredient of this new approach is a partial reorthogonalization strategy whose goal is to ensure a good level of orthogonality of the basis vectors. The experiments reveal that the method can be a few times faster than ARPACK, the implicit restart Lanczos method. This is achievable by exploiting more memory and BLAS3 (dense) computations while avoiding the frequent updates of eigenvectors inherent to all restarted Lanczos methods.

Original languageEnglish (US)
Pages (from-to)175-186
Number of pages12
JournalComputer Physics Communications
Volume171
Issue number3
DOIs
StatePublished - Oct 1 2005

Bibliographical note

Funding Information:
Work supported by NSF under grant DMR-0325218, by DOE under Grants DE-FG02-03ER25585, DE-FG02-03ER15491, and by the Minnesota Supercomputing Institute.

Keywords

  • Charge densities
  • Density functional theory
  • Lanczos
  • Partial reorthogonalization

Fingerprint Dive into the research topics of 'Computing charge densities with partially reorthogonalized Lanczos'. Together they form a unique fingerprint.

Cite this