Abstract

In this paper, we study convergence of two different iterative regularization methods for nonlinear ill-posed problems in Banach spaces. One of them is a Landweber type iteration, the other one the iteratively regularized Gauss–Newton method with an a posteriori chosen regularization parameter in each step. We show that a discrepancy principle as a stopping rule renders these iteration schemes regularization methods, i.e., we prove their convergence as the noise level tends to zero. The theoretical findings are illustrated by two parameter identification problems for elliptic PDEs.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.