.png){kind=icon}
.png){kind=icon}
Return
Fast cg-based methods for Tikhonov-Phillips regularization
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827596313310.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Tikhonov-Phillips regularization is one of the best-known regularization methods for inverse problems. A posteriori criteria for determining the regularization parameter alpha require solving (*) (A*A + alpha I)x = A*y(delta) for different values of alpha. We investigate two methods for accelerating the standard cg-algorithm for solving the family of systems (*). The first one utilizes a stopping criterion for the cg-iterations which depends on alpha and delta. The second method exploits the shifted structure of the linear systems (*), which allows us to solve (*) simultaneously for different values of alpha. We present numerical experiments for three test problems which illustrate the practical efficiency of the new methods. The experiments as well as theoretical considerations show that run times are accelerated by a factor of at least 3.
Keywords:
cg-method
shifted systems
ill-posed problems
Tikhonov-Phillips regularization
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available