Basis selection in LOBPCG
DOI10.1016/J.JCP.2006.02.007zbMATH Open1104.65031OpenAlexW2040436854MaRDI QIDQ853191FDOQ853191
Authors: U. Hetmaniuk, R. B. Lehoucq 
Publication date: 15 November 2006
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2006.02.007
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
numerical examplespreconditioningconjugate gradient methodorthonormalizationLOBPCGpreconditioned eigensolversymmetric generalized eigenvalue problem
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- LAPACK Users' Guide
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Title not available (Why is that?)
- A set of level 3 basic linear algebra subprograms
- An overview of the Trilinos project
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Analysis of the Cholesky method with iterative refinement for solving the symmetric definite generalized eigenproblem
- A comparison of eigensolvers for large-scale 3D modal analysis using AMG-preconditioned iterative methods
- A Block Orthogonalization Procedure with Constant Synchronization Requirements
- An Efficient and Stable Algorithm for the Symmetric-Definite Generalized Eigenvalue Problem
Cited In (20)
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- An indefinite variant of LOBPCG for definite matrix pencils
- A mixed precision LOBPCG algorithm
- Low-rank Riemannian eigensolver for high-dimensional Hamiltonians
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- On the convergence of orthogonalization-free conjugate gradient method for extreme eigenvalues of Hermitian matrices: a Riemannian optimization interpretation
- A Robust and Efficient Implementation of LOBPCG
- LOL selection in high dimension
- Hybrid eigensolvers for nuclear configuration interaction calculations
- On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
- Multiscale modal analysis of fully-loaded spent nuclear fuel canisters
- Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory
- Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations
- Modified-operator method for the calculation of band diagrams of crystalline materials
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
- JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
- Computing several eigenpairs of Hermitian problems by conjugate gradient iterations
- 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 Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
Uses Software
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)
