High speed imaging of antipersonnel land mines by the convexification algorithm for a simplified mathematical model in two dimensions
From MaRDI portal
Publication:3619680
DOI10.1515/JIIP.2009.016zbMath1157.65474OpenAlexW2071792801MaRDI QIDQ3619680
Michael V. Klibanov, Jianguo Xin
Publication date: 8 April 2009
Published in: Journal of Inverse and Ill-posed Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jiip.2009.016
Numerical smoothing, curve fitting (65D10) Iterative numerical methods for linear systems (65F10) Numerical methods for inverse problems for boundary value problems involving PDEs (65N21)
Cites Work
- Numerical Solution of a Subsurface Imaging Inverse Problem
- Numerical studies on the globally convergent convexification algorithm in 2D
- Layer stripping: a direct numerical method for impedance imaging
- Uniform Strict Convexity of a Cost Functional for Three-Dimensional Inverse Scattering Problem
- A sequential minimization algorithm based on the convexification approach
- A unified framework for constructing globally convergent algorithms for multidimensional coefficient inverse problems
- Inverse problems for a perturbed dissipative half-space
- Inverse electromagnetic scattering in a two-layered medium with an application to mine detection
This page was built for publication: High speed imaging of antipersonnel land mines by the convexification algorithm for a simplified mathematical model in two dimensions