Fast Algorithm for Scattering from Planar Arrays of Conducting Patches

Levent Gürel, Weng Cho Chew

Research output: Contribution to journalArticlepeer-review

Abstract

A direct (noniterative) algorithm for the solution of the electromagnetic scattering from three-dimensional planar arrays of conducting patches is developed. For an N-unknown problem, the computational complexity of this new solution technique is shown to be O(N2 log2N), which is considerably lower than the O(N3) computational complexity of the conventional direct solution techniques. The advantages of the reduction in the computational complexity is pronounced in the solution of large electromagnetics problems, such as scattering from large and finite arrays of patches, synthesis and analysis of finite-sized frequency selective surfaces (FSS's), and radiation and scattering from large phased-array antennas, to name a few.

Original languageEnglish (US)
Pages (from-to)155-157
Number of pages3
JournalIEEE Microwave and Guided Wave Letters
Volume8
Issue number4
DOIs
StatePublished - Apr 1998

Keywords

  • Algorithms
  • Antenna arrays
  • Frequency selective surface
  • Scattering

ASJC Scopus subject areas

  • Engineering(all)
  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'Fast Algorithm for Scattering from Planar Arrays of Conducting Patches'. Together they form a unique fingerprint.

Cite this