CERFACS CERFACS Scientific Activity Report Jan. 2010 â Dec. 2011
CERFACS CERFACS Scientific Activity Report Jan. 2010 â Dec. 2011
CERFACS CERFACS Scientific Activity Report Jan. 2010 â Dec. 2011
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
INTEGRAL EQUATIONS FOR ELECTROMAGNETISM SCATTERING<br />
[3] A. Bendali, M. Fares, A. Tizaoui, and S. Tordeux, (2012), Matched asymptotic expansions of the eigenvalues of a<br />
3-D boundary-value problem relative to two cavities linked by a hole of small size, ommunications in Computational<br />
Physics, 11 (2), 456–471.<br />
[4] A. Bendali, A. Huard, A. Tizaoui, S. Tordeux, and J. P. Vila, (2009), Asymptotic expansions of the eigenvalues<br />
of a 2-D boundary-value problem relative to two cavities linked by a hole of small size, C. R. Acad. Sci. Paris,<br />
Mathmatiques, 347, 1147–1152.<br />
2.4 Electromagnetic imaging by the Linear Sampling Method<br />
A.-S. Bonnet-Ben Dhia, F. Collino, A. Cossonnière and M. Fares<br />
The theory of inverse scattering for acoustic and electromagnetic waves, is an active area of research<br />
with significant developments in the past few years. Inverse problems consist in getting informations on a<br />
physical object from measurement data. More specifically, the inverse scattering problem is the problem of<br />
finding characteristics of an unknown object referred to as scatterer (location, shape, material properties,...)<br />
from measurement data of acoustic or electromagnetic waves scattered by this object. The question is not<br />
only to detect objects like radar and sonar can do, but also to identify them.<br />
Inverse problems are not easy to solve since they belong to the class of ill-posed problems as defined<br />
by Hadamard. Indeed, a solution may not exist but even if it is the case, the solution does not depend<br />
continuously on the data. Such problems require the use of regularisation schemes to be solved numerically.<br />
The Linear Sampling Method is a technique which aims at reconstructing the shape of a scatterer from<br />
multi-static electromagnetic data at a given frequency : the scatterer, which may be a perfectly conducting<br />
body as well as a penetrable heterogeneity, is illuminated by harmonic plane waves in (almost) all possible<br />
directions and the resulting far-fields are recorded in all directions. These data are used to build the so-called<br />
LSM matrix whose (pseudo) inversion allows to discriminate between sampling points inside or outside the<br />
scatterer.<br />
Our recent contributions on this topic concern on one hand algorithmic aspects : in collaboration with the<br />
ALGO team, a new approach has been developed leading to a significant acceleration of the whole imaging<br />
process. On the other hand, the aim of the thesis of Anne Cossonnière (October 2008 - <strong>Dec</strong>ember <strong>2011</strong>),<br />
under the supervision of Houssem Haddar (INRIA project-team DEFI), is to investigate the potential interest<br />
of the so-called interior transmission frequencies in order to image the interior of a penetrable scatterer and<br />
to answer some open problems on this subject.<br />
2.5 Fast solution algorithm : the SVD-tail<br />
In the classical approach, a system involving the LSM matrix has to be inverted for each sampling point<br />
(and in practice, a large number of sampling points is required to get an accurate image). This system being<br />
ill-posed, a Tikhonov-Morozov regularization technique is used, which is quite costly since a full-SVD of<br />
the matrix is achieved and the Tikhonov regularization parameter has to be determined, using the Morozov<br />
discrepancy principle, for each sampling point.<br />
The new approach that we have developed in collaboration with S. Gratton and P. Toint is both simpler and<br />
faster. The main point is that imaging the scatterer does not require the knowledge of the solution of the<br />
LSM system, but only the knowledge of whether this system has or has not a (pseudo) solution. This can<br />
be achieved by a fully iterative algorithm : a small number of left singular vectors associated to the smallest<br />
singular values are first approximated (by the classical power method) ; then the orthogonality of the RHS<br />
to these vectors is simply tested. Let us emphasize that only few left singular vectors are needed thanks to<br />
the presence of noise in the data and in the discretized operator. In a typical application with 2252 incident<br />
directions and 125000 sampling points, a speed-up factor of 50 is obtained [EMA15].<br />
50 <strong>Jan</strong>. <strong>2010</strong> – <strong>Dec</strong>. <strong>2011</strong>