Basis selection in LOBPCG
From MaRDI portal
Recommendations
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- An indefinite variant of LOBPCG for definite matrix pencils
- A robust and efficient implementation of LOBPCG
- Optimize a preconditioned block iterative eigensolver on Sunway Machine
- A refined block conjugate gradient method for symmetric eigenvalue problems
Cites work
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- A Block Orthogonalization Procedure with Constant Synchronization Requirements
- A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods
- A set of level 3 basic linear algebra subprograms
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- An Efficient and Stable Algorithm for the Symmetric-Definite Generalized Eigenvalue Problem
- An overview of the Trilinos project
- Analysis of the Cholesky method with iterative refinement for solving the symmetric definite generalized eigenproblem
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- LAPACK Users' Guide
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
Cited in
(20)- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
- On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
- Hierarchical subspace evolution method for super large parallel computing: A linear solver and an eigensolver as examples
- Modified-operator method for the calculation of band diagrams of crystalline materials
- A mixed precision LOBPCG algorithm
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- An indefinite variant of LOBPCG for definite matrix pencils
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- LOL selection in high dimension
- A robust and efficient implementation of LOBPCG
- Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
- Multiscale modal analysis of fully-loaded spent nuclear fuel canisters
- Low-rank Riemannian eigensolver for high-dimensional Hamiltonians
- On the convergence of orthogonalization-free conjugate gradient method for extreme eigenvalues of Hermitian matrices: a Riemannian optimization interpretation
- Householder Orthogonalization with a Nonstandard Inner Product
- A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory
- Hybrid eigensolvers for nuclear configuration interaction calculations
This page was built for publication: Basis selection in LOBPCG
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853191)
