LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Christopher C. Paige, Michael A. Saunders
ACM Transactions on Mathematical Software · 1982 · 4,461 citationsOpen access
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Paige, C. C., & Saunders, M. A. (1982). LSQR: An algorithm for sparse linear equations and sparse least squares. ACM Transactions on Mathematical Software, 8(1), 43–71. https://doi.org/10.1145/355984.355989
In text: (Paige & Saunders, 1982)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
An iterative method is given for solving Ax ~ffi b and minU Ax -b 112, where the matrix A is large and sparse.The method is based on the bidiagonalization procedure of Golub and Kahan.It is analytically equivalent to the standard method of conjugate gradients, but possesses more favorable numerical properties.Reliable stopping criteria are derived, along with estimates of standard errors for x and the condition number of A. These are used in the FORTRAN implementation of the method, subroutine LSQR.Numerical tests are described comparing I~QR with several other conjugate-gradient algorithms, indicating that I~QR is the most reliable algorithm when A is ill-conditioned.
Related papers
- Maximum Likelihood from Incomplete Data Via the EM Algorithm1977
- Ridge Regression: Biased Estimation for Nonorthogonal Problems1970
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties2001
- ESPRIT-estimation of signal parameters via rotational invariance techniques1989
- Time Series: Theory and Methods1992
Metadata from OpenAlex (CC0). Citations are generated from the published record.