On deconvolution problems: numerical aspects
Abstract
An optimal algorithm is described for solving the deconvolution problem of the form ku:=∫0tk(t-s)u(s)ds=f(t) given the noisy data fδ, ||f-fδ||≤ δ. The idea of the method consists of the representation k=A(I+S), where S is a compact operator, I+S is injective, I is the identity operator, A is not boundedly invertible, and an optimal regularizer is constructed for A. The optimal regularizer is constructed using the results of the paper MR 40#5130.
0
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.