On elimination of accuracy saturation of regularizing algorithms

A general approach to modification of well-known methods for the solution of linear ill-posed problems is proposed. The approach enables us to exclude a possible “saturation of accuracy” of methods on classes of sourcewise representable solutions. As a result, the modified methods possess the optimal order of accuracy on each of these classes. Numerical examples for the solution of 1D and 2D inverse problems are presented.