On deconvolution methods
Abstract
Several methods for solving efficiently the one-dimensional deconvolution problem are proposed. The problem is to solve the Volterra equation k u:=∫0t k(t-s)u(s)ds=g(t), 0≤ t≤ T. The data, g(t), are noisy. Of special practical interest is the case when the data are noisy and known at a discrete set of times. A general approach to the deconvolution problem is proposed: represent k=A(I+S), where a method for a stable inversion of A is known, S is a compact operator, and I+S is injective. This method is illustrated by examples: smooth kernels k(t), and weakly singular kernels, corresponding to Abel-type of integral equations, are considered. A recursive estimation scheme for solving deconvolution problem with noisy discrete data is justified mathematically, its convergence is proved, and error estimates are obtained for the proposed deconvolution method.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.