Least Squares Computations by Givens Transformations Without Square Roots
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
The use of Givens transformations and the QR decomposition to solve linear least squares problems has several advantages, particularly when the design matrix is sparse or large. A modification that eliminates the square roots and reduces the number of multiplications by one half, as well as facilitating weighted least squares at no extra cost, makes the method even more attractive.
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
The algebraic eigenvalue problem
Wilkinson, J. H. (1965) · Cited by 5,833
Cited by
Basic Linear Algebra Subprograms for Fortran Usage
Lawson, C. L., Hanson, R. J., Kincaid, D. R., & Krogh, F. T. (1979) · ACM Transactions on Mathematical Software · doi:10.1145/355841.355847 · Cited by 1,634
Solution of Sparse Indefinite Systems of Linear Equations
Paige, C. C., & Saunders, M. A. (1975) · SIAM Journal on Numerical Analysis · doi:10.1137/0712047 · Cited by 1,620
iSAM2: Incremental smoothing and mapping using the Bayes tree
Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J. J., & Dellaert, F. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911430419 · Cited by 1,362
“New measurements are added using matrix update equations (Gill et al., 1974; Gentleman, 1973; Golub and Loan, 1996), so that previously calculated components of the square root information matrix are reused.”
MethodiSAM: Incremental Smoothing and Mapping
Kaess, M., Ranganathan, A., & Dellaert, F. (2008) · IEEE Transactions on Robotics · doi:10.1109/tro.2008.2006706 · Cited by 1,076
“Golub and Van Loan [8] present general methods for updating matrix factorizations based on [53], [54], including the Givens rotations we use in this paper.”
MethodGreen, P. J. (1984) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1984.tb01288.x · Cited by 687
Methods for modifying matrix factorizations
Gill, P. E., Golub, G. H., Murray, W., & Saunders, M. A. (1974) · Mathematics of Computation · doi:10.1090/s0025-5718-1974-0343558-6 · Cited by 590
Matrix Triangularization By Systolic Arrays:
Gentleman, W. M., & Kung, H. T. (1982) · SPIE Proceedings · doi:10.1117/12.932507 · Cited by 459
Self-citationA state-space approach to adaptive RLS filtering
Sayed, A. H., & Kailath, T. (1994) · IEEE Signal Processing Magazine · doi:10.1109/79.295229 · Cited by 449
Displacement Structure: Theory and Applications
Kailath, T., & Sayed, A. H. (1995) · SIAM Review · doi:10.1137/1037082 · Cited by 436
Recursive hybrid algorithm for non-linear system identification using radial basis function networks
CHEN, S., BILLINGS, S. A., & GRANT, P. M. (1992) · International Journal of Control · doi:10.1080/00207179208934272 · Cited by 343
A Survey of Parallel Algorithms in Numerical Linear Algebra
Heller, D. (1978) · SIAM Review · doi:10.1137/1020096 · Cited by 337
Energy levels, intensities, and linewidths of atmospheric carbon dioxide bands
Rothman, L. S., Hawkins, R. L., Wattson, R. B., & Gamache, R. R. (1992) · Journal of Quantitative Spectroscopy and Radiative Transfer · doi:10.1016/0022-4073(92)90119-o · Cited by 319
Björck, Å. (1990) · Handbook of Numerical Analysis · doi:10.1016/s1570-8659(05)80036-5 · Cited by 313
A survey of sparse matrix research
Duff, I. S. (1977) · Proceedings of the IEEE · doi:10.1109/proc.1977.10514 · Cited by 262
Metadata
- Authors
- GENTLEMAN, W. M.
- Venue
- IMA Journal of Applied Mathematics
- Publisher
- Oxford University Press (OUP)
- Published
- 1973
- Volume
- 12
- Issue
- 3
- Pages
- 329-336
- ISSN
- 0272-4960 (ISSN-L)
- 1464-3634
- OpenAlex
- W2036050714
- Cited by
- 479
- References
- 1
- FWCI
- 11.49
- 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.