A fast algorithm for the analysis of scattering by elongated cavities

Moti Zelig*, Ehud Heyman, Amir Boag

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


Electromagnetic scattering from elongated, arbitrarily shaped, open-ended cavities (OEC) has been studied extensively over the years. In this paper, we introduce the fast encapsulating domain decomposition (EDD) scheme for the analysis of radar cross section (RCS) of such OEC. The EDD advantages stem from a domain decomposition along the elongated dimension, followed by a spectral representation of the fields in each segment, whereby the field is naturally separated into in- and out-going waves. This diagonalizes the translation between the cross sections, thus reducing the per segment computational complexity from O((NA)3) to O(NW(NA)2), where NA and NW are the number of aperture and wall unknowns per segment, satisfying NW << NA as the segmentation is constructed to be smaller than the cross section. The results of the EDD are demonstrated on an S-shaped elongated open-ended cavity.

Original languageEnglish
Pages (from-to)1675-1696
Number of pages22
JournalJournal of Electromagnetic Waves and Applications
Issue number13
StatePublished - 2 Sep 2018


  • CC–computational complexity
  • CIO–cavity IO
  • DD–domain decomposition
  • EDD–encapsulating DD
  • Electromagnetic scattering
  • IE–integral equation
  • IO–input operator
  • LCN
  • LCN–locally corrected Nyström
  • NG–non-uniform grid
  • OEC–open-ended cavity
  • RADAR cross section
  • RCS
  • SDD–segmented DD
  • higher order
  • inlets
  • integral equations
  • numerical methods
  • open-ended cavity
  • spectral methods


Dive into the research topics of 'A fast algorithm for the analysis of scattering by elongated cavities'. Together they form a unique fingerprint.

Cite this