A Projected Preconditioned Conjugate Gradient Algorithm for Computing Many Extreme Eigenpairs of a Hermitian Matrix

Abstract

We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the invariant subspace is large (e.g., over several hundreds or thousands) even though it may still be small relative to the dimension of A. These problems arise from, for example, density functional theory based electronic structure calculations for complex materials. The key feature of our algorithm is that it performs fewer Rayleigh--Ritz calculations compared to existing algorithms such as the locally optimal precondition conjugate gradient or the Davidson algorithm. It is a block algorithm, hence can take advantage of efficient BLAS3 operations and be implemented with multiple levels of concurrency. We discuss a number of practical issues that must be addressed in order to implement the algorithm efficiently on a high performance computer.

References in corpus (1)

• Quantum ESPRESSO: a modular and open-source software project for quantum simulations of materials

Cited by in corpus (16)

• ELSI -- An Open Infrastructure for Electronic Structure Solvers
• Prediction of Atomization Energy Using Graph Kernel and Active Learning
• Chebyshev polynomial filtered subspace iteration in the Discontinuous Galerkin method for large-scale electronic structure calculations
• The CECAM Electronic Structure Library and the modular software development paradigm
• KSSOLV 2.0: An efficient MATLAB toolbox for solving the Kohn-Sham equations with plane-wave basis set
• Coordinate-wise descent methods for leading eigenvalue problem
• Convergence theory for preconditioned eigenvalue solvers in a nutshell
• Kohn-Sham inversion with mathematical guarantees
• An Unconditionally Energy-Stable and Orthonormality-Preserving Iterative Scheme for the Kohn-Sham Gradient Flow Based Model
• Fast eigenpairs computation with operator adapted wavelets and hierarchical subspace correction
• Gradient Flow Based Discretized Kohn-Sham Density Functional Theory
• Triangularized Orthogonalization-free Method for Solving Extreme Eigenvalue Problems
• Convergence analysis of direct minimization and self-consistent iterations
• TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
• On Relaxed Filtered Krylov Subspace Method for Non-Symmetric Eigenvalue Problems
• A Thick-Restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems