The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
Abstract
We describe new algorithms of the locally optimal block preconditioned conjugate gradient (LOBPCG) method for symmetric eigenvalue problems, based on a local optimization of a three-term recurrence, and suggest several other new methods. To be able to compare numerically different methods in the class, with different preconditioners, we propose a common system of model tests, using random preconditioners and initial guesses. As the "ideal" control algorithm, we advocate the standard preconditioned conjugate gradient method for finding an eigenvector as an element of the null-space of the corresponding homogeneous system of linear equations under the assumption that the eigenvalue is known. We recommend that every new preconditioned eigensolver be compared with this "ideal" algorithm on our model test problems in terms of the speed of convergence, costs of every iteration, and memory requirements. We provide such comparison for our LOBPCG method. Numerical results establish that our algorithm is practically as efficient as the ``ideal' algorithm when the same preconditioner is used in both methods. We also show numerically that the LOBPCG method provides approximations to first eigenpairs of about the same quality as those by the much more expensive global optimization method on the same generalized block Krylov subspace. We propose a new version of block Davidson's method as a generalization of the LOBPCG method. Finally, direct numerical comparisons with the Jacobi--Davidson method show that our method is more robust and converges almost two times faster.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Geometry of Algorithms with Orthogonality Constraints
Edelman, A., Arias, T. A., & Smith, S. T. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895290954 · Cited by 2,685
Numerical Methods for Large Eigenvalue Problems: Revised Edition
Saad, Y. (2011) · doi:10.1137/1.9781611970739 · Cited by 2,364
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide
Demmel, J. W., Dongarra, J. J., Ruhe, A., van der Vorst, H. A., & Bai, Z. (1987) · Medical Entomology and Zoology · Cited by 1,102
Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
Fokkema, D. R., Sleijpen, G. L. G., & Van der Vorst, H. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596300073 · Cited by 323
Knyazev, A. V., & Argentati, M. E. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827500377332 · Cited by 225
Self-citationDavidson, E. R. (1983) · Springer eBooks · doi:10.1007/978-94-009-7200-1_4 · Cited by 142
Preconditioned Eigensolvers - an Oxymoron?
Knyazev, A. (1998) · ETNA - Electronic Transactions on Numerical Analysis · Cited by 137
Self-citationCombination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
Notay, Y. (2001) · Numerical Linear Algebra with Applications · doi:10.1002/nla.246 · Cited by 106
A subspace preconditioning algorithm for eigenvector/eigenvalue computation
Bramble, J. H., Pasciak, J. E., & Knyazev, A. (1996) · Advances in Computational Mathematics · doi:10.1007/bf02127702 · Cited by 76
Self-citationNew estimates for Ritz vectors
Knyazev, A. (1997) · Mathematics of Computation · doi:10.1090/s0025-5718-97-00855-7 · Cited by 51
Self-citationA geometric theory forpreconditioned inverse iterationII: Convergence estimates
Neymeyr, K. (2001) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(00)00236-6 · Cited by 47
Homotopy Method for the Large, Sparse, Real Nonsymmetric Eigenvalue Problem
Lui, S. H., Keller, H. B., & Kwok, T. W. C. (1997) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479894273900 · Cited by 35
On the Homotopy Method for Perturbed Symmetric Generalized Eigenvalue Problems
Zhang, T., Law, K. H., & Golub, G. H. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596299755 · Cited by 22
A Parallel Davidson-Type Algorithm for Several Eigenvalues
Borges, L., & Oliveira, S. (1998) · Journal of Computational Physics · doi:10.1006/jcph.1998.6003 · Cited by 13
Ovtchinnikov, E., & Xanthis, L. S. (2001) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2000.0674 · Cited by 10
Cited by
ABINIT: First-principles approach to material and nanosystem properties
Gonze, X., Amadon, B., Anglade, P.-M., Beuken, J.-M., Bottin, F., Boulanger, P., Bruneval, F., Caliste, D., Caracas, R., Côté, M., et al. (2009) · Computer Physics Communications · doi:10.1016/j.cpc.2009.07.007 · Cited by 2,701
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Bell, N., & Garland, M. (2009) · Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis · doi:10.1145/1654059.1654078 · Cited by 900
An efficient orbital transformation method for electronic structure calculations
VandeVondele, J., & Hutter, J. (2003) · The Journal of Chemical Physics · doi:10.1063/1.1543154 · Cited by 702
Torrent, M., Jollet, F., Bottin, F., Zérah, G., & Gonze, X. (2008) · Computational Materials Science · doi:10.1016/j.commatsci.2007.07.020 · Cited by 606
Metadata
- Authors
- Knyazev, A. V.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2001-01
- Volume
- 23
- Issue
- 2
- Pages
- 517-541
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2051142108
- Cited by
- 778
- References
- 16
- FWCI
- 11.69
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.