Solving the Inverse Generalized Problem of Vertical Seismic Profiling

The dynamic inverse seismics problem is considered in a generalized setting. We investigate whether the wave propagation problem in a vertically nonhomogeneous medium is well-posed. We show that the regular part of the solution is an L ₂ function and the inverse problem, i.e., the determination of the reflection coefficient, is thus reducible to minimizing the error functional. The gradient of the functional is obtained in explicit form from the conjugate problem, and approximate formulas for its evaluation are derived. A regularization algorithm for the solution of the inverse problem is considered; simulation results using various excitation sources are reported.     

A numerical method for solving an inverse thermoacoustic problem

In this paper, we consider an inverse problem of determining the initial condition of an initial boundary value problem for the wave equation with some additional information about solving a direct initial boundary value problem. The information is obtained from measurements at the boundary of the solution domain. The purpose of our paper is to construct a numerical algorithm for solving the inverse problem by an iterative method called a method of simple iteration (MSI) and to study the resolution quality of the inverse problem as a function of the number and location of measurement points. Three two-dimensional inverse problem formulations are considered. The results of our numerical calculations are presented. It is shown that the MSI decreases the objective functional at each iteration step. However, due to the ill-posedness of the inverse problem the difference between the exact and approximate solutions decreases up to some fixed number k _min, and then monotonically increases. This shows the regularizing properties of the MSI, and the iteration number can be considered a regularization parameter.     

An inverse eigenvalue problem and an associated approximation problem for generalized K-centrohermitian matrices

A partially described inverse eigenvalue problem and an associated optimal approximation problem for generalized K-centrohermitian matrices are considered. It is shown under which conditions the inverse eigenproblem has a solution. An expression of its general solution is given. In case a solution of the inverse eigenproblem exists, the optimal approximation problem can be solved. The formula of its unique solution is given.     

Numerical solution of the inverse electrocardiography problem with the use of the Tikhonov regularization method

The inverse electrocardiography problem related to medical diagnostics is considered in terms of potentials. Within the framework of the quasi-stationary model of the electric field of the heart, the solution of the problem is reduced to the solution of the Cauchy problem for the Laplace equation in R ³. A numerical algorithm based on the Tikhonov regularization method is proposed for the solution of this problem. The Cauchy problem for the Laplace equation is reduced to an operator equation of the first kind, which is solved via minimization of the Tikhonov functional with the regularization parameter chosen according to the discrepancy principle. In addition, an algorithm based on numerical solution of the corresponding Euler equation is proposed for minimization of the Tikhonov functional. The Euler equation is solved using an iteration method that involves solution of mixed boundary value problems for the Laplace equation. An individual mixed problem is solved by means of the method of boundary integral equations of the potential theory. In the study, the inverse electrocardiography problem is solved in region Ω close to the real geometry of the torso and heart.     

Numerical inversions for a nonlinear source term in the heat equation by optimal perturbation algorithm

This paper deals with an inverse problem of identifying a nonlinear source term g=g(u) in the heat equation u_t-u_xx=a(x)g(u). By data compatibility analysis, the forward problem is proved to have a unique positive solution with a maximum of M>0, with which an optimal perturbation algorithm is applied to determine the source function g(u) on u∈[0,M]. Numerical inversions are carried out for g(u) with functional forms of polynomial, trigonometric and index functions. The inversion reconstruction sources basically coincide with the true source solution showing that the optimal perturbation algorithm is efficient to the inverse source problem here. By the computations we find that the inversion results are better for polynomial sources than those of trigonometric and index sources. The inversion algorithm seems to be very sharp if the solution’s maximum M of the forward problem is relatively small; otherwise, the deviations in the source solutions become large especially near the endpoint of u=M.     

Existence and uniqueness for a nonlinear inverse reaction‐diffusion problem with a nonlinear source in higher dimensions

This paper analyzes the existence and the uniqueness problem for an n‐dimensional nonlinear inverse reaction‐diffusion problem with a nonlinear source. A transformation is used to obtain a new inverse coefficient problem. Then, a parabolic differential operator L_λ is defined to establish the relation between the solution of L_λ = 0 and the new inverse problem. Following this, it is shown that the inverse problem has at least one solution in the class of admissible coefficients. Furthermore, it is proved that this solution is the unique solution of the undertaken inverse problem. A numerical example is given to illustrate ill‐posedness of the inverse problem. Copyright © 2013 John Wiley & Sons, Ltd.     

Determination of the unknown source term in a linear parabolic problem from the measured data at the final time

The problem of determining the source term F(x, t) in the linear parabolic equation u _t = (k(x)u _x (x, t)) _x + F(x, t) from the measured data at the final time u(x, T) = µ(x) is formulated. It is proved that the Fréchet derivative of the cost functional J(F) = ‖µ _T (x) ? u(x, T)‖ ₀ ² can be formulated via the solution of the adjoint parabolic problem. Lipschitz continuity of the gradient is proved. An existence result for a quasi solution of the considered inverse problem is proved. A monotone iteration scheme is obtained based on the gradient method. Convergence rate is proved.     

Approximation of the Bitsadze-Samarskii inverse problem for an elliptic equation with the dirichlet conditions

An inverse problem for an elliptic equation in a Banach space with the Bitsadze-Samarskii conditions is considered. The suggested approach uses the notion of a general approximation scheme, the theory of C ₀-semigroups of operators, and methods of functional analysis.     

Estimate of solution stability in a two-dimensional inverse problem for elasticity equations

The problem of determining the density of the medium and one of its elasticity moduli is considered. Properties of the elastic medium and external forces are assumed to be independent of the coordinate x ₃. In this case, the third component of the displacement vector satisfies a scalar equation of the second order, which contains the density ρ of the medium and elasticity modulus μ as coefficients. The parameters ρ and μ are known to be positive and constant everywhere outside some compact domain D ? ?², but they are unknown inside D. The problem of determining these coefficients in D via information, given on the boundary of the domain D for some finite time interval, about a solution of two direct problems is considered. An estimate of the conditional stability of a solution of the inverse problem under consideration is established.     

Determination of the Unknown Cauchy Data in a Linear Parabolic Problem from the Measured Data at the Final Time

The problem of determining the initial value u(x, 0) = μ ₀(x) in the parabolic equation u _t = (k(x)u _x (x, t)) _x + F(x, t) from the final overdetermination μ _T (x) = u(x, T) is formulated. It is proved that the Fréchet derivative of the cost functional ${{J(\mu_0) = \|\mu_T(x) - u(x, T)\|_0^2}}$ can be formulated via the solution of the adjoint parabolic problem. Lipschitz continuity of the gradient is proved. The existence of a quasisolution of the considered inverse problem is proved. A monotone iteration scheme is obtained based on the gradient method.     

Isospectral flow method for nonnegative inverse eigenvalue problem with prescribed structure

The nonnegative inverse eigenvalue problem is that given a family of complex numbers λ={λ₁,…,λ_n}, find a nonnegative matrix of order n with spectrum λ. This problem is difficult and remains unsolved partially. In this paper, we focus on its generalization that the reconstructed nonnegative matrices should have some prescribed entries. It is easy to see that this new problem will come back to the common nonnegative inverse eigenvalue problem if there is no constraint of the locations of entries. A numerical isospectral flow method which is developed by hybridizing the optimization theory and steepest descent method is used to study the reconstruction. Moreover, an error estimate of the numerical iteration for ordinary differential equations on the matrix manifold is presented. After that, a numerical method for the nonnegative symmetric inverse eigenvalue problem with prescribed entries and its error estimate are considered. Finally, the approaches are verified by the numerical test results.     

A method for finding coefficients of a quasilinear hyperbolic equation

The inverse problem of finding the coefficients q(s) and p(s) in the equation u _tt = a ² u _xx + q(u)u _t ? p(u)u _x is investigated. As overdetermination required in the inverse setting, two additional conditions are set: a boundary condition and a condition with a fixed value of the timelike variable. An iteration method for solving the inverse problem is proposed based on an equivalent system of integral equations of the second kind. A uniqueness theorem and an existence theorem in a small domain are proved for the inverse problem to substantiate the convergence of the algorithm.     

On an Inverse Problem for a Parabolic Equation

In this paper, we study the inverse problem of the reconstruction of the right-hand side of special form for a parabolic equation in u in which the coefficients of u _t and u depend on u _(x,t) , with overdetermination given by the integral of the solution over time. The Fredholm property for this problem and the existence and uniqueness theorems in Sobolev spaces are established.     

Towards an inverse scattering theory for two-dimensional nondecaying potentials

The inverse scattering method is considered for the nonstationary Schrödinger equation with the potentialu (x ₁,x ₂) nondecaying in a finite number of directions in thex plane. The general resolvent approach, which is particularly convenient for this problem, is tested using a potential that is the Bäcklund transformation of an arbitrary decaying potential and that describes a soliton superimposed on an arbitrary background. In this example, the resolvent, Jost solutions, and spectral data are explicitly constructed, and their properties are analyzed. The characterization equations satisfied by the spectral data are derived, and the unique solution of the inverse problem is obtained. The asymptotic potential behavior at large distances is also studied in detail. The obtained resolvent is used in a dressing procedure to show that with more general nondecaying potentials, the Jost solutions may have an additional cut in the spectral-parameter complex domain. The necessary and sufficient condition for the absence of this additional cut is formulated.     

Existence and uniqueness of a solution for a two dimensional nonlinear inverse diffusion problem

The problem of identifying the coefficient in a square porous medium is considered. It is shown that under certain conditions of data f,g, and for a properly specified class A of admissible coefficients, there exists at least one a∈A such that (a,u) is a solution of the corresponding inverse problem.     

Characterization of the inverse of a particular circulant matrix by means of a continued fraction

The matrix A of the constraining system of a particular discrete optimization problem, which has been posed in [3] for modeling a particular scheduling program and for which an optimal solution has been found in [1], is considered and an explicit form of its inverse is given by means of a continued fraction. The knowledge of the inverse enables one to obtain an explicit form of the set of optimal solutions of the problem.Lastly, the connection between A^-1 and the definition of equi-assignment of binary vectors [5] is analysed.     

On the determination of the coefficients in the viscoelasticity equations

For the integrodifferential viscoelasticity equations, we study the problem of determining the coefficients of the equations and the kernels occurring in the integral terms of the system of equations. The density of the medium is assumed to be given. We suppose that the inhomogeneity support of the sought functions is included in some compact domain B ₀. We consider a series of inverse problems in which an impulse source is concentrated at the points y of the boundary of B ₀. The point y is the parameter of the problem. The given information about the solution is the trace of the solution to the Cauchy problem with zero initial data. This trace is given on the boundary of B ₀ for all y ∈ ?B ₀ and for a finite time interval. The main result of the article consists in obtaining uniqueness theorems for a solution to the initial inverse problem.     

The forced convection flow of a uniform stream over a flat surface with a convective surface boundary condition

The forced convection heat transfer resulting from the flow of a uniform stream over a flat surface on which there is a convective boundary condition is considered. In previous papers [5], [6], [7], [8] it was assumed that the convective heat transfer parameter h_f associated with the hot surface depended on x, where x measures distance along the surface, so that problem could be reduced to similarity form. Here it is assumed that this heat transfer parameter h_f is a constant, with the result that the temperature profiles and overall heat transfer characteristics evolve as the solution develops from the leading edge. The heat transfer near the leading edge (small x), which we find to be dominated by the surface heat flux, the solution at large distances along the surface (large x), which dominated by the surface temperature, are discussed. A numerical solution to the full problem is then obtained for a range of values of the Prandtl number to join these two solution regimes.     

On a Kipriyanov problem for a singular ultrahyperbolic equation

We obtain a differential equation for the spherical means generated by a multidimensional generalized shift of an arbitrary smooth “even” function. We study the Asgeirsson property of solutions of a singular ultrahyperbolic equation that includes singular differential operators Δ _B acting in Euclidean spaces, in general, of distinct dimensions. We represent the structure of a “radial” solution of the considered equation. A theorem similar to the Asgeirsson inverse theorem is proved.     

On inverse traveling salesman problems

The inverse traveling salesman problem belongs to the class of ??inverse combinatorial optimization?? problems. In an inverse combinatorial optimization problem, we are given a feasible solution for an instance of a particular combinatorial optimization problem, and the task is to adjust the instance parameters as little as possible so that the given solution becomes optimal in the new instance. In this paper, we consider a variant of the inverse traveling salesman problem, denoted by ITSP _W,A , by taking into account a set W of admissible weight systems and a specific algorithm. We are given an edge-weighted complete graph (an instance of TSP), a Hamiltonian tour (a feasible solution of TSP) and a specific algorithm solving TSP. Then, ITSP _W,A , is the problem to find a new weight system in W which minimizes the difference from the original weight system so that the given tour can be selected by the algorithm as a solution. We consider the cases ${W \in \{\mathbb{R}^{+m}, \{1, 2\}^m , \Delta\}}$ where ?? denotes the set of edge weight systems satisfying the triangular inequality and m is the number of edges. As for algorithms, we consider a local search algorithm 2-opt, a greedy algorithm closest neighbor and any optimal algorithm. We devise both complexity and approximation results. We also deal with the inverse traveling salesman problem on a line for which we modify the positions of vertices instead of edge weights. We handle the cases ${W \in \{\mathbb{R}^{+n}, \mathbb{N}^n\}}$ where n is the number of vertices.