The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A Singularly Valuable Decomposition: The SVD of a Matrix
Abstract
Every teacher of linear algebra should be familiar with the matrix singular value decomposition (or SVD). It has interesting and attractive algebraic properties, and conveys important geometrical and theoretical insights about linear transformations. The close connection between the SVD and the well known theory of diagonalization for symmetric matrices makes the topic immediately accessible to linear algebra teachers, and indeed, a natural extension of what these teachers already know. At the same time, the SVD has fundamental importance in several different applications of linear algebra. Strang was aware of these facts when he introduced the SVD in his now classical text [22, page 142], observing...it is not nearly as famous as it should be. Golub and Van Loan ascribe a central significance to the SVD in their definitive explication of numerical matrix methods [8, page xiv] stating...perhaps the most recurring theme in the book is the practical and theoretical value of [the SVD]. Additional evidence of the significance of the SVD is its central role in a number of papers in recent years in Mathematics Magazine and The American Mathematical Monthly (for example [2, 3, 17, 23]). Although it is probably not feasible to include the SVD in the first linear algebra course, it definitely deserves a place in more advanced undergraduate courses, particularly those with a numerical or applied emphasis. My primary goals in this article are to bring the topic to the attention of a broad audience,
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
The biplot graphic display of matrices with application to principal component analysis
GABRIEL, K. R. (1971) · Biometrika · doi:10.1093/biomet/58.3.453 · Cited by 3,037
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Remote Sensing Digital Image Analysis: An Introduction
Richards, J. A., & Jia, X. (2006) · Springer eBooks · doi:10.1007/3-540-29711-1 · Cited by 2,759
Linear Algebra and Its Applications
I., E., & Strang, G. (1976) · Mathematics of Computation · doi:10.2307/2005411 · Cited by 1,871
Solving Least Squares Problems
Bjork, A., Lawson, C. L., & Hanson, R. J. (1976) · Mathematics of Computation · doi:10.2307/2005340 · Cited by 1,146
Numerical methods and software
Kahaner, D. K., Moler, C., & Nash, S. (1989) · Cited by 1,026
Remote Sensing Digital Image Analysis
Richards, J. A. (1993) · Springer eBooks · doi:10.1007/978-3-642-88087-2 · Cited by 924
Linear Algebra and its Applications
(1980) · Elsevier eBooks · doi:10.1016/c2013-0-11558-9 · Cited by 753
Cited by
Mathematics for Machine Learning
Deisenroth, M. P., Faisal, A. A., & Ong, C. S. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108679930 · Cited by 573
Cyber threat detection based on artificial neural networks using event profiles
Lee, J., Kim, J., Kim, I., & Han, K. (2019) · IEEE Access · doi:10.1109/access.2019.2953095 · Cited by 188
“Note that eigenvalue decomposition by eigenvalues and eigenvectors is applicable only to square matrices, and is also a diagonalization method applicable only to some square matrices [52].”
MethodInferring lockstep behavior from connectivity pattern in large graphs
Jiang, M., Cui, P., Beutel, A., Faloutsos, C., & Yang, S. (2016) · Knowledge and Information Systems · doi:10.1007/s10115-015-0883-y · Cited by 43
Metadata
- Authors
- Kalman, D.
- Venue
- The College Mathematics Journal
- Publisher
- Informa UK Limited
- Published
- 1996-01
- Volume
- 27
- Issue
- 1
- Pages
- 2-23
- ISSN
- 0746-8342 (ISSN-L)
- 1931-1346
- OpenAlex
- W2061459389
- Cited by
- 533
- References
- 16
- FWCI
- 1.55
- 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: A Singularly Valuable Decomposition: The SVD of a Matrix. https://app.cochat.ai/papers/10.1080/07468342.1996.11973744
- The paper
- Kalman, D. (1996). A Singularly Valuable Decomposition: The SVD of a Matrix. The College Mathematics Journal. https://doi.org/10.1080/07468342.1996.11973744
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.