On the choice of solution subspace for nonstationary iterated Tikhonov regularization (Q306369)
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 6620992
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the choice of solution subspace for nonstationary iterated Tikhonov regularization |
scientific article; zbMATH DE number 6620992 |
Statements
On the choice of solution subspace for nonstationary iterated Tikhonov regularization (English)
0 references
31 August 2016
0 references
The authors propose and analyze iterative methods for the normal equation of Tikhonov regularization of large sparse linear least squares problems. They consider a partial Golub-Kahan bidiagonalization of the problem matrix and determine approximate solutions in the associated Krylov subspace. Numerical experiments are also provided.
0 references
ill-posed problem
0 references
nonstationary iterated Tikhonov regularization
0 references
Golub-Kahan bidiagonalization
0 references
Arnoldi process
0 references
Krylov subspace method
0 references
generalized Krylov subspace method
0 references
large sparse linear least squares problems
0 references
numerical experiments
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8870811462402344
0 references
0.8657032251358032
0 references
0.851681649684906
0 references
0.850157618522644
0 references
