1982
DOI: 10.1145/355993.356000
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
345
0
13

Year Published

1996
1996
2014
2014

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 692 publications
(360 citation statements)
references
References 4 publications
2
345
0
13
Order By: Relevance
“…There are two closely related conjugate gradient based methods for least squares problems: CGLS [12] and LSQR 2 [76,77]. We focus our discussion on LSQR.…”
Section: Conjugate Gradient Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…There are two closely related conjugate gradient based methods for least squares problems: CGLS [12] and LSQR 2 [76,77]. We focus our discussion on LSQR.…”
Section: Conjugate Gradient Methodsmentioning
confidence: 99%
“…It can be shown that f k converges to the solution of the least squares problem min g − Kf 2 . We omit specific implementation details, and refer to [76,77]. However, we do mention the following important points:…”
Section: Lsqr and Filteringmentioning
confidence: 99%
“…We solve for each frequency band using sparse matrix methods (LSQR; Paige and Saunders, 1982), applying first difference regularization to the attenuation terms and constrain the site terms to sum to zero. For the discretization, we assume cell size 0.1 X 0.1 degrees for all frequency bands.…”
Section: Methodology Overviewmentioning
confidence: 99%
“…It is known that, computationally speaking, GMRES is more expensive than other Krylov subspace methods, such as Bi-CGSTAB, [14], QMR [24] for general square matrices, or LSQR [19], [20] for anti-symmetric matrices. Nevertheless, it is widely used for solving linear systems derived from the discretization of partial differential equations, since theoretically the 2-norm of the residual vector is minimized inside the Krylov subspace at each step.…”
Section: Gmres(m)mentioning
confidence: 99%