Fast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries
Date
1997Source Title
Proceedings of the Antennas and Propagation Society International Symposium, IEEE 1997
Print ISSN
0272-4693
Publisher
IEEE
Pages
64 - 67
Language
English
Type
Conference PaperItem Usage Stats
250
views
views
214
downloads
downloads
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.
Keywords
AlgorithmsComputational complexity
Electromagnetic field theory
Green's function
Integration
Problem solving
Vectors
Fast direct algorithms (FDA)
Steepest descent path (SDP)
Electromagnetic wave scattering