Regularizing algorithms for localizing the breakpoints of a~noisy function
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 15 (2009) no. 1, pp. 44-58
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider the problem of localizing the singularities (breakpoints) of functions that are noisy in the spaces $L_p$, $1$, or $C$. We construct a wide class of smoothing algorithms that determine the number and location of breakpoints. In addition, for the case when a function is noisy in $C$, a finitedifference method is constructed. For the proposed methods, convergence theorems are proved and approximation accuracy estimates for the location of breakpoints are obtained. The lower estimates obtained in this paper show the order-optimality of the methods. For all the methods constructed, their capacity of separating close breakpoints is investigated.
Keywords:
ill-posed problems, localization of breakpoints, regularizing algorithms, separability threshold.
@article{TIMM_2009_15_1_a3,
author = {T. V. Antonova},
title = {Regularizing algorithms for localizing the breakpoints of a~noisy function},
journal = {Trudy Instituta matematiki i mehaniki},
pages = {44--58},
publisher = {mathdoc},
volume = {15},
number = {1},
year = {2009},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TIMM_2009_15_1_a3/}
}
T. V. Antonova. Regularizing algorithms for localizing the breakpoints of a~noisy function. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 15 (2009) no. 1, pp. 44-58. http://geodesic.mathdoc.fr/item/TIMM_2009_15_1_a3/