Discretization of equations Gelfand-Levitan-Krein and regularization algorithms

2021

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.1088/1742-6596/2092/1/012015
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Abstract The paper considers the initial-boundary-value inverse problem of acoustics for onedimensional and multidimensional cases. The inverse problems are to reconstruct the coefficients using one-dimensional and multidimensional analogues of the Gelfand-Levitan-Krein integral equations. It is known that such equations are linear integral Fredholm equations of the first kind, which are ill-posed. The aim of the work is to find a numerical solution of the Gelfand-Levitan-Krein equation using iterative regularizing algorithms. Using the specifics of these equations (the kernel of the equation depends on the difference of arguments) it is possible to create highly efficient iterative regularizing algorithms. The implemented algorithms can be successfully applied in solving such problems as reconstruction of blurred and defocused images, inverse problem of gravimetric, linear programming problem with inaccurately given matrix of constraints, inverse problem of Geophysics, inverse problems of computed tomography, etc. The main results of the work are the discretization of the one-dimensional and multidimensional Gelfand-Levitan-Krein equation and the construction of iterative regularization algorithms.