The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Numerical methods for computing angles between linear subspaces
Open accessAbstract
Assume that two subspaces F and G of a unitary space are defined as the ranges (or null spaces) of given rectangular matrices A and B. Accurate numerical methods are developed for computing the principal angles θ k ( F , G ) and orthogonal sets of principal vectors u k ∈ F and v k ∈ G , k = 1 , 2 , ⋯ , q = dim ( G ) ≦ dim ( F ) . An important application in statistics is computing the canonical correlations σ k = cos θ k between two sets of variates. A perturbation analysis shows that the condition number for θ k essentially is max ( κ ( A ) , κ ( B ) ) , where κ denotes the condition number of a matrix. The algorithms are based on a preliminary QR-factorization of A and B (or A H and B H ), for which either the method of Householder transformations (HT) or the modified Gram-Schmidt method (MGS) is used. Then cos θ k and sin θ k are computed as the singular values of certain related matrices. Experimental results are given, which indicates that MGS gives θ k with equal precision and fewer arithmetic operations than HT. However, HT gives principal vectors, which are orthogonal to working accuracy, which is not generally true for MGS. Finally, the case when A and/or B are rank deficient is discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
RELATIONS BETWEEN TWO SETS OF VARIATES
HOTELLING, H. (1936) · Biometrika · doi:10.1093/biomet/28.3-4.321 · Cited by 5,263
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929
Self-citationIntroduction to the Theory of Linear Nonselfadjoint Operators in Hilbert Space
Gohberg, I., & Крейн, M. Г. (1969) · Translations of mathematical monographs · doi:10.1090/mmono/018 · Cited by 2,788
Introduction to the theory of linear nonselfadjoint operators
Крейн, M. Г., & Gohberg, I. (1969) · American Mathematical Society eBooks · Cited by 2,198
The Rotation of Eigenvectors by a Perturbation. III
Davis, C., & Kahan, W. M. (1970) · SIAM Journal on Numerical Analysis · doi:10.1137/0707001 · Cited by 1,175
Numerical methods for solving linear least squares problems
Golub, G. (1965) · Numerische Mathematik · doi:10.1007/bf01436075 · Cited by 849
Self-citationThe Estimation of Probabilities: An Essay on Modern Bayesian Methods
Sparks, J. N., & Good, I. J. (1967) · American Educational Research Journal · doi:10.2307/1162122 · Cited by 528
Linear least squares solutions by householder transformations
Businger, P., & Golub, G. H. (1965) · Numerische Mathematik · doi:10.1007/bf01436084 · Cited by 508
Self-citationSolving linear least squares problems by Gram-Schmidt orthogonalization
Björck, Å. (1967) · BIT · doi:10.1007/bf01934122 · Cited by 470
Self-citation
Cited by
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
Concept Decompositions for Large Sparse Text Data Using Clustering
Dhillon, I. S., & Modha, D. S. (2001) · Machine Learning · doi:10.1023/a:1007612920971 · Cited by 1,293
Packing Lines, Planes, etc.: Packings in Grassmannian Spaces
Conway, J. H., Hardin, R. H., & Sloane, N. J. A. (1996) · Experimental Mathematics · doi:10.1080/10586458.1996.10504585 · Cited by 755
Some Modified Matrix Eigenvalue Problems
Golub, G. H. (1973) · SIAM Review · doi:10.1137/1015032 · Cited by 728
Self-citationNeural constraints on learning
Sadtler, P. T., Quick, K. M., Golub, M. D., Chase, S. M., Ryu, S. I., Tyler-Kabara, E. C., Yu, B. M., & Batista, A. P. (2014) · Nature · doi:10.1038/nature13665 · Cited by 713
Metadata
- Authors
- Björck, Ȧ., & Golub, G. H.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1973
- Volume
- 27
- Issue
- 123
- Pages
- 579-594
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W2087399108
- Cited by
- 865
- References
- 13
- FWCI
- 2.61
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Numerical methods for computing angles between linear subspaces. https://app.cochat.ai/papers/10.1090/s0025-5718-1973-0348991-3
- The paper
- Björck, Ȧ., & Golub, G. H. (1973). Numerical methods for computing angles between linear subspaces. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1973-0348991-3
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.