Abstract
The problem of localizing the singularities (breakpoints) of functions that are noisy in the spaces Lp, 1 < p < ∞, or C is considered. A wide class of smoothing algorithms that determine the number and location of breakpoints is constructed. In addition, for the case when a function is noisy in C, a finite-difference 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Steklov Institute of Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
