The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Approximate solutions and eigenvalue bounds from Krylov subspaces
Abstract
Approximations to the solution of a large sparse symmetric system of equations are considered. The conjugate gradient and minimum residual approximations are studied without reference to their computation. Several different bases for the associated Krylov subspace are used, including the usual Lanczos basis. The zeros of the iteration polynomial for the minimum residual approximation (harmonic Ritz values) are characterized in several ways and, in addition, attractive convergence properties are established. The connection of these harmonic Ritz values to Lehmann's optimal intervals for eigenvalues of the original matrix appears to be new.
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
Lanczos, C. (1950) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.045.026 · Cited by 4,391
Solution of Sparse Indefinite Systems of Linear Equations
Paige, C. C., & Saunders, M. A. (1975) · SIAM Journal on Numerical Analysis · doi:10.1137/0712047 · Cited by 1,620
Self-citationThe Symmetric Eigenvalue Problem.
Wilkinson, J. H., & Parlett, B. N. (1981) · Mathematics of Computation · doi:10.2307/2007453 · Cited by 1,186
Self-citationConcus, P., Golub, G. H., & O'Leary, D. P. (1976) · Sparse Matrix Computations · doi:10.1016/b978-0-12-141050-6.50023-4 · Cited by 433
Computational Variants of the Lanczos Method for the Eigenproblem
PAIGE, C. C. (1972) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/10.3.373 · Cited by 408
Self-citationThe rate of convergence of Conjugate Gradients
van der Sluis, A., & van der Vorst, H. A. (1986) · Numerische Mathematik · doi:10.1007/bf01389450 · Cited by 351
Computing interior eigenvalues of large matrices
Morgan, R. B. (1991) · Linear Algebra and its Applications · doi:10.1016/0024-3795(91)90381-6 · Cited by 221
Quasi-kernel polynomials and their use in non-Hermitian matrix iterations
Freund, R. W. (1992) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(92)90263-w · Cited by 81
Kahan, W., & Parlett, B. Ν. (1976) · Elsevier eBooks · doi:10.1016/b978-0-12-141050-6.50013-1 · Cited by 26
Self-citation
Cited by
A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
G. Sleijpen, G. L., & Van der Vorst, H. A. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479894270427 · Cited by 848
Self-citationTime-evolution methods for matrix-product states
Paeckel, S., Köhler, T., Swoboda, A., Manmana, S. R., Schollwöck, U., & Hubig, C. (2019) · Annals of Physics · doi:10.1016/j.aop.2019.167998 · Cited by 768
Eigenvalue computation in the 20th century
Golub, G. H., & van der Vorst, H. A. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00413-1 · Cited by 388
“In [98], these eigenvalue approximations, in connection with the related Lanczos process, were called Harmonic Ritz values, and some nice relations for Harmonic Ritz values for symmetric inde nite matrices are given in that paper.”
MethodRecent computational developments in Krylov subspace methods for linear systems
Simoncini, V., & Szyld, D. B. (2007) · Numerical Linear Algebra with Applications · doi:10.1002/nla.499 · Cited by 375
Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
Baglama, J., & Reichel, L. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/04060593x · Cited by 334
Metadata
- Authors
- Paige, C. C., Parlett, B. N., & van der Vorst, H. A.
- Venue
- Numerical Linear Algebra with Applications
- Publisher
- Wiley
- Published
- 1995-03
- Volume
- 2
- Issue
- 2
- Pages
- 115-133
- ISSN
- 1070-5325 (ISSN-L)
- 1099-1506
- OpenAlex
- W2170486042
- Cited by
- 260
- References
- 9
- FWCI
- 12.24
- 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.