Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries
IEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
IEEE, Piscataway, NJ, United States
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27672
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.
- Conference Paper 2294