English

On deconvolution methods

Numerical Analysis 2025-10-20 v1 Numerical Analysis

Abstract

Several methods for solving efficiently the one-dimensional deconvolution problem are proposed. The problem is to solve the Volterra equation ku:=0tk(ts)u(s)ds=g(t),0tT{\mathbf k} u:=\int_0^t k(t-s)u(s)ds=g(t),\quad 0\leq t\leq T. The data, g(t)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){\mathbf k}=A(I+S), where a method for a stable inversion of AA is known, SS is a compact operator, and I+SI+S is injective. This method is illustrated by examples: smooth kernels k(t)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.

Keywords

Cite

@article{arxiv.math/0301382,
  title  = {On deconvolution methods},
  author = {Alexander G. Ramm and A. Galstian},
  journal= {arXiv preprint arXiv:math/0301382},
  year   = {2025}
}