REVIEW 2 cited by
Recent implementations, applications, and extensions of the Locally Optimal Block Preconditioned Conjugate Gradient method (LOBPCG)
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Since introduction [A. Knyazev, Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method, SISC (2001) DOI:10.1137/S1064827500366124] and efficient parallel implementation [A. Knyazev et al., Block locally optimal preconditioned eigenvalue xolvers (BLOPEX) in HYPRE and PETSc, SISC (2007) DOI:10.1137/060661624], LOBPCG has been used is a wide range of applications in mechanics, material sciences, and data sciences. We review its recent implementations and applications, as well as extensions of the local optimality idea beyond standard eigenvalue problems.
Forward citations
Cited by 2 Pith papers
-
Approximating Gaussian Whittle-Matern Fields over Well-Centered Triangulations of Riemannian Manifolds
A convergent GMRF approximation to Whittle-Matern fields on boundaryless Riemannian manifolds using DEC on well-centered simplicial complexes that is agnostic to alpha and kappa.
-
Understanding and Improving Laplacian Positional Encodings For Temporal GNNs
Supra-Laplacian positional encodings generally improve temporal GNN link prediction, and approximate iterative computation (LOBPCG) can replace exact eigendecomposition with little performance loss.
Discussion (0). Continue with ORCID to comment.