|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2009, Volume 15, Number 1, Pages 44–58
(Mi timm203)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Regularizing algorithms for localizing the breakpoints of a noisy function
T. V. Antonova Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
Abstract:
We consider the problem of localizing the singularities (breakpoints) of functions that are noisy in the spaces $L_p$, $1<p<\infty$, 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.
Received: 30.12.2008
Citation:
T. V. Antonova, “Regularizing algorithms for localizing the breakpoints of a noisy function”, Trudy Inst. Mat. i Mekh. UrO RAN, 15, no. 1, 2009, 44–58; Proc. Steklov Inst. Math. (Suppl.), 265, suppl. 1 (2009), S24–S39
Linking options:
https://www.mathnet.ru/eng/timm203 https://www.mathnet.ru/eng/timm/v15/i1/p44
|
Statistics & downloads: |
Abstract page: | 465 | Full-text PDF : | 102 | References: | 66 | First page: | 5 |
|