Published online by Cambridge University Press: 08 July 2009
The numerical solution of ill-posed problems requires suitableregularization techniques. One possible option is to consider timeintegration methods to solve the Showalter differential equationnumerically. The stopping time of the numerical integrator correspondsto the regularization parameter. A number of well-knownregularization methods such as the Landweber iteration or theLevenberg-Marquardt method can be interpreted as variants of theEuler method for solving the Showalter differential equation. Motivated by an analysis of the regularization properties of theexact solution of this equation presented by [U. Tautenhahn, Inverse Problems10 (1994) 1405–1418], we consider a variant of the exponential Euler methodfor solving the Showalter ordinary differential equation. We discuss asuitable discrepancy principle for selecting the step sizes withinthe numerical method and we review the convergence properties of [U. Tautenhahn, Inverse Problems10 (1994) 1405–1418], and of our discrete version [M. Hochbruck et al., Technical Report (2008)].Finally, we present numerical experiments which show that thismethod can be efficiently implemented by using Krylov subspacemethods to approximate the product of a matrix function with avector.