Fast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries

Levent Gurel, Weng Cho Chew

Research output: Contribution to journalConference articlepeer-review

Abstract

A non-iterative method and its application to planar geometries in homogeneous media is presented. The method is extendable to the cases of quasi-planar structures and/or layered-media problems. The fast direct algorithm (FDA)/steepest descent path (SDP) takes advantage of the fact that the induced currents on planar and quasi-planar geometries interact with each other within a very limited solid angle. Thus, all the degrees of freedom required to solve a `truly 3D' geometry are not required for a planar or quasi-planar geometry, and this situation can be exploited to develop efficient solution algorithms.

Original languageEnglish (US)
Pages (from-to)64-67
Number of pages4
JournalIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
Volume1
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 IEEE Antennas and Propagation Society International Symposium. Part 1 (of 4) - Montreal, Can
Duration: Jul 13 1997Jul 18 1997

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Fast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries'. Together they form a unique fingerprint.

Cite this