On deconvolution methods
Alexander G. Ramm, A. Galstian
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.
Create a lesson
Related papers
Sensitivity Calculus and its Numerical Implementation for Multi-D Hyperbolic Balance Laws
Olivia Dreßen, Michael Herty, Adrian Kolb et al.
A Unified Framework for Wasserstein Convergence of ULMC Methods beyond Log-Concavity: Old and New
Wanjie Lyu, Xiaojie Wang, Bin Yang
Beyond PINNs: A Unified Gauss--Newton and Petrov--Galerkin Framework for Neural and Hybrid PDE Solvers
Nilo Schwencke, Roland Maier
Incremental Column Subset Selection via Conditional Determinantal Point Processes
Laura Grigori, Zhipeng Xue
A Hybrid High-Order Method for the Elasticity Problem with Linear Slip Interface
Erik Burman, Peiqi Huang
Adaptive Sparse-grid Discontinuous Galerkin Approximations the Bhatnagar--Gross--Krook Model
Stefan Schnake, Miroslav Stoyanov, Eirik Endeve et al.