Live briefing
Everything about LOBPCG
Method for finding largest (or smallest) eigenvalues
Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is a matrix-free method for finding the largest eigenvalues and the corresponding eigenvectors of a symmetric generalized eigenvalue problem Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: LOBPCGA 5-minute orientation
- Skim a recent paper: An indefinite LOBPCG type of algorithm for detecting a definite Hermitian matrix pairInfluential work since 2022
- Pick up a classic book: Parallel computing is everywhereThe most-reprinted book on the subject
- Read the landmark paper: A Robust and Efficient Implementation of LOBPCGCited 52 times
- Go sideways: Andrei Knyazev (mathematician)A closely related topic
- Go sideways: PreconditionerA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
A Robust and Efficient Implementation of LOBPCG
Basis selection in LOBPCG
GPU-Accelerated LOBPCG Method with Inexact Null-Space Filtering for Solving Generalized Eigenvalue Problems in Computational Electromagnetics Analysis with Higher-Order FEM
An indefinite variant of LOBPCG for definite matrix pencils
GPU-Accelerated LOBPCG Method with Inexact Null-Space Filtering for Solving Generalized Eigenvalue Problems in Computational Electromagnetics Analysis with Higher-Order FEM
A mixed precision LOBPCG algorithm
A Stabilized Complex LOBPCG Eigensolver for the Analysis of Moderately Lossy EM Structures
Optimization of LOBPCG solver for PDE eigenvalue problems with high-order/spectral FEM on GPU
🆕 Influential since 2022
📚 Books worth reading
- 📕Parallel computing is everywhereItaly) ParCo (Conference) (2017 Bologna · 2018
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Andrei Knyazev (mathematician) Andrew Knyazev is an American mathematician. He graduated from the Faculty of Computational Mathematics and Cybernetics of Moscow State University under…
- Preconditioner In mathematics, preconditioning is the application of a transformation, called the preconditioner, that conditions a given problem into a form that is…
- Segmentation-based object categorization The image segmentation problem is concerned with partitioning an image into multiple regions according to some homogeneity criterion. This article is primarily…
- Arnoldi iteration In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of an iterative method. Arnoldi finds an approximation…
- Rayleigh–Ritz method The Rayleigh–Ritz method is a direct numerical method of approximating eigenvalues, which originated in the context of solving physical boundary-value…
- Lanczos algorithm The Lanczos algorithm is an iterative method devised by Cornelius Lanczos that is an adaptation of power methods to find the m "most useful" (tending towards…
- SLEPc SLEPc is a software library for the parallel computation of eigenvalues and eigenvectors of large, sparse matrices. It can be seen as a module of PETSc…
- Spectral clustering In multivariate statistics, spectral clustering techniques make use of the spectrum (eigenvalues) of the similarity matrix of the data to perform dimensionality…