LSQR
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems. An iterative method is given for solving Ax = b and min|| Ax - b||2 , 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 LSQR with several other conjugate-gradient algorithms, indicating that LSQR is the most reliable algorithm when A is ill-conditioned.
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 305 articles , 1 standard article )
Showing results 1 to 20 of 305.
Sorted by year (- Estrin, Ron; Orban, Dominique; Saunders, Michael A.: LSLQ: an iterative method for linear least-squares with an error minimization property (2019)
- Matteo Ravasi, Ivan Vasconcelos: PyLops - A Linear-Operator Python Library for large scale optimization (2019) arXiv
- Tibaut, Jan; Ravnik, Jure: Fast boundary-domain integral method for heat transfer simulations (2019)
- Akbari, Amir; Barton, Paul I.: An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks (2018)
- Arreckx, Sylvain; Orban, Dominique: A regularized factorization-free method for equality-constrained optimization (2018)
- Bentbib, A. H.; El Guide, M.; Jbilou, K.; Onunwor, E.; Reichel, L.: Solution methods for linear discrete ill-posed problems for color image restoration (2018)
- Calvetti, D.; Pitolli, F.; Somersalo, E.; Vantaggi, B.: Bayes meets Krylov: statistically inspired preconditioners for CGLS (2018)
- Clempner, Julio B.; Poznyak, Alexander S.: A Tikhonov regularized penalty function approach for solving polylinear programming problems (2018)
- Estrin, Ron; Greif, Chen: SPMR: A family of saddle-point minimum residual solvers (2018)
- Fougner, Christopher; Boyd, Stephen: Parameter selection and preconditioning for a graph form solver (2018)
- Hallman, Eric; Gu, Ming: LSMB: minimizing the backward error for least-squares problems (2018)
- Jia, Zhongxiao; Yang, Yanfei: Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization (2018)
- Kim, Kyoum Sun; Yun, Jae Heon: Image deblurring using global PCG method with Kronecker product preconditioner (2018)
- Ling, Si-Tao; Wang, Ming-Hui; Cheng, Xue-Han: A new implementation of LSMR algorithm for the quaternionic least squares problem (2018)
- McDonald, Eleanor; Pestana, Jennifer; Wathen, Andy: Preconditioning and iterative solution of all-at-once systems for evolutionary partial differential equations (2018)
- Novati, P.: A convergence result for some Krylov-Tikhonov methods in Hilbert spaces (2018)
- Rao, Kaustubh; Malan, Paul; Perot, J. Blair: A stopping criterion for the iterative solution of partial differential equations (2018)
- Scott, Jennifer; Tůma, Miroslav: A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (2018)
- Vasil’kov, Denis Dmitrievich: Global balancing of a triangular mesh (2018)
- Vuik, C.: Krylov subspace solvers and preconditioners (2018)