The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
The singular value decomposition: Its computation and some applications
Abstract
We provide a tutorial introduction to certain numerical computations both in linear algebra and linear systems in the context of bounded arithmetic. The essential characteristics of bounded arithmetic are discussed in an introductory section followed by a review of the fundamental concepts of numerical stability and conditioning. The singular value decomposition (SVD) is then presented along with some related comments on the numerical determination of rank. A variety of applications of the SVD in linear algebra and linear systems is then outlined. A final section discusses some details of the implementation of the SVD on a digital computer. An Appendix is provided which contains a number of useful illustrative example.
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
Cites
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Computer methods for mathematical computations
Forsythe, G. E., Malcolm, M. A., & Moler, C. (1977) · UCLA Biblioteca de Ingenieria Civil · Cited by 2,683
Introduction to matrix computations
Stewart, G. W. (1973) · International Linear Collider · Cited by 2,381
Calculating the Singular Values and Pseudo-Inverse of a Matrix
Golub, G., & Kahan, W. (1965) · Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis · doi:10.1137/0702016 · Cited by 1,786
Dongarra, J. J., Moler, C. B., Bunch, J. R., & Stewart, G. W. (1979) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971811 · Cited by 1,738
Introduction to the Theory of Linear Non-selfadjoint Operators
Gohberg, I. (1969) · Medical Entomology and Zoology · Cited by 1,565
Rounding errors in algebraic processes
(1964) · Journal of the Franklin Institute · doi:10.1016/0016-0032(64)90390-4 · Cited by 1,315
Numerical methods for computing angles between linear subspaces
Björck, Ȧ., & Golub, G. H. (1973) · Mathematics of Computation · doi:10.1090/s0025-5718-1973-0348991-3 · Cited by 865
Matrix Eigensystem Routines — EISPACK Guide
Smith, B. T., Boyle, J. M., Dongarra, J. J., Garbow, B. S., Ikebe, Y., Klema, V. C., & Moler, C. (1976) · Lecture notes in computer science · doi:10.1007/3-540-07546-1 · Cited by 830
Self-citation
Cited by
An eigensystem realization algorithm for modal parameter identification and model reduction
Juang, J.-N., & Pappa, R. S. (1985) · Journal of Guidance, Control, and Dynamics · doi:10.2514/3.20031 · Cited by 2,762
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Model Compression and Hardware Acceleration for Neural Networks: A Comprehensive Survey
Deng, B. L., Li, G., Han, S., Shi, L., & Xie, Y. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.2976475 · Cited by 996
Wampler, C. (1986) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1986.289285 · Cited by 850
Machine learning algorithms for wireless sensor networks: A survey
Praveen Kumar, D., Amgoth, T., & Annavarapu, C. S. R. (2019) · Information Fusion · doi:10.1016/j.inffus.2018.09.013 · Cited by 687
Metadata
- Authors
- Klema, V., & Laub, A.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1980-04
- Volume
- 25
- Issue
- 2
- Pages
- 164-176
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2098502158
- Cited by
- 1,631
- References
- 20
- FWCI
- 30.38
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The singular value decomposition: Its computation and some applications. https://app.cochat.ai/papers/10.1109/tac.1980.1102314
- The paper
- Klema, V., & Laub, A. (1980). The singular value decomposition: Its computation and some applications. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1980.1102314
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.
