Self-consistent-field calculations using Chebyshev-filtered subspace iteration

  • Authors:

  • Yunkai Zhou;Yousef Saad;Murilo L. Tiago;James R. Chelikowsky

  • Affiliations:

  • Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN;Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN;Institute for Computational Engineering and Sciences, University Station, University of Texas at Austin, Austin, TX;Institute for Computational Engineering and Sciences, University Station, University of Texas at Austin, Austin, TX

  • Venue:
  • Journal of Computational Physics
  • Year:
  • 2006

Quantified Score

Hi-index 31.46

Visualization

Abstract

The power of density functional theory is often limited by the high computational demand in solving an eigenvalue problem at each self-consistent-field (SCF) iteration. The method presented in this paper replaces the explicit eigenvalue calculations by an approximation of the wanted invariant subspace, obtained with the help of well-selected Chebyshev polynomial filters. In this approach, only the initial SCF iteration requires solving an eigenvalue problem, in order to provide a good initial subspace. In the remaining SCF iterations, no iterative eigensolvers are involved. Instead, Chebyshev polynomials are used to refine the subspace. The subspace iteration at each step is easily five to ten times faster than solving a corresponding eigenproblem by the most efficient eigen-algorithms. Moreover, the subspace iteration reaches self-consistency within roughly the same number of steps as an eigensolver-based approach. This results in a significantly faster SCF iteration.