Javascript must be enabled to continue!
Discretization of equations Gelfand-Levitan-Krein and regularization algorithms
View through CrossRef
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.
Title: Discretization of equations Gelfand-Levitan-Krein and regularization algorithms
Description:
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.
Related Results
A Mixed Regularization Method for Ill-Posed Problems
A Mixed Regularization Method for Ill-Posed Problems
In this paper we propose a mixed regularization method for ill-posed problems. This method combines iterative regularization methods and continuous regularization methods effective...
Application of the Gelfand–Levitan method to geoacoustic inversion in shallow water
Application of the Gelfand–Levitan method to geoacoustic inversion in shallow water
The Gelfand–Levitan inverse technique is an exact inversion method originating in quantum scattering theory [I. M. Gelfand and B. M. Levitan, Am. Math. Soc. Transl. 1, 253–304 (195...
Canonical Gelfand–Zeitlin Modules over Orthogonal Gelfand–Zeitlin Algebras
Canonical Gelfand–Zeitlin Modules over Orthogonal Gelfand–Zeitlin Algebras
Abstract
We prove that every orthogonal Gelfand–Zeitlin algebra $U$ acts (faithfully) on its Gelfand–Zeitlin subalgebra $\Gamma $. Considering the dual module, we sh...
On Inner Characterizations of Pseudo-Krein and Pre-Krein Spaces
On Inner Characterizations of Pseudo-Krein and Pre-Krein Spaces
For developing a theory of
^*
-representations of
^*
...
Krein–Sobolev Orthogonal Polynomials II
Krein–Sobolev Orthogonal Polynomials II
In a recent paper, Littlejohn and Quintero studied the orthogonal polynomials {Kn}n=0∞—which they named Krein–Sobolev polynomials—that are orthogonal in the classical Sobolev space...
SBDM v1.0: A scaling-based discretization method for the Geographical Detector Model
SBDM v1.0: A scaling-based discretization method for the Geographical Detector Model
Abstract. Geographical Detector Model (GDM) can be used to assess the affinity between potential environmental factors and the response variables. If environmental factors entered ...
Quaternion Regularization of Singularities of Astrodynamic Models Generated by Gravitational Forces (Review)
Quaternion Regularization of Singularities of Astrodynamic Models Generated by Gravitational Forces (Review)
The article presents an analytical review of works devoted to the quaternion regularization of the singularities of differential equations of the perturbed three-body problem gener...
Analytical Solutions to Minimum-Norm Problems
Analytical Solutions to Minimum-Norm Problems
For G∈Rm×n and g∈Rm, the minimization min∥Gψ−g∥2, with ψ∈Rn, is known as the Tykhonov regularization. We transport the Tykhonov regularization to an infinite-dimensional setting, t...

