An approximation theorem in inverse electromagnetic scattering
✍ Scribed by Peter Hähner
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 431 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0170-4214
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
In the inverse electromagnetic scattering problem for an inhomogeneity of compact support with constant permittivity Colton and Päivärinta suggested an optimization scheme which yields a numerical method for determining the refractive index if the far‐field data of the scattering problem is known [1]. We prove the denseness of the Cauchy data to certain interior transmission problems and conclude that the infimum of the optimization scheme is zero even if the permittivity varies. Before proving the denseness result, we investigate a boundary value problem which is needed to prove the denseness result.
📜 SIMILAR VOLUMES
## Abstract We consider the inverse scattering problem of determining the shape of a perfect conductor __D__ from a knowledge of the scattered electromagnetic wave generated by a time‐harmonic plane wave incident upon __D__. By using polarization effects we establish the validity of the linear samp
## Abstract The problem of determining the shape of perfectly conducting cylindrical structures with arbitrary cross sections from electromagnetic scattering data is considered. Applying the method of lines, an efficient procedure is found for determining the shape of a cylinder from its electromag
A new method, based on an iterative procedure, for solving the two-dimensional inverse scattering problem is presented. This method employs an equivalent Neumann series solution in each iteration step. The purpose of the algorithm is to provide a general method to solve the two-dimensional imaging p
## Abstract To efficiently solve large, dense, and complex linear systems arising from electric field integral equations formulation of electromagnetic scattering problems, the multilevel fast multipole algorithm is used to accelerate the matrix–vector product operations. This article presents a mo