Convexification Numerical Method for Imaging of Moving Targets
Preprint
Abstract
The problem of imaging of a moving target is formulated as a Coefficient Inverse Problem for a hyperbolic equation with its coefficient depending on all three spatial variables and time. As the initial condition, the point source running along a straight line is used. Lateral Cauchy data are known for each position of the point source. A truncated Fourier series with respect to a special orthonormal basis is used. First, Lipschitz stability estimate is obtained. Next, a globally convergent numerical method, the so-called convexification method, is developed and its convergence analysis is carried out. The convexification method is based on a Carleman estimate. Results of numerical experiments are presented.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- An Inverse Problem for the Semilinear Wave Equation with a Nonlinear Integral OperatorSiberian Mathematical Journal, 2025
- An inverse boundary value problem for isotropic nonautonomous heat flowsMathematische Annalen, 2023
- Ray Statement of the Acoustic Tomography ProblemDoklady Mathematics, 2022
- Convexification numerical algorithm for a 2D inverse scattering problem with backscatter dataInverse Problems in Science and Engineering, 2021
- Wave Propagation and Imaging in Moving Random MediaMultiscale Modeling & Simulation, 2019
- Carleman weight functions for a globally convergent numerical method for ill-posed Cauchy problems for some quasilinear PDEsNonlinear Analysis: Real World Applications, 2017
- Motion estimation and imaging of complex scenes with synthetic aperture radarInverse Problems, 2013
- Numerical Methods for the Solution of Ill-Posed Problems1995
- Inverse problems and Carleman estimatesInverse Problems, 1992
- Newton-Kantorovich method for three-dimensional potential inverse scattering problem and stability of the hyperbolic Cauchy problem with time-dependent dataInverse Problems, 1991