Convergence Rates for Inverse Problems with Impulsive Noise
Abstract: We study inverse problems F(f) = g with perturbed right hand side g{obs} corrupted by so-called impulsive noise, i.e. noise which is concentrated on a small subset of the domain of definition of g. It is well known that Tikhonov-type regularization with an L1 data fidelity term yields significantly more accurate results than Tikhonov regularization with classical L2 data fidelity terms for this type of noise. The purpose of this paper is to provide a convergence analysis explaining this remarkable difference in accuracy. Our error estimates significantly improve previous error estimates for Tikhonov regularization with L1-fidelity term in the case of impulsive noise. We present numerical results which are in good agreement with the predictions of our analysis.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.