Uniqueness and numerical methods in inverse obstacle scattering
Uniqueness and numerical methods in inverse obstacle scattering
复制标题
DOI:
10.1088/1742-6596/73/1/012003
复制
发表时间:
2007-06
期刊:
影响因子:
--
通讯作者:
R. Kress
中科院分区:
文献类型:
--
作者:
R. Kress
The inverse problem we consider in this tutorial is to determine the shape of an obstacle from the knowledge of the far field pattern for scattering of time-harmonic plane waves. In the first part we will concentrate on the issue of uniqueness, i.e., we will investigate under what conditions an obstacle and its boundary condition can be identified from a knowledge of its far field pattern for incident plane waves. We will review some classical and some recent results and draw attention to open problems. In the second part we will survey on numerical methods for solving inverse obstacle scattering problems. Roughly speaking, these methods can be classified into three groups. Iterative methods interpret the inverse obstacle scattering problem as a nonlinear ill-posed operator equation and apply iterative schemes such as regularized Newton methods, Landweber iterations or conjugate gradient methods for its solution. Decomposition methods, in principle, separate the inverse scattering problem into an ill-posed linear problem to reconstruct the scattered wave from its far field and the subsequent determination of the boundary of the scatterer from the boundary condition. Finally, the third group consists of the more recently developed sampling methods. These are based on the numerical evaluation of criteria in terms of indicator functions that decide whether a point lies inside or outside the scatterer. The tutorial will give a survey by describing one or two representatives of each group including a discussion on the various advantages and disadvantages.