Browsing by Subject "Steepest descent path (SDP)"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Fast direct solution algorithm for electromagnetic scattering from 3D planar and quasi-planar geometries
    (IEEE, 1997) Gürel, Levent; Chew, W. C.
    A non-iterative method and its application to planar geometries in homogeneous media is presented. The method is extendable to the cases of quasi-planar structures and/or layered-media problems. The fast direct algorithm (FDA)/steepest descent path (SDP) takes advantage of the fact that the induced currents on planar and quasi-planar geometries interact with each other within a very limited solid angle. Thus, all the degrees of freedom required to solve a `truly 3D' geometry are not required for a planar or quasi-planar geometry, and this situation can be exploited to develop efficient solution algorithms.
  • Thumbnail Image
    ItemOpen Access
    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.