Home Localization algorithms for singularities of solutions to convolution equations of the first kind
Article
Licensed
Unlicensed Requires Authentication

Localization algorithms for singularities of solutions to convolution equations of the first kind

  • A. L. Ageev and T. V. Antonova
Published/Copyright: November 21, 2008
Journal of Inverse and Ill-posed Problems
From the journal Volume 16 Issue 7

Abstract

In this paper we construct and investigate localization algorithms for isolated singularities of a function which is a solution to a linear convolution equation of the first kind whose right-hand side is given with an error. We consider two types of singularities: δ-functions and discontinuities of the first kind. A problem for singularities localization is an ill-posed problem having perturbation. We use averaging methods defined by an averaging functional to obtain the singularities. We formulate conditions that the averaging functional must satisfy. For convolution equations, using the Fourier transform, we obtained upper estimates of precision of the singularities localization, separation threshold and other important characteristics of the supposed methods.

Received: 2008-02-02
Published Online: 2008-11-21
Published in Print: 2008-November

© de Gruyter 2008

Downloaded on 8.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/JIIP.2008.039/html?lang=en
Scroll to top button