The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Solving linear least squares problems by Gram-Schmidt orthogonalization
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
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
The Theory of Matrices in Numerical Analysis.
Haynsworth, E. V., & Householder, A. S. (1966) · The American Mathematical Monthly · doi:10.2307/2314680 · Cited by 1,363
Rounding errors in algebraic processes
(1964) · Journal of the Franklin Institute · doi:10.1016/0016-0032(64)90390-4 · Cited by 1,315
THE THEORY OF MATRICES IN NUMERICAL ANALYSIS
Mirsky, L. (1965) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-40.1.378b · Cited by 1,148
Numerical methods for solving linear least squares problems
Golub, G. (1965) · Numerische Mathematik · doi:10.1007/bf01436075 · Cited by 849
Experiments on Gram-Schmidt orthogonalization
Rice, J. R. (1966) · Mathematics of Computation · doi:10.1090/s0025-5718-1966-0192673-4 · Cited by 169
Note on the iterative refinement of least squares solution
Golub, G. H., & Wilkinson, J. H. (1966) · Numerische Mathematik · doi:10.1007/bf02166032 · Cited by 112
Cited by
Orthogonal least squares learning algorithm for radial basis function networks
Chen, S., Cowan, C. F. N., & Grant, P. M. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80341 · Cited by 3,362
Numerical methods for computing angles between linear subspaces
Björck, Ȧ., & Golub, G. H. (1973) · Mathematics of Computation · doi:10.1090/s0025-5718-1973-0348991-3 · Cited by 865
Self-citationNeural networks for nonlinear dynamic system modelling and identification
CHEN, S., & BILLINGS, S. A. (1992) · International Journal of Control · doi:10.1080/00207179208934317 · Cited by 720
Discrete square root filtering: A survey of current techniques
Kaminski, P., Bryson, A., & Schmidt, S. (1971) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1971.1099816 · Cited by 468
Tracking and Kalman Filtering Made Easy
Brookner, E. (1998) · doi:10.1002/0471224197 · Cited by 435
Communication-optimal Parallel and Sequential QR and LU Factorizations
Demmel, J., Grigori, L., Hoemmen, M., & Langou, J. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/080731992 · Cited by 407
Perturbation theory for pseudo-inverses
Wedin, P.-Å. (1973) · BIT · doi:10.1007/bf01933494 · Cited by 346
Practical identification of NARMAX models using radial basis functions
CHEN, S., BILLINGS, S. A., COWAN, C. F. N., & GRANT, P. M. (1990) · International Journal of Control · doi:10.1080/00207179008953599 · Cited by 306
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Frances-Villora, J. V., Rosado-Muñoz, A., Martínez-Villena, J. M., Bataller-Mompean, M., Guerrero, J. F., & Wegrzyn, M. (2016) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2016.02.007 · Cited by 49
Metadata
- Authors
- Björck, Å.
- Venue
- BIT
- Published
- 1967-03
- Volume
- 7
- Issue
- 1
- Pages
- 1-21
- ISSN
- 0006-3835 (ISSN-L)
- 1572-9125
- OpenAlex
- W1971662204
- Cited by
- 470
- References
- 8
- FWCI
- 9.65
- 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.