The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Calculating the Singular Values and Pseudo-Inverse of a Matrix
Abstract
A numerically stable and fairly fast scheme is described to compute the unitary matrices U and V which transform a given matrix A into a diagonal form $\Sigma = U^ * AV$, thus exhibiting A’s singular values on $\Sigma $’s diagonal. The scheme first transforms A to a bidiagonal matrix J, then diagonalizes J. The scheme described here is complicated but does not suffer from the computational difficulties which occasionally afflict some previously known methods. Some applications are mentioned, in particular the use of the pseudo-inverse $A^I = V\Sigma ^I U^* $ to solve least squares problems in a way which dampens spurious oscillation and cancellation.
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
A generalized inverse for matrices
Penrose, R. (1955) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100030401 · Cited by 4,551
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Birkhoff, G., & Mac Lane, S. (2017) · A K Peters/CRC Press eBooks · doi:10.1201/9781315275499 · Cited by 671
Unitary Triangularization of a Nonsymmetric Matrix
Householder, A. S. (1958) · Journal of the ACM · doi:10.1145/320941.320947 · Cited by 629
Lanczos, C., & Gillis, J. (1962) · Physics Today · doi:10.1063/1.3058271 · Cited by 552
May, K. O., Birkhoff, G., & MacLane, S. (1954) · Econometrica · doi:10.2307/1907363 · Cited by 459
Some Applications of the Pseudoinverse of a Matrix
Greville, T. N. E. (1960) · SIAM Review · doi:10.1137/1002004 · Cited by 352
The Cyclic Jacobi Method for Computing the Principal Values of a Complex Matrix
Forsythe, G. E., & Henrici, P. (1960) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1960-0109825-2 · Cited by 252
Inversion of Matrices by Biorthogonalization and Related Results
Hestenes, M. R. (1958) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0106005 · Cited by 243
Bauer, F. L. (1963) · Numerische Mathematik · doi:10.1007/bf01385880 · Cited by 237
On some algorithms for the solution of the complete eigenvalue problem
Kublanovskaya, V. N. (1962) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(63)90168-x · Cited by 187
NUMERICAL COMPUTATION OF THE CHARACTERISTIC VALUES OF A REAL SYMMETRIC MATRIX
Givens, W. (1954) · doi:10.2172/4412175 · Cited by 182
On Pre-Conditioning of Matrices
Osborne, E. E. (1960) · Journal of the ACM · doi:10.1145/321043.321048 · Cited by 181
Solution of linear equations by diagonalization of coefficients matrix
Kogbetliantz, E. G. (1955) · Quarterly of Applied Mathematics · doi:10.1090/qam/88795 · Cited by 111
The Jacobi Method for Real Symmetric Matrices
Goldstine, H. H., Murray, F. J., & von Neumann, J. (1959) · Journal of the ACM · doi:10.1145/320954.320960 · Cited by 75
Cited by
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Paige, C. C., & Saunders, M. A. (1982) · ACM Transactions on Mathematical Software · doi:10.1145/355984.355989 · Cited by 4,387
Removing electroencephalographic artifacts by blind source separation
Jung, T., Makeig, S., Humphries, C., Lee, T.-W., McKeown, M. J., Iragui, V. J., & Sejnowski, T. J. (2000) · Psychophysiology · doi:10.1017/s0048577200980259 · Cited by 3,334
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Self-citationPrivate traits and attributes are predictable from digital records of human behavior
Kosinski, M., Stillwell, D., & Graepel, T. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1218772110 · Cited by 2,829
Wold, S., Ruhe, A., Wold, H., & Dunn, III (1984) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0905052 · Cited by 2,529
Metadata
- Authors
- Golub, G., & Kahan, W.
- Venue
- Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis
- Published
- 1965-01
- Volume
- 2
- Issue
- 2
- Pages
- 205-224
- ISSN
- 0887-459X (ISSN-L)
- OpenAlex
- W2005423095
- Cited by
- 1,786
- References
- 15
- FWCI
- 3.88
- 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.