Scattering from elongated objects: Direct solution in O(N log2 N) operations

E. Michielssen, A. Boag, W. C. Chew

Research output: Contribution to journalArticle


A recursive algorithm is presented for analysing TM and TE plane-wave scattering from two-dimensional elongated objects. The computational complexity and the memory requirements of the algorithm are O(N log2 N) and O(N log N), respectively. The algorithm is based on the concept of a reduced representation and fast computation of fields that are radiated by quasialigned sources. While many existing fast algorithms for analysing electromagnetic scattering problems rely on iterative strategies, the proposed algorithm provides a direct solution to the scattering problem. The algorithm has a variety of potential applications, including the analysis of scattering from truncated and quasiperiodic structures, winglike structures, phased-array antennas and rough surfaces.

Original languageEnglish (US)
Pages (from-to)277-283
Number of pages7
JournalIEE Proceedings: Microwaves, Antennas and Propagation
Issue number4
StatePublished - Jan 1 1996


  • Algorithms
  • Electromagnetic wave scattering
  • Numerical analysis
  • Planewave scattering

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Scattering from elongated objects: Direct solution in O(N log<sup>2</sup> N) operations'. Together they form a unique fingerprint.

  • Cite this