The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
Abstract
An iterative method LSMR is presented for solving linear systems $Ax=b$ and least-squares problems $\min \|Ax-b\|_2$, with A being sparse or a fast linear operator. LSMR is based on the Golub–Kahan bidiagonalization process. It is analytically equivalent to the MINRES method applied to the normal equation $A^T\! Ax = A^T\! b$, so that the quantities $\|A^T\! r_k\|$ are monotonically decreasing (where $r_k = b - Ax_k$ is the residual for the current iterate $x_k$). We observe in practice that $\|r_k\|$ also decreases monotonically, so that compared to LSQR (for which only $\|r_k\|$ is monotonic) it is safer to terminate LSMR early. We also report some experiments with reorthogonalization.
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
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,154
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
Self-citationAccuracy and Stability of Numerical Algorithms: Second Edition
Higham, N. J. (2002) · doi:10.1137/1.9780898718027 · Cited by 3,803
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Calculating the Singular Values and Pseudo-Inverse of a Matrix
Golub, G., & Kahan, W. (1965) · Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis · doi:10.1137/0702016 · Cited by 1,786
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
Self-citationAlgorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems
Paige, C. C., & Saunders, M. A. (1982) · ACM Transactions on Mathematical Software · doi:10.1145/355993.356000 · Cited by 792
Self-citationModified Gram-Schmidt (MGS), Least Squares, and Backward Stability of MGS-GMRES
Paige, C. C., Rozložńık, M., & Strakoš, Z. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/050630416 · Cited by 122
MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems
Choi, S.-C. T., Paige, C. C., & Saunders, M. A. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/100787921 · Cited by 114
Self-citationStopping Criteria for the Iterative Solution of Linear Least Squares Problems
Chang, X.-W., Paige, C. C., & Titley-Péloquin, D. (2009) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/080724071 · Cited by 30
Metadata
- Authors
- Fong, D. C.-L., & Saunders, M.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2011-01
- Volume
- 33
- Issue
- 5
- Pages
- 2950-2971
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W1983886273
- Cited by
- 442
- References
- 11
- FWCI
- 15.55
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: LSMR: An Iterative Algorithm for Sparse Least-Squares Problems. https://app.cochat.ai/papers/10.1137/10079687x
- The paper
- Fong, D. C.-L., & Saunders, M. (2011). LSMR: An Iterative Algorithm for Sparse Least-Squares Problems. SIAM Journal on Scientific Computing. https://doi.org/10.1137/10079687x
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.