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
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
Generalized Inverses, Ridge Regression, Biased Linear Estimation, and Nonlinear Estimation
Marquardt, D. W. (1970) · Technometrics · doi:10.1080/00401706.1970.10488699 · Cited by 2,276
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
The singular value decomposition: Its computation and some applications
Klema, V., & Laub, A. (1980) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1980.1102314 · Cited by 1,631
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690 · Cited by 1,154
Most Tensor Problems Are NP-Hard
Hillar, C. J., & Lim, L.-H. (2013) · Journal of the ACM · doi:10.1145/2512329 · Cited by 1,099
On the Early History of the Singular Value Decomposition
Stewart, G. W. (1993) · SIAM Review · doi:10.1137/1035134 · Cited by 985
The Optimal Hard Threshold for Singular Values is \(4/\sqrt {3}\)
Gavish, M., & Donoho, D. L. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2323359 · Cited by 675
Closed-Loop Turbulence Control: Progress and Challenges
Brunton, S. L., & Noack, B. R. (2015) · Applied Mechanics Reviews · doi:10.1115/1.4031175 · Cited by 623
How to tell the difference between a model and a digital twin
Wright, L., & Davidson, S. (2020) · Advanced Modeling and Simulation in Engineering Sciences · doi:10.1186/s40323-020-00147-4 · Cited by 601
Towards a Generalized Singular Value Decomposition
Paige, C. C., & Saunders, M. A. (1981) · SIAM Journal on Numerical Analysis · doi:10.1137/0718026 · Cited by 555
Owens, T. J., Zandt, G., & Taylor, S. R. (1984) · Journal of Geophysical Research: Solid Earth · doi:10.1029/jb089ib09p07783 · Cited by 530
Edelman, A., & Rao, N. R. (2005) · Acta Numerica · doi:10.1017/s0962492904000236 · Cited by 526
Spectral estimation: An overdetermined rational model equation approach
Cadzow, J. A. (1982) · Proceedings of the IEEE · doi:10.1109/proc.1982.12424 · Cited by 491
Tracking a few extreme singular values and vectors in signal processing
Comon, P., & Golub, G. H. (1990) · Proceedings of the IEEE · doi:10.1109/5.58320 · Cited by 489
Self-citationDeep learning for remote sensing image classification: A survey
Li, Y., Zhang, H., Xue, X., Jiang, Y., & Shen, Q. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1264 · Cited by 472
Optimal combination forecasts for hierarchical time series
Hyndman, R. J., Ahmed, R. A., Athanasopoulos, G., & Shang, H. L. (2011) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2011.03.006 · Cited by 467
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
Fong, D. C.-L., & Saunders, M. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/10079687x · Cited by 442
Introduction to Spectral Analysis
(2020) · Spectral Analysis for Univariate Time Series · doi:10.1017/9781139235723.002 · Cited by 413
Martens, H., & Geladi, P. (2004) · Encyclopedia of Statistical Sciences · doi:10.1002/0471667196.ess1105 · Cited by 404
Large-Scale Sparse Singular Value Computations
Berry, M. W. (1992) · The International Journal of Supercomputing Applications · doi:10.1177/109434209200600103 · Cited by 402
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
Self-citationMartens, H., & Geladi, P. (2005) · Encyclopedia of Statistical Sciences · doi:10.1002/0471667196.ess1105.pub2 · Cited by 379
Fee, M. S., Mitra, P. P., & Kleinfeld, D. (1996) · Journal of Neuroscience Methods · doi:10.1016/s0165-0270(96)00050-7 · Cited by 357
Analysis of two partial-least-squares algorithms for multivariate calibration
Manne, R. (1987) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(87)80096-5 · Cited by 350
Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
Baglama, J., & Reichel, L. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/04060593x · Cited by 334
MIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Improving the Generalization Properties of Radial Basis Function Neural Networks
Bishop, C. (1991) · Neural Computation · doi:10.1162/neco.1991.3.4.579 · Cited by 318
Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
Kilmer, M. E., & O'Leary., D. P. (2001) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479899345960 · Cited by 315
Björck, Å. (1990) · Handbook of Numerical Analysis · doi:10.1016/s1570-8659(05)80036-5 · Cited by 313
The singular values and vectors of low rank perturbations of large rectangular random matrices
Benaych-Georges, F., & Nadakuditi, R. R. (2012) · Journal of Multivariate Analysis · doi:10.1016/j.jmva.2012.04.019 · Cited by 301
Conversion of EEG activity into cursor movement by a brain-computer interface (BCI)
Fabiani, G. E., McFarland, D. J., Wolpaw, J. R., & Pfurtscheller, G. (2004) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2004.834627 · Cited by 292
Kernel Methods and Machine Learning
Kung, S. Y. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139176224 · Cited by 287
Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
Golub, G. H., & Wilkinson, J. H. (1976) · SIAM Review · doi:10.1137/1018113 · Cited by 278
Self-citationData-Driven Aerospace Engineering: Reframing the Industry with Machine Learning
Brunton, S. L., Nathan Kutz, J., Manohar, K., Aravkin, A. Y., Morgansen, K., Klemisch, J., Goebel, N., Buttrick, J., Poskin, J., Blom-Schieber, A. W., et al. (2021) · AIAA Journal · doi:10.2514/1.j060131 · Cited by 270
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Usoskin, I. G., Gallet, Y., Lopes, F., Kovaltsov, G. A., & Hulot, G. (2016) · Astronomy & Astrophysics · doi:10.1051/0004-6361/201527295 · Cited by 176
Algorithm 358: singular value decomposition of a complex matrix [F1, 4, 5]
Businger, P. A., & Golub, G. H. (1969) · Communications of the ACM · doi:10.1145/363235.363249 · Cited by 143
Self-citation
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.