article

Free access

LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

Editor: John R. Rice Authors:

Christopher C. Paige,

Michael A. SaundersAuthors Info & Claims

ACM Transactions on Mathematical Software (TOMS), Volume 8, Issue 1

Pages 43 - 71

https://doi.org/10.1145/355984.355989

Published: 01 March 1982 Publication History

PDF eReader

References

[1]

BJORCK, A. Use of conjugate gradients for solving linear least squares problems. In Duff, I.S. (Ed.), Conjugate-Gradwnt Methods and Stmilar Techntques, Rep. AERE R-9636, Computer Science and Systems Division, AERE Harwell, England, 1979, 48-71.

Google Scholar

[2]

BJORCK, A, AND DUFF, I.S. A direct method for the solution of sparse linear least squares problems. Linear Algebra Appl. 34 (1980), 43-67.

Google Scholar

[3]

BJORCK, A, AND ELFVING, T. Accelerated projection methods for computing Pseudoinverse solutions of systems of linear equations. Res Rep. LITH-MAT-R-1978-5, Dep. Mathematics, Linkoping Univ., Linkoping, Sweden, 1978.

Google Scholar

[4]

CHEW, Y.T. Iterative methods for linear least-squares problems. Res. Rep. CS-75-04, Dep. of Computer Science, Univ. Waterloo, Waterloo, Ont., Canada, 1975.

Google Scholar

[5]

ELFVING, T. On the conjugate gradient method for solving linear least-squares problems. Res. Rep. L1TH-MAT-R-1978-3, Dep. Mathematics, Linkoping Univ., Link6ping, Sweden, 1978.

Google Scholar

[6]

FADDEEV, D.K., AND FADDEEVA, V.N. Computational Methods of Linear Algebra, Freeman, London, 1963.

Google Scholar

[7]

GEORGE, A, AND HEATH, M T. Solution of sparse linear least squares problems using Givens rotations. Linear Algebra Appl. 34 (1980), 69-83.

Google Scholar

[8]

GOLUB, G.H. Numerical methods for solving linear least-squares problems. Numer. Math. 7 (1965), 206-216.

Google Scholar

[9]

GOLUB, G.H., AND KAHAN, W. Calculating the singular values and pseudoinverse of a matrix. SIAM J. Numer. Anal. 2 (1965), 205-224.

Google Scholar

[10]

HESTENES, M.R., AND STIEFEL, E. Methods of conjugate gradients for solving linear systems J. Res. N.B.S. 49 (1952), 409-436.

Google Scholar

[11]

HOUSEHOLDER, A.S. Terminating and non-terminating iterations for solving linear systems. SIAM J. Appl. Math. 3 (1955), 67-72.

Google Scholar

[12]

KENNEDY, W.J., AND GENTLE, J.E. Stat~stwal Computing. Marcel Dekker, Inc., New York and Basel, 1980.

Google Scholar

[13]

LANCZOS, C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J Res. N.B.S. 45 (1950), 255-282.

Google Scholar

[14]

LEwis, J.G. Algorithms for sparse matrix eigenvalue problems. Res. Rep. STAN-CS-77-595, Stanford Univ., Stanford, CA, 1977.

Google Scholar

[15]

NASHED, M.Z. Aspects of generalized inverses in analysis and regularization. In Nashed, M.A. (Ed.), Generahzed Inverses and Applwat~ons, Academic Press, New York, 1976, 193-244.

Google Scholar

[16]

NELDER, J.A. GLIMManual. Numerical Algorithms Group, 13 Banbury Road, Oxford, England, 1975

Google Scholar

[17]

PAIGE, C.C. Bidiagonahzatlon of matrices and solution of linear equations. SIAM J. Numer. Anal. 11 (1974), 197-209.

Google Scholar

[18]

PAIGE, C.C. Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix. J. Inst. Maths. Appl 18 (1976), 341-349.

Google Scholar

[19]

PAIGE, C.C., AND SAUNDERS, M.A. Solution of sparse indefinite systems of equations and leastsquares problems Res. Rep. STAN-CS-73-399, Stanford Univ., Stanford, CA, 1973.

Google Scholar

[20]

PAIGE, C.C., AND SAUNDERS, M.A. Solution of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12 (1975), 617-629.

Google Scholar

[21]

PAIGE, C.C., AND SAUNDERS, M.A. A bidiagonalization algorithm for sparse linear equations and least-squares problems. Rep. SOL 78-19, Dep. Operations Research, Stanford Univ., Stanford, CA, 1978.

Google Scholar

[22]

PAIGE, C.C., AND SAUNDERS, M.A. LSQR' Sparse hnear equations and least-squares problems. ACM Trans. Math. Softw., to appear.

Crossref

Google Scholar

[23]

STEWART, G.W. Research, development and LINPACK. In Rice, J.R. (Ed.), Mathematwal Software III, Academic Press, New York, 1977, pp. 1-14.

Google Scholar

[24]

VAN HEIJST, J., JACOBS, J., AND SCHERDERS, J. Kleinste-kwadraten problemen. Dep. Mathematics Rep., Eindhoven University of Technology, Eindhoven, The Netherlands, August 1976

Google Scholar

[25]

WILKINSON, J.H. The Algebraw Etgenvalue Problem. Oxford University Press (Clarendon), New York, 1965.

Crossref

Google Scholar

Cited By

View all

Ata I(2025)CGLS Method for Efficient Equalization of OFDM Systems Under Doubly Dispersive Fading Channels with an Application Into 6G Communications in Smart OvercrowdedInternational Journal of Crowd Science10.26599/IJCS.2023.91000159:1(3-12)Online publication date: Jan-2025
https://doi.org/10.26599/IJCS.2023.9100015
Hu SLuo YXie XZhang H(2025) H ∞ Optimal Load Frequency Control of Power System: A Novel Model-Free Approach IEEE Transactions on Circuits and Systems II: Express Briefs10.1109/TCSII.2024.349567972:1(228-232)Online publication date: Jan-2025
https://doi.org/10.1109/TCSII.2024.3495679
Liu XHan XChi ENadler B(2025)A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix CompletionJournal of Computational and Graphical Statistics10.1080/10618600.2024.2428610(1-13)Online publication date: 9-Jan-2025
https://doi.org/10.1080/10618600.2024.2428610
Show More Cited By

Index Terms

LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
1. Mathematics of computing
  1. Mathematical software

Recommendations

Sparse Linear Least Squares Problems in Optimization

Numerical and computational aspects of direct methods for large and sparse least squares problems are considered. After a brief survey of the most often used methods, we summarize the important conclusions made from a numerical comparison in matlab. ...
A note on sparse least-squares regression

We compute a sparse solution to the classical least-squares problem min"x@?Ax-b@?"2, where A is an arbitrary matrix. We describe a novel algorithm for this sparse least-squares problem. The algorithm operates as follows: first, it selects columns from A,...
Tensor Methods for Large, Sparse Nonlinear Least Squares Problems

This paper introduces tensor methods for solving large, sparse nonlinear least squares problems where the Jacobian either is analytically available or is computed by finite difference approximations. Tensor methods have been shown to have very good ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Mathematical Software

ACM Transactions on Mathematical Software Volume 8, Issue 1

March 1982

89 pages

ISSN:0098-3500

EISSN:1557-7295

DOI:10.1145/355984

Editor:
John R. Rice

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1982

Published in TOMS Volume 8, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3,298
Total Citations
View Citations
8,209
Total Downloads

Downloads (Last 12 months)1,022
Downloads (Last 6 weeks)101

Reflects downloads up to 04 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ata I(2025)CGLS Method for Efficient Equalization of OFDM Systems Under Doubly Dispersive Fading Channels with an Application Into 6G Communications in Smart OvercrowdedInternational Journal of Crowd Science10.26599/IJCS.2023.91000159:1(3-12)Online publication date: Jan-2025
https://doi.org/10.26599/IJCS.2023.9100015
Hu SLuo YXie XZhang H(2025) H ∞ Optimal Load Frequency Control of Power System: A Novel Model-Free Approach IEEE Transactions on Circuits and Systems II: Express Briefs10.1109/TCSII.2024.349567972:1(228-232)Online publication date: Jan-2025
https://doi.org/10.1109/TCSII.2024.3495679
Liu XHan XChi ENadler B(2025)A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix CompletionJournal of Computational and Graphical Statistics10.1080/10618600.2024.2428610(1-13)Online publication date: 9-Jan-2025
https://doi.org/10.1080/10618600.2024.2428610
Warwel ALange DDannowski AContreras‐Reyes EKlaucke IDiaz‐Naveas JMoreno MKopp H(2025)Seismic Structure and Tectonics of the North‐Central Chilean Subduction Zone Along the Copiapó Ridge From Amphibious Seismic Refraction Tomography and Local SeismicityGeochemistry, Geophysics, Geosystems10.1029/2024GC01182926:1Online publication date: 24-Jan-2025
https://doi.org/10.1029/2024GC011829
Warnett JHarris SZwanenburg EWilliams M(2025)“Don’t stop me now!”: Stopping rules for iterative reconstruction with dimensional X-ray Computed TomographyPrecision Engineering10.1016/j.precisioneng.2025.01.01993(406-416)Online publication date: May-2025
https://doi.org/10.1016/j.precisioneng.2025.01.019
Abacha IRoubeche KBendjama HTikhamarine EBoulahia OKherchouche RRahmani SBeldjoudi H(2025)Exploring the structural components of the Bejaia-Babors shear zone (BBSZ) in NE Algeria: Evidence from local earthquake tomography using recent seismic events (2012−2022)Physics of the Earth and Planetary Interiors10.1016/j.pepi.2025.107318360(107318)Online publication date: Mar-2025
https://doi.org/10.1016/j.pepi.2025.107318
Ma XHuang Z(2025)P-wave attenuation variations beneath the central and western Tien Shan from teleseismic wavesJournal of Geodynamics10.1016/j.jog.2024.102063163(102063)Online publication date: Mar-2025
https://doi.org/10.1016/j.jog.2024.102063
Zhang RDatta-Gupta APark JNunna KBriz EGordillo RChen H(2025)Multi-stage three-phase and compositional history matching: Field application to CO2 enhanced oil recovery in the Permian Basin, TexasFuel10.1016/j.fuel.2025.134339387(134339)Online publication date: May-2025
https://doi.org/10.1016/j.fuel.2025.134339
Rateb A(2025)An efficient infinity norm minimization algorithm for under-determined inverse problemsDigital Signal Processing10.1016/j.dsp.2024.104818156:PAOnline publication date: 1-Jan-2025
https://dl.acm.org/doi/10.1016/j.dsp.2024.104818
Li HTan GZhao T(2025)Backward error analysis of the Lanczos bidiagonalization with reorthogonalizationJournal of Computational and Applied Mathematics10.1016/j.cam.2024.116414460(116414)Online publication date: May-2025
https://doi.org/10.1016/j.cam.2024.116414
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Sparse Linear Least Squares Problems in Optimization

A note on sparse least-squares regression

Tensor Methods for Large, Sparse Nonlinear Least Squares Problems

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations