The DOI matches its Crossref record.
The Symmetric Eigenvalue Problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Efficient iterative schemes for ab initio total-energy calculations using a plane-wave basis set
Kresse, G., & Furthmüller, J. (1996) · Physical Review B · doi:10.1103/physrevb.54.11169 · Cited by 123,652
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Higher-order organization of complex networks
Benson, A. R., Gleich, D. F., & Leskovec, J. (2016) · Science · doi:10.1126/science.aad9029 · Cited by 1,270
Multimode Molecular Dynamics Beyond the Born‐Oppenheimer Approximation
Köuppel, H., Domcke, W., & Cederbaum, L. S. (1984) · Advances in Chemical Physics · doi:10.1002/9780470142813.ch2 · Cited by 1,095
Recursive PCA for adaptive process monitoring
Li, W., Yue, H. H., Valle-Cervantes, S., & Qin, S. J. (2000) · Journal of Process Control · doi:10.1016/s0959-1524(00)00022-6 · Cited by 848
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
Kolenikov, S., & Angeles, G. (2009) · Review of Income and Wealth · doi:10.1111/j.1475-4991.2008.00309.x · Cited by 775
Computing a nearest symmetric positive semidefinite matrix
Higham, N. J. (1988) · Linear Algebra and its Applications · doi:10.1016/0024-3795(88)90223-6 · Cited by 698
Barnett, R. N., & Landman, U. (1993) · Physical Review B · doi:10.1103/physrevb.48.2081 · Cited by 629
Discrete‐Variable Representations and their Utilization
Light, J. C., & Carrington, T. (2000) · Advances in Chemical Physics · doi:10.1002/9780470141731.ch4 · Cited by 626
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
Barnard, S. T., & Simon, H. D. (1994) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330060203 · Cited by 488
An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Hendrickson, B., & Leland, R. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916028 · Cited by 480
A Proposal for Toeplitz Matrix Calculations
Strang, G. (1986) · Studies in Applied Mathematics · doi:10.1002/sapm1986742171 · Cited by 428
Approximate solution of the trust region problem by minimization over two-dimensional subspaces
Byrd, R. H., Schnabel, R. B., & Shultz, G. A. (1988) · Mathematical Programming · doi:10.1007/bf01580735 · Cited by 411
Quasi-one-dimensional electron states in a split-gate GaAs/AlGaAs heterostructure
Laux, S. E., Frank, D. J., & Stern, F. (1988) · Surface Science · doi:10.1016/0039-6028(88)90671-1 · Cited by 406
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
Attributed Network Embedding for Learning in a Dynamic Environment
Li, J., Dani, H., Hu, X., Tang, J., Chang, Y., & Liu, H. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132919 · Cited by 352
Performance of dynamic load balancing algorithms for unstructured mesh calculations
Williams, R. D. (1991) · Concurrency: Practice and Experience · doi:10.1002/cpe.4330030502 · Cited by 345
Newton-Type Minimization via the Lanczos Method
Nash, S. G. (1984) · SIAM Journal on Numerical Analysis · doi:10.1137/0721052 · Cited by 338
Efficient Solution of Parabolic Equations by Krylov Approximation Methods
Gallopoulos, E., & Saad, Y. (1992) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0913071 · Cited by 320
Discrete Laplace–Beltrami operators for shape analysis and segmentation
Reuter, M., Biasotti, S., Giorgi, D., Patanè, G., & Spagnuolo, M. (2009) · Computers & Graphics · doi:10.1016/j.cag.2009.03.005 · Cited by 319
Non-Hermitian electronic theory and applications to clusters
Santra, R., & Cederbaum, L. S. (2002) · Physics Reports · doi:10.1016/s0370-1573(02)00143-6 · Cited by 290
Short-range evolution of small perturbations in a barotropic model
Lacarra, J.-F., & Talagrand, O. (1988) · Tellus A Dynamic Meteorology and Oceanography · doi:10.1111/j.1600-0870.1988.tb00408.x · Cited by 286
The Accuracy of Floating Point Summation
Higham, N. J. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914050 · Cited by 266
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
Approximate solutions and eigenvalue bounds from Krylov subspaces
Paige, C. C., Parlett, B. N., & van der Vorst, H. A. (1995) · Numerical Linear Algebra with Applications · doi:10.1002/nla.1680020205 · Cited by 260
Self-citationOptimization techniques on Riemannian manifolds
Smith, S. (1995) · Hamiltonian and Gradient Flows, Algorithms and Control · doi:10.1090/fic/003/09 · Cited by 258
Metadata
- Authors
- Wilkinson, J. H., & Parlett, B. N.
- Venue
- Mathematics of Computation
- Publisher
- JSTOR
- Published
- 1981-10
- Volume
- 37
- Issue
- 156
- Pages
- 599
- ISSN
- 0025-5718 (ISSN-L)
- OpenAlex
- W2568342123
- Cited by
- 1,186
- References
- 0
- FWCI
- 33.54
- 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.