论文信息 - Saturation of Regularization Methods for Linear Ill-Posed Problems in Hilbert Spaces

Saturation of Regularization Methods for Linear Ill-Posed Problems in Hilbert Spaces

We prove the saturation of methods for solving linear ill-posed problems in Hilbert spaces for a wide class of regularization methods. It turns out that, under a certain convexity assumption, saturation must necessarily occur. We provide easy to verify assumptions, which allow us to calculate the rate at which saturation occurs.

Peter Mathé

[1] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2] Markus Hegland,et al. Variable hilbert scales and their interpolation inequalities with applications to tikhonov regularization , 1995 .

[3] P. Mathé,et al. Discretization strategy for linear ill-posed problems in variable Hilbert scales , 2003 .

[4] Markus Hegland,et al. An optimal order regularization method which does not use additional smoothness assumptions , 1992 .

[5] H. Engl,et al. Regularization of Inverse Problems , 1996 .

[6] P. Mathé,et al. Geometry of linear ill-posed problems in variable Hilbert scales Inverse Problems 19 789-803 , 2003 .

[7] Andreas Neubauer,et al. On Converse and Saturation Results for Tikhonov Regularization of Linear Ill-Posed Problems , 1997 .