A fast and adaptive algorithm for the inverse medium problem with multiple frequencies and multiple sources for the time-harmonic wave equation

被引:0
|
作者
Chaillat, S. [1 ]
Biros, G. [2 ]
机构
[1] Lab POems, F-75739 Paris 15, France
[2] Georgia Tech, Coll Comp, Atlanta, GA 30332 USA
关键词
Inverse scattering; Born approximation; Lippmann-Schwinger integral equation; Randomized Singular Value Decomposition; Recursive Singular Value Decomposition; Adaptive Algorithm; ILL-POSED PROBLEMS;
D O I
暂无
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
We consider the inverse medium problem for the time-harmonic wave equation with broadband and multipoint illumination in the low frequency regime. Such a problem finds many applications in geosciences (e.g. ground penetrating radar), non-destructive evaluation (acoustics), and medicine (optical tomography). We use an integralequation (Lippmann-Schwinger) formulation, which we discretize using a quadrature method. We consider only small perturbations of the background medium (Born approximation). To solve this inverse problem, we use a least squares formulation that is regularized with the truncated Singular Value Decomposition (SVD). If N-omega is the number of excitation frequencies, N-s the number of incoming waves, N-d the number of detectors, and N the parameterization for the scatterer, a dense singular value decomposition for the overall input-output map will have [min(NsN omega N-d, N)](2) xmax(NsN omega Nd, N) cost. We have developed a fast SVD approach that brings the cost down to O(NN omega Nd + NN omega Ns) thus, providing orders of magnitude improvements over a black-box dense SVD. In the second part of this contribution, we propose an adaptive algorithm in space to optimize the ratio between the number of points and the accuracy. The method uses an octree to drive the computation. The refinement criterion is derived from the method used for the detection of edges in piecewise smooth functions, from their spectral data.
引用
收藏
页码:2535 / 2542
页数:8
相关论文
共 33 条