A modified landweber method for inverse problems

From MaRDI portal





The paper is concerned with operator equations \[ F(x)= y,\tag{1} \] where \(F\) is a continuous mapping between Hilbert space \(X\) and \(Y\). We call such an equation ill-posed if the solution of equation (1) does not depend continuously on the data \(y\). In most practical applications only a noisy version \(y^\delta\) of the exact data \(y\) is given with \[ \|y- y^\delta\|\leq\delta. \] In case of perturbed data \(y^\delta\), the computation of a proper approximation \(x^\delta\) to a solution \(x_*\) of (1) requires regularization methods, which control the influence of the data noise. The author of the paper proposes a modification of Landweber's method that reduces the numerical effort considerably. Landweber's method is a well-known regularization for linear and nonlinear ill-posed operator equations. The basic idea of the modification comes from the observation that the use of a rough approximation \(F_m\) to \(F\) within the first iteration steps has no influence on the quality of the iterates, as long as the iteration is continued with a sufficient good approximation to \(F\). This leads to the iteration formula \[ x^\delta_{k+1}= x^\delta_k+ F_{r(k)}'(x^\delta_k)^* (y^\delta- F_{r(k)}(x^\delta_k)). \] The mapping \(r:\mathbb{N}\to \mathbb{N}\) assigns via \(k\mapsto F_{r(k)}\) the approximation, to be used within the next iteration step. The value of \(r(k)\) is determined with a discrepancy principle, based on the remainder \(\|y^\delta- F_{r(k- 1)}(x^\delta_k)\|\). In combination with an a posteriori stopping rule it is shown that the modified Landweber method is a regularization method. Numerical examples for the linear and nonlinear case illustrate the efficiency of the method.




Cited in
(33)








This page was built for publication: A modified landweber method for inverse problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4239758)