Abstract
LSQR is a popular iterative method for the solution of large linear system of equations and least-squares problems. This paper presents a generalization of LSQR that allows the choice of an arbitrary initial vector for the solution subspace. Computed examples illustrate the benefit of being able to choose this vector.
| Original language | English |
|---|---|
| Pages (from-to) | 643-660 |
| Number of pages | 18 |
| Journal | Numerical Linear Algebra with Applications |
| Volume | 15 |
| Issue number | 7 |
| DOIs | |
| State | Published - Sep 2008 |
Keywords
- Iterative method
- Least-squares problem
- Linear discrete ill-posed problem
- Linear system of equations
ASJC Scopus subject areas
- Algebra and Number Theory
- Applied Mathematics