Sibirskii Zhurnal Vychislitel'noi Matematiki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. Zh. Vychisl. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Sibirskii Zhurnal Vychislitel'noi Matematiki, 2020, Volume 23, Number 4, Pages 351–364
DOI: https://doi.org/10.15372/SJNM20200401
(Mi sjvm753)
 

This article is cited in 3 scientific papers (total in 3 papers)

New accuracy estimates for methods for localizing discontinuity lines of a noisy function

A. L. Ageev, T. V. Antonova

Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, 620990 Russia
Full-text PDF (543 kB) Citations (3)
References:
Abstract: We consider the ill-posed problem of localizing (finding the position) the discontinuity lines of a function of two variables, provided that the function of two variables is smooth outside of the discontinuity lines, and at each point on the line has a discontinuity of the first kind. There is a uniform grid with the step $\tau$. It is assumed that we know the averages on the square $\tau\times\tau$ of the perturbed function at each node of the grid. The perturbed function approximates the exact one in space $L_2(\mathbb{R}^2)$. The perturbation level $\delta$ is known. Earlier, the authors investigated (obtained accuracy estimates) the global discrete regularizing algorithms for approximating a set of discontinuity lines of a noisy function. However, stringent smoothness conditions were superimposed on the discontinuity line. The main result of this paper is the improvement of localizing the accuracy estimation methods, which allows replacing the smoothness requirement with a weaker Lipschitz condition. Also, the conditions of separability are formulated in a more general form, as compared to previous studies. In particular, it is established that the proposed algorithm make it possible to obtain the localization accuracy of the order $O(\delta)$. Also, estimates of other important parameters characterizing the localization algorithm are given.
Key words: ill-posed problems, regularization method, discontinuity lines, global localization, discretization, separability threshold.
Received: 01.07.2019
Revised: 30.12.2019
Accepted: 16.07.2020
English version:
Numerical Analysis and Applications, 2020, Volume 13, Issue 4, Pages 293–305
DOI: https://doi.org/10.1134/S1995423920040011
Bibliographic databases:
Document Type: Article
UDC: 517.988.68
Language: Russian
Citation: A. L. Ageev, T. V. Antonova, “New accuracy estimates for methods for localizing discontinuity lines of a noisy function”, Sib. Zh. Vychisl. Mat., 23:4 (2020), 351–364; Num. Anal. Appl., 13:4 (2020), 293–305
Citation in format AMSBIB
\Bibitem{AgeAnt20}
\by A.~L.~Ageev, T.~V.~Antonova
\paper New accuracy estimates for methods for localizing
discontinuity lines of a noisy function
\jour Sib. Zh. Vychisl. Mat.
\yr 2020
\vol 23
\issue 4
\pages 351--364
\mathnet{http://mi.mathnet.ru/sjvm753}
\crossref{https://doi.org/10.15372/SJNM20200401}
\transl
\jour Num. Anal. Appl.
\yr 2020
\vol 13
\issue 4
\pages 293--305
\crossref{https://doi.org/10.1134/S1995423920040011}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000600885900001}
Linking options:
  • https://www.mathnet.ru/eng/sjvm753
  • https://www.mathnet.ru/eng/sjvm/v23/i4/p351
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Sibirskii Zhurnal Vychislitel'noi Matematiki
    Statistics & downloads:
    Abstract page:186
    Full-text PDF :27
    References:30
    First page:10
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024