Regularizing Newton-Kaczmarz methods for nonlinear ill-posed problems
We introduce a class of stabilizing Newton-Kaczmarz methods for nonlinear ill-posed
problems and analyze their convergence and regularization behaviour. As usual for iterative methods
for solving nonlinear ill-posed problems, conditions on the nonlinearity (or the derivatives) have to be
imposed in order to obtain convergence. As we shall discuss in general and in some specific examples,
the nonlinearity conditions obtained for the Newton-Kaczmarz methods are less restrictive than those
for previously existing iteration methods and can be verified for several practical applications.
We also discuss the discretization and efficient numerical solution of the linear problems arising in each step of a Newton-Kaczmarz method, and carry out numerical experiments for two model problems.
We also discuss the discretization and efficient numerical solution of the linear problems arising in each step of a Newton-Kaczmarz method, and carry out numerical experiments for two model problems.
BibTex references
@Article{BK06,
author = {Burger, M. and Kaltenbacher, B.},
title = {Regularizing Newton-Kaczmarz methods for nonlinear ill-posed problems},
journal = {SIAM J. Numer. Anal.},
volume = {44},
pages = {153-182},
year = {2006},
url = \{/2006/BK06},
}


![nk_rev.pdf [659Ko]](http://wwwmath.uni-muenster.de/num/publications/images/pdf.png)
