A fast algorithm for the electromagnetic scattering from a large cavity

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

116 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)553-574
Journal / PublicationSIAM Journal on Scientific Computing
Volume27
Issue number2
Publication statusPublished - 2006

Abstract

A fast algorithm is presented for solving electromagnetic scattering from a rectangular open cavity embedded in an infinite ground plane. The medium inside the cavity is assumed to be (vertically) layered. By introducing a transparent (artificial) boundary condition, the problem in the open cavity is reduced to a bounded domain problem. A simple finite difference method is then applied to solve the model Helmholtz equation. The fast algorithm is designed for solving the resulting discrete system in terms of the discrete Fourier transform in the horizontal direction, a Gaussian elimination in the vertical direction, and a preconditioning conjugate gradient method with a complex diagonal preconditioner for the indefinite interface system. The existence and uniqueness of the finite difference solution are established for arbitrary wave numbers. Our numerical experiments for large numbers of mesh points, up to 16 million unknowns, and for large wave numbers, e.g., between 100 and 200 wavelengths, show that the algorithm is extremely efficient. The cost for calculating the radar cross section, which is of significant interest in practice, is O(M 2) for an M × M mesh. The proposed algorithm may be extended easily to solve discrete systems from other discretization methods of the model problem. © 2005 Society for Industrial and Applied Mathematics.

Research Area(s)

  • Electromagnetic scattering, FFT, Indefinite systems, Preconditioning