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

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.

[1]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[2]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[3]  A. Householder.  Terminating and Nonterminating Iterations for Solving Linear Systems , 1955 .

[4]  D. Faddeev,et al.  Computational Methods of Linear Algebra , 1959 .

[5]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[6]  Saunders,et al.  Solution of sparse indefinite systems of equations and least squares problems , 1973 .

[7]  C. Paige.  Bidiagonalization of Matrices and Solution of Linear Equations , 1974 .

[8]  Ying-Tung Chen.  Iterative methods for linear least squares problems. , 1974 .

[9]  M. Saunders,et al.  Solution of Sparse Indefinite Systems of Linear Equations , 1975 .

[10]  C. Paige.  Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix , 1976 .

[11]  J. V. Heijst,et al.  Kleinste-kwadraten problemen , 1976 .

[12]  M. Nashed,et al.  Aspects of Generalized Inverses in Analysis and Regularization , 1976 .

[13]  G. W. Stewart,et al.  Research, Development, and LINPACK , 1977 .

[14]  J. G. Lewis.  Algorithms for sparse matrix eigenvalue problems , 1977 .

[15]  M. Saunders,et al.  A Bidiagonalization Algorithm for Sparse Linear Equations and Least-Squares Problems. , 1978 .

[16]  Å. Björck,et al.  Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations , 1979 .

[17]  Å. Björck,et al.  A direct method for the solution of sparse linear least squares problems , 1980 .

[18]  A. George,et al.  Solution of sparse linear least squares problems using givens rotations , 1980 .

[19]  Michael A. Saunders,et al.  Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems , 1982, TOMS.

[20]  B. AfeArd.  CALCULATING THE SINGULAR VALUES AND PSEUDOINVERSE OF A MATRIX , 2022 .