Summary.
The convergence analysis of Landweber's iteration for the solution of nonlinear ill–posed problem has been developed recently by Hanke, Neubauer and Scherzer. In concrete applications, sufficient conditions for convergence of the Landweber iterates developed there (although quite natural) turned out to be complicated to verify analytically. However, in numerical realizations, when discretizations are considered, sufficient conditions for local convergence can usually easily be stated. This paper is motivated by these observations: Initially a discretization is fixed and a discrete Landweber iteration is implemented until an appropriate stopping criterion becomes active. The output is used as an initial guess for a finer discretization. An advantage of this method is that the convergence analysis can be considered in a family of finite dimensional spaces. The numerical performance of this multi level algorithm is compared with Landweber's iteration.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received October 21, 1996 / Revised version received July 28, 1997
Rights and permissions
About this article
Cite this article
Scherzer, O. An iterative multi level algorithm for solving nonlinear ill–posed problems. Numer. Math. 80, 579–600 (1998). https://doi.org/10.1007/s002110050379
Issue Date:
DOI: https://doi.org/10.1007/s002110050379