A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
From MaRDI portal
(Redirected from Publication:349770)
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.
Recommendations
- Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
- Preconditioned conjugate gradient method for the sparse generalized eigenvalue problem in electronic structure calculations
- scientific article; zbMATH DE number 1507105
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
- A novel algorithm for calculation of the extreme eigenvalues of large Hermitian matrices
Cites work
- scientific article; zbMATH DE number 4063877 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- A Simultaneous Iteration Algorithm for Real Matrices
- A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
- A spectrum slicing method for the Kohn-Sham problem
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Convex programming in Hilbert space
- Elemental, a new framework for distributed memory dense matrix computations
- Elements of structural optimization.
- Matrix Analysis
- Numerical Optimization
- Numerical methods for large eigenvalue problems
- ScaLAPACK Users' Guide
- Some Metric Inequalities in the Space of Matrices
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- The trace minimization method for the symmetric generalized eigenvalue problem
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
Cited in
(27)- A thick-restart Lanczos algorithm with polynomial filtering for Hermitian eigenvalue problems
- A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems
- Numerical methods for Kohn–Sham density functional theory
- ELSI -- an open infrastructure for electronic structure solvers
- Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations
- On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
- On the computation of large-scale self-consistent-field iterations
- A conjugate gradient method for electronic structure calculations
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- Convergence theory for preconditioned eigenvalue solvers in a nutshell
- Gradient flow based Kohn-Sham density functional theory model
- Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
- Coordinatewise descent methods for leading eigenvalue problem
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues
- Projective block Lanczos algorithm for dense, Hermitian eigensystems
- On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
- Fast eigenpairs computation with operator adapted wavelets and hierarchical subspace correction
- On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
- Gaussian basis implementation of the charge patching method
- scientific article; zbMATH DE number 1569024 (Why is no real title available?)
- KSSOLV 2.0: an efficient Matlab toolbox for solving the Kohn-Sham equations with plane-wave basis set
- Triangularized orthogonalization-free method for solving extreme eigenvalue problems
- Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
- Convergence analysis of direct minimization and self-consistent iterations
- An unconditionally energy-stable and orthonormality-preserving iterative scheme for the Kohn-Sham gradient flow based model
- Weighted Trace-Penalty Minimization for Full Configuration Interaction
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory
Describes a project that uses
Uses Software
This page was built for publication: A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q349770)
