A robust and efficient implementation of LOBPCG
arXiv:1704.07458 · doi:10.1137/17M1129830
Abstract
Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is widely used to compute eigenvalues of large sparse symmetric matrices. The algorithm can suffer from numerical instability if it is not implemented with care. This is especially problematic when the number of eigenpairs to be computed is relatively large. In this paper we propose an improved basis selection strategy based on earlier work by Hetmaniuk and Lehoucq as well as a robust convergence criterion which is backward stable to enhance the robustness. We also suggest several algorithmic optimizations that improve performance of practical LOBPCG implementations. Numerical examples confirm that our approach consistently and significantly outperforms previous competing approaches in both stability and speed.
References in corpus (1)
Cited by in corpus (13)
- Accelerating Nuclear Configuration Interaction Calculations through a Preconditioned Block Iterative Eigensolver
- KSSOLV 2.0: An efficient MATLAB toolbox for solving the Kohn-Sham equations with plane-wave basis set
- Surrogate models for quantum spin systems based on reduced order modeling
- A Parallel, Distributed Memory Implementation of the Adaptive Sampling Configuration Interaction Method
- The Hierarchical Subspace Iteration Method for Laplace--Beltrami Eigenproblems
- A mixed precision LOBPCG algorithm
- Householder orthogonalization with a non-standard inner product
- Accelerating Certifiable Estimation with Preconditioned Eigensolvers
- Fast eigenpairs computation with operator adapted wavelets and hierarchical subspace correction
- GCGE: A Package for Solving Large Scale Eigenvalue Problems by Parallel Block Damping Inverse Power Method
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Two-level Chebyshev filter based complementary subspace method: pushing the envelope of large-scale electronic structure calculations
- Enhancing Scalability of a Matrix-Free Eigensolver for Studying Many-Body Localization