Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations

Yunfeng Cai, Zhaojun Bai, John E. Pask, N. SukumarJournal of Computational Physics 2013 · DOI

Introduction

In the field of quantum material simulation, Density Functional Theory (DFT) serves as a cornerstone for predicting physical properties. However, the computational cost of solving the Kohn-Sham equation—a massive generalized eigenvalue problem—remains a significant hurdle. This paper introduces a novel numerical strategy, the Locally Accelerated Block Preconditioned Steepest Descent (LABPSD) method, designed to bridge the gap between efficient local basis sets and robust iterative solvers.

The Challenge: Efficiency vs. Numerical Stability

Researchers typically choose between two types of basis functions to represent quantum systems. Planewave methods are numerically stable and "well-conditioned," but they require a vast number of variables, leading to high memory and computational demands. Conversely, local basis methods (such as Partition of Unity Finite Elements, or PUFE) use far fewer degrees of freedom, offering potential speedups.

The drawback of local bases is their non-orthogonality and "long tails," which result in "ill-conditioned" matrices. As shown in the table below, these matrices become increasingly difficult to solve as the system complexity grows.

Condition numbers of the Hamiltonian (H) and overlap (S) matrices demonstrate the extreme ill-conditioning encountered in local basis methods.

When condition numbers reach magnitudes of $10^{10}$ or $10^{11}$, standard iterative solvers often stagnate or converge too slowly for practical use.

The LABPSD Method

To overcome this, the authors developed the LABPSD method, a hybrid preconditioning scheme that integrates seamlessly into the standard Self-Consistent Field (SCF) cycle used in DFT calculations.

The Self-Consistent Field (SCF) cycle, where the proposed diagonalization method addresses the primary computational bottleneck.

The core innovation lies in a two-stage approach:

  • Global Preconditioning: At the start of the SCF cycle, a fixed "global" preconditioner is constructed using a shifted-inverse matrix. This provides a cost-effective improvement for all energy states simultaneously.
  • Local Acceleration: As the simulation progresses, the algorithm identifies energy states that have begun to stabilize and applies "locally accelerated" preconditioners. This targeted approach uses a local MINRES (Minimum Residual) solver, "warm-started" by the global preconditioner to minimize additional costs.

Key Results and Performance

The researchers tested LABPSD on challenging metallic systems, most notably a triclinic Cerium-Aluminum (CeAl) system characterized by deep atomic potentials and extreme ill-conditioning.

The results were transformative:

  • Massive Speedups: The hybrid LABPSD method completed the CeAl simulation in just 1.3 hours. In contrast, using only global preconditioning took 11.4 hours, while a purely local approach required a staggering 138.6 hours.
  • Robustness: The solver demonstrated remarkable stability, maintaining a low number of iterations (between 2 and 6) even as matrix sizes increased or conditioning worsened.
  • Parity with Planewaves: This approach allows local basis methods like PUFE to match the efficiency per degree of freedom of state-of-the-art planewave codes, effectively solving the "ill-conditioning" penalty.

Conclusion

By combining global and local preconditioning, the LABPSD method provides a "Goldilocks" solution for electronic structure calculations. It enables the use of efficient, low-degree-of-freedom basis sets without the traditional numerical penalties, paving the way for faster and more complex quantum material simulations. Future work may explore memory-saving techniques like single-precision factorizations to further enhance the method's scalability on high-performance computing clusters.

Summary updated

BibTeX
@article{cai2013hybrid,
  author = {Yunfeng Cai and Zhaojun Bai and John E. Pask and N. Sukumar},
  title = {{Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations}},
  journal = {Journal of Computational Physics},
  year = {2013},
  doi = {10.1016/j.jcp.2013.07.020},
}
Figure