Browsing by Subject "Recursive aggregate-T-matrix algorithm (RATMA)"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Thumbnail Image
    ItemUnknown
    Fast noniterative steepest descent path algorithm for planar and quasi-planar patch geometries
    (IEEE, 1998) Gürel, Levent; Chew, W. C.
    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.