Some results on the regularization of LSQR for large-scale discrete ill-posed problems (Q1708059)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6855824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some results on the regularization of LSQR for large-scale discrete ill-posed problems |
scientific article; zbMATH DE number 6855824 |
Statements
Some results on the regularization of LSQR for large-scale discrete ill-posed problems (English)
0 references
4 April 2018
0 references
The authors derive bounds for the \(2\)-norm distance between the \(k\)-dimensional Krylov subspace of the LSQR algorithm and the \(k\)-dimensional right singular space. Therefore they show that the algorithm has better regularizing effects for severely and moderately ill-posed problems than for mildly ill-posed ones. Numerical experiments illustrating these regularizing properties of LSQR algorithm are also presented.
0 references
ill-posed problem
0 references
regularization
0 references
Lanczos bidiagonalization
0 references
LSQR
0 references
CGLS
0 references
hybrid LSQR
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8989387154579163
0 references
0.867332398891449
0 references
0.8564121127128601
0 references
0.79095458984375
0 references
0.7891514301300049
0 references
