Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries
Chew, W. C.
IEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
IEEE, Piscataway, NJ, United States
1842 - 1845
Item Usage Stats
MetadataShow full item record
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.
Electromagnetic wave scattering
Method of moments
Fast direct algorithm (FDA)
Recursive aggregate-T-matrix algorithm (RATMA)
Steepest descent path (SDP)