A Robust and Efficient Implementation of LOBPCG
From MaRDI portal
Publication:4685340
DOI10.1137/17M1129830zbMath1401.65038arXiv1704.07458OpenAlexW2610012734WikidataQ129149995 ScholiaQ129149995MaRDI QIDQ4685340
No author found.
Publication date: 8 October 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.07458
Related Items (14)
Spectral Element Methods for Eigenvalue Problems Based on Domain Decomposition ⋮ Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC ⋮ Hybrid eigensolvers for nuclear configuration interaction calculations ⋮ Hierarchical subspace evolution method for super large parallel computing: A linear solver and an eigensolver as examples ⋮ Householder Orthogonalization with a Nonstandard Inner Product ⋮ A Linearized Structure-Preserving Numerical Scheme for a Gradient Flow Model of the KohnSham Density Functional Theory ⋮ A mixed precision LOBPCG algorithm ⋮ A locally optimal preconditioned Newton-Schur method for symmetric elliptic eigenvalue problems ⋮ Solution of the Schrödinger equation for quasi-one-dimensional materials using helical waves ⋮ KSSOLV 2.0: an efficient Matlab toolbox for solving the Kohn-Sham equations with plane-wave basis set ⋮ Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations ⋮ Preconditioned gradient iterations for the eigenproblem of definite matrix pairs ⋮ A simple extrapolation method for clustered eigenvalues ⋮ Fast Eigenpairs Computation with Operator Adapted Wavelets and Hierarchical Subspace Correction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Basis selection in LOBPCG
- Roundoff error analysis of the CholeskyQR2 algorithm
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Anasazi software for the numerical solution of large-scale eigenvalue problems
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- LAPACK Users' Guide
- Basic Linear Algebra Subprograms for Fortran Usage
- Communication lower bounds and optimal algorithms for numerical linear algebra
- A Block Orthogonalization Procedure with Constant Synchronization Requirements
- An overview of the sparse basic linear algebra subprograms
- Electronic Structure
This page was built for publication: A Robust and Efficient Implementation of LOBPCG
