A new version of the convexification method for a 1D coefficient inverse problem with experimental data

A new version of the convexification method is developed analytically and tested numerically for a 1D coefficient inverse problem in the frequency domain. Unlike the previous version, this one does not use the so-called 'tail function', which is a complement of a certain truncated integral...

Full description

Saved in:
Bibliographic Details
Published in:Inverse problems 2018-11, Vol.34 (11), p.115014
Main Authors: Klibanov, Michael V, Kolesov, Aleksandr E, Sullivan, Anders, Nguyen, Lam
Format: Article
Language:English
Subjects:
Carleman weight function
coefficient inverse problem
convexification
experimental data
global convergence
numerical method
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new version of the convexification method is developed analytically and tested numerically for a 1D coefficient inverse problem in the frequency domain. Unlike the previous version, this one does not use the so-called 'tail function', which is a complement of a certain truncated integral with respect to the wave number. Globally strictly convex cost functional is constructed with the Carleman weight function. Global convergence of the gradient projection method to the correct solution is proved. Numerical tests are conducted for both computationally simulated and experimental data.
ISSN:0266-5611
1361-6420
DOI:10.1088/1361-6420/aadbc6