Fast CG-Based Methods for Tikhonov--Phillips Regularization (Q4253091)
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 1307773
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast CG-Based Methods for Tikhonov--Phillips Regularization |
scientific article; zbMATH DE number 1307773 |
Statements
Fast CG-Based Methods for Tikhonov--Phillips Regularization (English)
0 references
24 June 1999
0 references
cg-method
0 references
shifted systems
0 references
ill-posed problems
0 references
Tikhonov-Phillips regularization
0 references
conjugate gradient algorithms
0 references
0.7969472408294678
0 references
The authors study two methods for accelerating the standard conjugate gradient (cg) algorithms for solving a family of systems of the type \[ (A^*A+\alpha I)x= A^* y^\delta. \] In the first method a stopping criterion is developed for the cg-iterates which is linked to the noise level \(\delta\) and the current value of \(\alpha\). The second method uses three-term recurrence Lanczos process to compute the solutions simultaneously for different values of \(\alpha\).
0 references
