Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries
Date
1998
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
1
views
views
9
downloads
downloads
Citation Stats
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.
Source Title
Proceedings of the Antennas and Propagation Society International Symposium, IEEE 1998
Publisher
IEEE
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Language
English