On discretization of methods for localization of singularities a noisy function
Ill-posed problems of localizing the singularities of a noisy function of one or two variables are studied. For functions of one variable, singularities are discontinuities of the first kind; for a function of two variables, singularities are lines of discontinuity. The discretization of regular localization methods is investigated. Correctness classes are introduced, and error estimates are obtained for the approximation of singularities and separability threshold of the constructed algorithms. It is shown that discrete algorithms for localizing discontinuities of the first kind of a noisy function of one variable are order-optimal.