Acta mathematica scientia, Series B >
A FAST CONVERGENT METHOD OF ITERATED REGULARIZATION
Received date: 2006-12-01
Online published: 2009-03-20
This article presents a fast convergent method of iterated regularization based on the idea of Landweber iterated regularization, and a method for a-posteriori choice by the Morozov discrepancy principle and the optimum asymptotic convergence order of the regularized solution is obtained. Numerical test shows that the method of iterated regu-larization can quicken the convergence speed and reduce the calculation burden efficiently.
Huang Xiaowei , Wu Chuansheng , Wu Di . A FAST CONVERGENT METHOD OF ITERATED REGULARIZATION[J]. Acta mathematica scientia, Series B, 2009 , 29(2) : 341 -348 . DOI: 10.1016/S0252-9602(09)60034-5
[1] Engl H W, Hanke M, Neubauer. A Regularization of Inverse Problems. Dordrecht: Kluwer, 1996
[2] Hanke M, Neubauer A, Scherzer O. A convergence analysis of the landweber iteration for nonlinear ill-posed
problems. J Number Math, 1995, 72: 21–37
[3] Ramlau R. Modified landweber methods for inverse problems. J Number Funct Anal Optimiz, 1999, 20:
79–98
[4] Hanke M. Accelerated landweber iterations for the solution of ill-posed equations. J Numer Math, 1991,
60: 341–373
[5] Neubauer A. On Landweber iteration for nonlinear ill-posed problems in Hilbert scales. J Numer Math,
2000, 85: 309–328
[6] Bruckner G, Cheng J. Tikhonove regularization for an integer equation of the first kind with logarithmic
kernel. J Inverse Ill-posed Problems, 2000, 8: 665–675
[7] Bruckner G, Pereverzev S. Self-regularization of projection method with a posteriori discretization level
choice for severely ill-posed problems. J Inverse Ill-posed Problems, 2003, 19: 147–151
/
| 〈 |
|
〉 |