Christopher C. Paige
Supplemental Material
Available for Download
overdetermined or underdetermined sparse systems of linear equations, sparse least squares problems, and damped sparse least squares problems Gams: D9a1
- 1 BJORCK, }k. A bidlagonahzation algorithm for solving ill-posed systems of linear equahons Rep LITH-MAT-R-80-33, Dep. Mathematics, Linkopmg Univ., Lmkoping, Sweden, 1980.Google Scholar
- 2 ELDI~N, L. Algorithms for the regularization of ill-conditioned least squares problems BIT 17 (1977), 134-145.Google Scholar
- 3 HESTENES, M.R, AND STIEFEL, E Methods of conjugate gradients for solving hneax systems. J Res. N.B.S. 49 (1952), 409-436.Google Scholar
- 4 LAWSON, C.L, AND HANSON, R.J Solwng Least Squares Problems. Prentice-Hall, Englewood Cliffs, N.J., 1974.Google Scholar
- 5 LAWSON, C.L, HANSON, R J., KINCAID, D.R, AND KROGH, F T Basic linear algebra subprograms for Fortran usage ACM Trans Math Softw 5, 3 (Sept 1979), 308-323 and (Algorithm) 324-325. Google Scholar
- 6 PAIGE, C.C., AND SAUNDERS, M A LSQR An algomthm for sparse hnear equations and sparse least squares ACM Trans Math Softw 8, 1 (March 1982), 43-71 Google Scholar
- 7 SMITH, G., AND CAMPBELL, V. A critique of some ridge regression methods. J. Am. Star. Assoc. 75, 369 (March 1980), 74-81Google Scholar
- 8 VARAH, J.M A practical examination of some numerical methods for linear discrete ill-posed problems SIAM Rev. 21 (1979), 100-111.Google Scholar
- 9 WOLD, S., WOLD, H., DUNN, W.J., AND RUHE, A. The coUinearity problem in linear and nonlinear regression. The partial least squares (PLS) approach to generalized inverses. Rep. UMINF-83.80, Univ. Ume~, Ume~, Sweden, 1980.Google Scholar
- PAIGE, C.C. AND SAUNDERS, M.A. LSQR: AN ALGOR~T~ FOR SPARSE LINEAR EQUATIONS AND SPARSE LEAST SQUARES. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 8, 1 (MARCH 1982). Google Scholar
- LAWSON, C.L., HANSON, R.J., K~NCAID, D.R. AND KROGH, F.T. BASIC LINEAR ALGEBRA SUBPROGRAMS FOR FORTRAN USAGE. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE 5, 3 (SEPT 1979), 3@8-323 AND 324-325. Google Scholar
Index Terms
- Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems
Recommendations
The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
In recent years, a variety of preconditioners have been proposed for use in solving large sparse linear least-squares problems. These include simple diagonal preconditioning, preconditioners based on incomplete factorizations, and stationary inner ...
Solving Generalized Least-Squares Problems with LSQR
An iterative method for solving augmented linear systems in a generalized least-squares sense is given. The method, LSQR(A-1), is shown to be a natural extension of the LSQR algorithm of Paige and Saunders [ACM Trans. Math. Software, 8 (1982), pp. 43--...
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
† Special Section: 2010 Copper Mountain ConferenceAn 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 ...
Comments