The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The principle of minimized iterations in the solution of the matrix eigenvalue problem
Open accessAbstract
An interpretation of Dr. Cornelius Lanczos' iteration method, which he has named "minimized iterations", is discussed in this article, expounding the method as applied to the solution of the characteristic matrix equations both in homogeneous and nonhomogeneous form.This interpretation leads to a variation of the Lanczos procedure which may frequently be advantageous by virtue of reducing the volume of numerical work in practical applications.Both methods employ essentially the same algorithm, requiring the generation of a series of orthogonal functions through which a simple matrix equation of reduced order is established.The reduced matrix equation may be solved directly in terms of certain polynomial functions obtained in conjunction with the generated orthogonal functions, and the convergence of the solution may be observed as the order of the reduced matrix is successively increased with the order of the original matrix as a limit.The method of minimized iterations is recommended as a rapid means for determining a small number of the larger eigenvalues and modal columns of a large matrix and as a desirable alternative for various series expansions of the Fredholm problem.'
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
Cited by
(2008) · Journal of Machine Learning Research · Cited by 33,051
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,154
Theory of open quantum systems
Xu, R., & Yan, Y. (2002) · The Journal of Chemical Physics · doi:10.1063/1.1474579 · Cited by 5,922
Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods
Barrett, R., Berry, M., Chan, T. F., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., & van der Vorst, H. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971538 · Cited by 3,479
Numerical solution of saddle point problems
Benzi, M., Golub, G. H., & Liesen, J. (2005) · Acta Numerica · doi:10.1017/s0962492904000212 · Cited by 2,300
Iterative methods for linear and nonlinear equations
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4556 · Cited by 1,947
The Quadratic Eigenvalue Problem
Tisseur, F., & Meerbergen, K. (2001) · SIAM Review · doi:10.1137/s0036144500381988 · Cited by 1,402
Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization
Peherstorfer, B., Willcox, K., & Gunzburger, M. (2018) · SIAM Review · doi:10.1137/16m1082469 · Cited by 1,061
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
Theofilis, V. (2011) · Annual Review of Fluid Mechanics · doi:10.1146/annurev-fluid-122109-160705 · Cited by 732
Budišić, M., Mohr, R., & Mezić, I. (2012) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4772195 · Cited by 710
Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
Lehoucq, R. B., & Sorensen, D. C. (1996) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479895281484 · Cited by 618
Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Saad, Y. (1980) · Linear Algebra and its Applications · doi:10.1016/0024-3795(80)90169-x · Cited by 520
Krylov subspace methods for solving large unsymmetric linear systems
Saad, Y. (1981) · Mathematics of Computation · doi:10.1090/s0025-5718-1981-0616364-6 · Cited by 449
Iterative solution of linear systems
Freund, R. W., Golub, G. H., & Nachtigal, N. M. (1992) · Acta Numerica · doi:10.1017/s0962492900002245 · Cited by 434
Three-Dimensional Face Recognition
Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2005) · International Journal of Computer Vision · doi:10.1007/s11263-005-1085-y · Cited by 424
Time-domain finite-element methods
Lee, J.-F., Lee, R., & Cangellaris, A. (1997) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.558658 · Cited by 420
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
(2020) · IntechOpen eBooks · doi:10.5772/intechopen.87879 · Cited by 384
Approximation of Large-Scale Dynamical Systems: An Overview
Antoulas, A. C. (2004) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)31584-7 · Cited by 377
Recent 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
Schlegel, H. B. (2011) · WIREs Computational Molecular Science · doi:10.1002/wcms.34 · Cited by 360
Das, P., Moll, M., Stamati, H., Kavraki, L. E., & Clementi, C. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0603553103 · Cited by 331
The ergodic side of the many‐body localization transition
Luitz, D. J., & Lev, Y. B. (2017) · Annalen der Physik · doi:10.1002/andp.201600350 · Cited by 308
Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
Wu, K., & Simon, H. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898334605 · Cited by 306
A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
Sleijpen, G. L. G., & Van der Vorst, H. A. (2000) · SIAM Review · doi:10.1137/s0036144599363084 · Cited by 304
GMRES with Deflated Restarting
Morgan, R. B. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827599364659 · Cited by 289
Solution of the Redfield equation for the dissipative quantum dynamics of multilevel systems
Pollard, W. T., & Friesner, R. A. (1994) · The Journal of Chemical Physics · doi:10.1063/1.467222 · Cited by 277
SOAR: A Second-order Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
Bai, Z., & Su, Y. (2005) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479803438523 · Cited by 262
Nonempirical Interactions for the Nuclear Shell Model: An Update
Stroberg, S. R., Hergert, H., Bogner, S. K., & Holt, J. D. (2019) · Annual Review of Nuclear and Particle Science · doi:10.1146/annurev-nucl-101917-021120 · Cited by 253
The Redfield Equation in Condensed‐Phase Quantum Dynamics
Pollard, W. T., Felts, A. K., & Friesner, R. A. (1996) · Advances in Chemical Physics · doi:10.1002/9780470141526.ch3 · Cited by 141
Efficient geometric integrators for nonadiabatic quantum dynamics. I. The adiabatic representation
Choi, S., & Vaníček, J. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5092611 · Cited by 25
Discriminative segmentation-based evaluation through shape dissimilarity
Konukoglu, E., Glocker, B., Ye, D. H., Criminisi, A., & Pohl, K. M. (2012) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2012.2216281 · Cited by 14
“This step yields a sparse matrix which we then solve using Arnoldi’s method [39] as implemented in MATLAB.”
MethodA sharp phase transition in linear cross-entropy benchmarking
Ware, B., Deshpande, A., Hangleiter, D., Niroula, P., Fefferman, B., Gorshkov, A. V., & Gullans, M. J. (2023) · arXiv · doi:10.48550/arxiv.2305.04954 · Cited by 4
“This algorithm is identical to the commonly used Arnoldi method [32] with MPS representations of all Krylov vectors.”
Method
Metadata
- Authors
- Arnoldi, W. E.
- Venue
- Quarterly of Applied Mathematics
- Publisher
- American Mathematical Society (AMS)
- Published
- 1951-04
- Volume
- 9
- Issue
- 1
- Pages
- 17-29
- ISSN
- 0033-569X (ISSN-L)
- 1552-4485
- OpenAlex
- W101236918
- Cited by
- 1,818
- References
- 1
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- bronze
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.