The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Algorithm 358: singular value decomposition of a complex matrix [F1, 4, 5]
Open accessAbstract
n, x, t, S); integer n, x, l; integer array S; comment Ising generates n-sequences ($1, "", S,) of zeros and ones where x = ~i~ S~ and t = ~,-~1 I S~+I -S~ I are given.The main idea is to interleave compositions of x and n --x objects and resort to a lexicographic generation of compositions.We call these sequences Ising configurations since we believe they first appeared in the study of the so-called Ising problem (See Hill [1], Ising [2]).The number R(n, x, t) of distinct configurations with fixed n, x, t is well known [1, 2]: Now define a block of l's (or zeros) in the sequence as a set of a maximum number of consecutive l's (or zeros) eventually consisting of a single element.For given n, x, t, the number p of blocks of l's may easily be deduced from t, as well as the number q of blocks of zeros.In fact, a block of l's including either $1 or S, yields one variation and each one of the others yields two variations; hence we get p = q ~ m + 1 when t = 2m + 1 (t odd requires $1 # S,) and either p = m + 1, q = m (S~ = S, = 1), or p = m, q = m+l ($1 = S, = 0) when t--2m.Clearly, there is a 1-1 correspondence between the compositions of x with p parts and the distributions of the x l's into p blocks.And for each distribution of l's, distinct distributions of the n -x zeros into g blocks correspond to distinct configurations.The main body of the algorithm is compose, which generates compositions of an integer x with k parts and stores them in the array L. The role of sort and bisort is to form the final sequence ($1 , ... , S,) from the structure of one-blocks Li and zeroblocks M~.The Ising problem was brought to my attention by Dr. B. Dejon during an informal visit to the IBM Research Laboratory in Zurich.Thanks are also due to Prof. Paul ErdSs for pointing out to me reference [1] and to Prof. A. A. Zykov for correspondence.The procedure was tested on the NCR 4130 of the Labora-tSrio de C£1culo Autom~tico, Universidade do Porto.Thanks are also due to the Director and his Staff.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“For any matrix A ∈ R m × n , its optimal low-rank approximation can be obtained by truncating its SVD (Businger and Golub, 1969) to retain the top r singular values along with their corresponding singular vectors.”
From Knowledge Decoupling via Orthogonal Projection for Lifelong Editing of Large Language Models (2025) · cites this paper as Businger and Golub, 1969
Citations
Cites
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Self-citationCalculating the Singular Values and Pseudo-Inverse of a Matrix
Golub, G. H., & Kahan, W. (1965) · Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis · doi:10.1137/0702016 · Cited by 1,812
Self-citationLeast squares, singular values and matrix approximations
Golub, G. H. (1968) · Applications of Mathematics · doi:10.21136/am.1968.103138 · Cited by 90
Self-citation
Cited by
Sorted by citations
Items 101–144 of 144
A Schur method for robust eigenvalue assignment of second-order singular systems
Hu, K., & Xie, H. (2025) · Applied Numerical Mathematics · doi:10.1016/j.apnum.2025.09.002 · Cited by 1
Regression and Model Selection
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.005 · Cited by 1
A prescriptive database interface methodology for end-users
McLeod, D. J. (1982) · Information Systems · doi:10.1016/0306-4379(82)90017-5 · Cited by 1
Yeo, S. P., Cheng, M., Bannister, D. J., & Ide, J. P. (1995) · Microwave and Optical Technology Letters · doi:10.1002/mop.4650090512 · Cited by 1
Detection of 180° phase discrepancies in multi-port waveguide transmission measurements
Yeo, S. P., Cheng, M., Bannister, D. J., & Ide, J. P. (2002) · Conference proceedings - IEEE Instrumentation/Measurement Technology Conference · doi:10.1109/imtc.1994.351970 · Cited by 1
Nash, J. C., & Nash, M. (1997) · Cited by 1
Gan, Z., & Hanli, M. (1983) · Chinese Journal of Oceanology and Limnology · doi:10.1007/bf02900478 · Cited by 1
Linear Distillation Learning.Preprint
Asadulaev, A., Kuznetsov, I. A., & Filchenkov, A. A. (2019) · arXiv (Cornell University) · Cited by 1
Stationary Stochastic Processes
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.003 · Cited by 1
Knowledge Decoupling via Orthogonal Projection for Lifelong Editing of Large Language Models
Xu, H., Lan, P., Yang, E., Guo, G., Zhao, J., Jiang, L., & Wang, X. (2025) · Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2025.acl-long.646
“For any matrix A ∈ R m n , its optimal low-rank approximation can be obtained by truncating its SVD (Businger and Golub, 1969) to retain the top r singular values along with their corresponding singular vectors.”
InfluentialSystem Identification of Damped Truss-Like Space Structures
Armand, S. C. (1995) · NASA STI Repository (National Aeronautics and Space Administration)
Analysis of Waveguide Junctions by Rank Reduction
Zuckerman, D. N., & Diament, P. (2005) · IEEE MTT-S International Microwave Symposium digest · doi:10.1109/mwsym.1977.1124486
Georgescu, V. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22589-5_17
Commentary on Matrix Factorizations and Applications
Higham, N. J. (2007) · Research Explorer (The University of Manchester)
Bibliography of the Book Matrix Computations
Golub, G. H., Loan, C. F. V., Paige, C. C., Pellerin, C., & Beebe, N. H. F. (1999)
Self-citationSolving Complex Systems Using Spreadsheets
Dudeck, K. (2020) · IEEE Lasers and Electro-Optics Society Annual Meeting (LEOS) · doi:10.18260/1-2--14679
Percival, D. B., & Walden, A. T. (1993) · Cambridge University Press eBooks · doi:10.1017/cbo9780511622762.008
Deterministic Spectral Analysis
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.004
Interpolation for Parametric ROMs
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.013
Combining Direct Spectral Estimators
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.009
Periodogram and Other Direct Spectral Estimators
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.007
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.012
Formes De Jordan : Application A L'Algorithmique Numerique
Steer, S. (2006) · Springer eBooks · doi:10.1007/bfb0044442
Gallant, A. R. (1987) · Wiley series in probability and statistics · doi:10.1002/9780470316719.refs
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.006
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.011
Parametric Spectral Estimators
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.010
(1997) · Wiley series in probability and statistics · doi:10.1002/9781118032671.refs
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.014
Lag Window Spectral Estimators
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.008
(2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.015
Foundations for Stochastic Spectral Analysis
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.005
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.001 · Cited by 1
Percival, D. B., & Walden, A. T. (2020) · Cambridge University Press eBooks · doi:10.1017/9781139235723.013
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.014
Percival, D. B., & Walden, A. T. (2020) · doi:10.1017/9781139235723.001
Chambers, J. M. (2005) · Encyclopedia of Statistical Sciences · doi:10.1002/0471667196.ess0030.pub2
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.016
Chambers, J. M. (2004) · Encyclopedia of Statistical Sciences · doi:10.1002/0471667196.ess0030
Anastasiu, D. C., & Tagarelli, A. (2017) · Wiley StatsRef: Statistics Reference Online · doi:10.1002/9781118445112.stat07973
Kinematic Calibration of a 2-DOF Over-Constrained Parallel Manipulator Using Force Data
Chen, S., Feng, Y., & Li, T. (2023) · Lecture notes in mechanical engineering · doi:10.1007/978-981-19-9398-5_9
Chen, Z., Ma, Y., Long, H., Zhao, Y., Cao, Z., Yuan, D., Yan, C., Liu, Y., Liu, E., & Zhao, R. (2026) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2026.3742026
Metadata
- Authors
- Businger, P. A., & Golub, G. H.
- Affiliations
- Bell Telephone Labs, Inc., Murray Hill, NJ
- Venue
- Communications of the ACM
- Published
- 1969-10
- Volume
- 12
- Issue
- 10
- Pages
- 564-565
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W1970916490
- Cited by
- 143
- References
- 3
- Citations by year
- 2026: 1 · 2025: 3 · 2024: 1 · 2023: 2 · 2022: 4 · 2021: 2 · 2020: 17 · 2019: 20 · 2018: 3 · 2017: 3 · 2016: 3 · 2015: 6 · 2013: 1 · 2012: 1
- FWCI
- 1.90
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Communications of the ACM (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Physical Sciences › Mathematics › Modeling and Simulation › Mathematical and Computational Methods
- Keywords
- binary sequences, Ising problem, singular value decomposition, complex matrices, numerical linear algebra, FORTRAN algorithm, combinatorial generation, matrix factorization, eigenvalue computation, matrix eigenvalue computation, matrix conditioning, matrix rank
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
