Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries

Date
1998
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Proceedings of the Antennas and Propagation Society International Symposium, IEEE 1998
Print ISSN
0272-4693
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
1842 - 1845
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
Series
Abstract

The fast noniterative steepest descent path (SDP) algorithm for planar and quasi-planar patch geometries are discussed. The comparison of scattered fields as computed by the method of moments (MOM) and fast direct algorithm (FDA)/SDP are described. The solution times of FDA/SDP, MOM, and recursive aggregate-T-matrix algorithm (RATMA) are obtained by solving the scattering problems of increasingly larger planar arrays of patches without taking advantage of the periodicities and the symmetries of these arrays.

Course
Other identifiers
Book Title
Keywords
Algorithms, Electromagnetic wave scattering, Matrix algebra, Method of moments, Problem solving, Fast direct algorithm (FDA), Recursive aggregate-T-matrix algorithm (RATMA), Steepest descent path (SDP), Antenna arrays
Citation
Published Version (Please cite this version)