By Topic

The fast steepest descent path algorithm (FASDPA) for analyzing scattering from two-dimensional scatterers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
E. Michielssen ; Center for Comput. Electromagnetics, Illinois Univ., Urbana, IL, USA ; W. C. Chew

The electromagnetics community has shown a renewed interest in iterative solvers as a means for solving very large scattering problems. A number of techniques have been proposed that permit fast matrix-vector multiplications of matrices that arise in the method of moments (MoM). Multilevel versions of the fast multipole method (FMM), the multilevel fast multipole algorithm (MLFMA), and the multilevel matrix decomposition algorithm (MLMDA) have been developed. The cost per iteration of these algorithms scales as O(NlogN) and O(Nlog/sup 2/N), respectively. Although multilevel algorithms asymptotically exhibit the lowest possible computational cost, they are typically outperformed by two-level algorithms for problems involving moderate size scatterers. The computational complexity of the proposed FASDPA is O(N/sup 4/3/) per iteration without proceeding to a multi-level scheme.

Published in:

Antennas and Propagation Society International Symposium, 1996. AP-S. Digest  (Volume:3 )

Date of Conference:

21-26 July 1996