The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Numerical methods for solving linear least squares problems
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
Unitary Triangularization of a Nonsymmetric Matrix
Householder, A. S. (1958) · Journal of the ACM · doi:10.1145/320941.320947 · Cited by 629
Riley, J. D. (1955) · Mathematics of Computation · doi:10.1090/s0025-5718-1955-0074915-1 · Cited by 116
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
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
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
Factorization Methods for Discrete Sequential Estimation
(1977) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6052-7 · Cited by 1,847
A Projection Pursuit Algorithm for Exploratory Data Analysis
Friedman, J. H., & Tukey, J. W. (1974) · IEEE Transactions on Computers · doi:10.1109/t-c.1974.224051 · Cited by 1,652
Threshold Autoregression, Limit Cycles and Cyclical Data
Tong, H., & Lim, K. S. (1980) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1980.tb01126.x · Cited by 1,309
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-citationA multistage representation of the Wiener filter based on orthogonal projections
Goldstein, J. S., Reed, I. S., & Scharf, L. L. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.737524 · Cited by 838
Approximation Theory and Methods.
Wahlbin, L. B., & Powell, M. J. D. (1982) · Mathematics of Computation · doi:10.2307/2007351 · Cited by 805
Some Modified Matrix Eigenvalue Problems
Golub, G. H. (1973) · SIAM Review · doi:10.1137/1015032 · Cited by 728
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
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
Gu, M., & Eisenstat, S. C. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917055 · Cited by 677
Parallel Preconditioning with Sparse Approximate Inverses
Grote, M. J., & Huckle, T. (1997) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827594276552 · Cited by 600
Solving linear least squares problems by Gram-Schmidt orthogonalization
Björck, Å. (1967) · BIT · doi:10.1007/bf01934122 · Cited by 470
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
Relative-Error $CUR$ Matrix Decompositions
Drineas, P., Mahoney, M. W., & Muthukrishnan, S. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/07070471x · Cited by 461
Observers for linear systems with unknown inputs
Kudva, P., Viswanadham, N., & Ramakrishna, A. (1980) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1980.1102245 · Cited by 459
A Signal Processing Perspective on Hyperspectral Unmixing: Insights from Remote Sensing
Ma, W.-K., Bioucas-Dias, J. M., Chan, T.-H., Gillis, N., Gader, P., Plaza, A. J., Ambikapathi, A., & Chi, C.-Y. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2279731 · Cited by 456
Displacement Structure: Theory and Applications
Kailath, T., & Sayed, A. H. (1995) · SIAM Review · doi:10.1137/1037082 · Cited by 436
Tracking and Kalman Filtering Made Easy
Brookner, E. (1998) · doi:10.1002/0471224197 · Cited by 435
On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
Stewart, G. W. (1977) · SIAM Review · doi:10.1137/1019104 · Cited by 416
CoSLAM: Collaborative Visual SLAM in Dynamic Environments
Zou, D., & Tan, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.104 · Cited by 382
Three-Dimensional Reconstruction from Projections: A Review of Algorithms
Gordon, R., & Herman, G. (1974) · International Review of Cytology · doi:10.1016/s0074-7696(08)60925-0 · Cited by 335
A General Computer for Econometric Models--Shazam
White, K. J. (1978) · Econometrica · doi:10.2307/1913664 · Cited by 334
Björck, Å. (1990) · Handbook of Numerical Analysis · doi:10.1016/s1570-8659(05)80036-5 · Cited by 313
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
Mutwil, M., Klie, S., Tohge, T., Giorgi, F. M., Wilkins, O., Campbell, M. M., Fernie, A. R., Usadel, B., Nikoloski, Z., & Persson, S. (2011) · The Plant Cell · doi:10.1105/tpc.111.083667 · Cited by 299
An improved approximation algorithm for the column subset selection problem
Boutsidis, C., Mahoney, M. W., & Petros Drineas, B. (2009) · doi:10.5555/1496770.1496875 · Cited by 286
Algorithm 915, SuiteSparseQR: Multifrontal multithreaded rank-revealing sparse QR factorization
Davis, T. A. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049670 · Cited by 271
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Subset Selection Algorithms: Randomized vs. Deterministic
Broadbent, M., Brown, M., & Penner, K. (2010) · SIAM Undergraduate Research Online · doi:10.1137/09s010435 · Cited by 32
Metadata
- Authors
- Golub, G.
- Venue
- Numerische Mathematik
- Published
- 1965-06
- Volume
- 7
- Issue
- 3
- Pages
- 206-216
- ISSN
- 0029-599X (ISSN-L)
- 0945-3245
- OpenAlex
- W2016182223
- Cited by
- 849
- References
- 2
- FWCI
- 6.89
- 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.