Article
Licensed
Unlicensed Requires Authentication

Complexity analysis of the iteratively regularized Gauss–Newton method with inner CG-iteration

Published/Copyright: January 26, 2010
Journal of Inverse and Ill-posed Problems
From the journal Volume 17 Issue 9

Abstract

In this paper we investigate the numerical complexity to solve nonlinear ill-posed problems when the operator equations F(x) = yδ are solved by the iteratively regularized Gauss–Newton method (IRGNM) with inner CG-iteration. Additionally we consider a preconditioned version of the IRGNM and compare the complexity of the standard IRGNM and its preconditioned version. In the case of exponentially ill-posed problems we show the superiority of the preconditioned IRGNM, that is we prove that the preconditioning techniques presented in this paper yield a significant reduction of the total complexity.

Received: 2009-04-07
Published Online: 2010-01-26
Published in Print: 2009-December

© de Gruyter 2009

Downloaded on 12.4.2026 from https://www.degruyterbrill.com/document/doi/10.1515/JIIP.2009.051/html
Scroll to top button