The authors study regularization of non-linear inverse
problems by projection methods. Non-linearity is controlled by some range invariance assumption. Emphasis is on approximation theoretic properties of the discretization which determine the convergence rates. Instead of using source conditions for the true solution to represent the error, the authors show how distance functions with respect to some benchmark smoothness are able to replace this. Some examples indicate how the results can be applied.
Keywords:
Non-linear ill-posed problems, regularization by discretization, Jackson- and Bernstein-type inequalities, convergence rates, fixed-point iteration, balancing principle, error estimates, distance functions, range inclusions