The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
Open accessAbstract
The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. An implementation of a look-ahead version of the Lanczos algorithm is presented that, except for the very special situation of an incurable breakdown, overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and requires the same number of matrix–vector products and inner products as the standard Lanczos process without look-ahead.
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 algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
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
QMR: a quasi-minimal residual method for non-Hermitian linear systems
Freund, R. W., & Nachtigal, N. M. (1991) · Numerische Mathematik · doi:10.1007/bf01385726 · Cited by 979
Self-citationSolution of systems of linear equations by minimized iterations
Lanczos, C. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.006 · Cited by 929
Duff, I. S., Grimes, R. G., & Lewis, J. G. (1989) · ACM Transactions on Mathematical Software · doi:10.1145/62038.62043 · Cited by 650
Padé-Type Approximation and General Orthogonal Polynomials
Brezinski, C. (1980) · International series of numerical mathematics · doi:10.1007/978-3-0348-6558-6 · Cited by 555
Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
Freund, R. W. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913023 · Cited by 371
Self-citationA Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
Parlett, B. Ν., Taylor, D. R., & Liu, Z. A. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0771034-2 · Cited by 310
On the partial realization problem
Gragg, W. B., & Lindquist, A. (1983) · Linear Algebra and its Applications · doi:10.1016/0024-3795(83)90059-9 · Cited by 274
A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
Gutknecht, M. H. (1994) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479890188803 · Cited by 157
Self-citationA Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
Gutknecht, M. H. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613037 · Cited by 153
Self-citationA Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric Matrices
Cullum, J. K., & Willoughby, R. A. (1986) · North-Holland mathematics studies · doi:10.1016/s0304-0208(08)72647-1 · Cited by 87
Cited by
The Quadratic Eigenvalue Problem
Tisseur, F., & Meerbergen, K. (2001) · SIAM Review · doi:10.1137/s0036144500381988 · Cited by 1,402
On Krylov Subspace Approximations to the Matrix Exponential Operator
Hochbruck, M., & Lubich, C. (1997) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142995280572 · Cited by 795
Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems
Bai, Z. (2002) · Applied Numerical Mathematics · doi:10.1016/s0168-9274(02)00116-2 · Cited by 633
Iterative solution of linear systems
Freund, R. W., Golub, G. H., & Nachtigal, N. M. (1992) · Acta Numerica · doi:10.1017/s0962492900002245 · Cited by 434
Self-citationRecent 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
Metadata
- Authors
- Freund, R. W., Gutknecht, M. H., & Nachtigal, N. M.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 1993-01
- Volume
- 14
- Issue
- 1
- Pages
- 137-158
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W1965366611
- Cited by
- 304
- References
- 14
- FWCI
- 42.65
- Type
- journal article
- Language
- en
- Open access
- green
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.