Abstract
A novel multilevel algorithm is presented for implementing the widely used linear sampling method in inverse obstacle scattering problems. The new method is shown to possess asymptotically optimal computational complexity. For an n × n sampling mesh in ℝ2 or an n × n × n sampling mesh in ℝ3, the proposed algorithm requires one to solve only O(nN-1) far-field equations for a ℝN problem (N=2,3), and this is in sharp contrast to the original version of the method which needs to solve nN. far-field equations. Numerical experiments are presented to illustrate the promising feature of the algorithm in significantly reducing the computational cost of the linear sampling method. © 2008 Society for Industrial and Applied Mathematics.
| Original language | English |
|---|---|
| Pages (from-to) | 1228-1250 |
| Journal | SIAM Journal on Scientific Computing |
| Volume | 30 |
| Issue number | 3 |
| Online published | 21 Mar 2008 |
| DOIs | |
| Publication status | Published - 2008 |
| Externally published | Yes |
Research Keywords
- inverse scattering problems
- multilevel linear sampling method
- optimal computational complexity