DocumentCode :
2546414
Title :
Scattering computation using the fast multipole method
Author :
Hamilton, L.R. ; Stalzer, M.A. ; Turley, R.S. ; Visher, J.L. ; Wandzura, S.M.
Author_Institution :
Hughes Res. Lab., Malibu, CA, USA
fYear :
1993
fDate :
June 28 1993-July 2 1993
Firstpage :
852
Abstract :
The fast multipole method (FMM) computes scattering cross sections from large targets with several orders of magnitude reduction in the CPU time and memory storage compared to traditional method of moments (MoM) techniques. The authors compare the memory usage and CPU times for FMM with traditional MoM results using both direct and iterative solvers. It is shown that dramatic reductions in CPU and memory requirements can be realized by using the FMM to compute scattering and radiation from large objects. In the test cases considered, 2D objects with perimeters longer than about 12 wavelengths required less memory than using traditional MoM techniques. Using the FMM to compute scattering from objects with perimeters larger than about 30 wavelengths required less CPU time than using iterative solvers with a dense Z matrix.<>
Keywords :
computational complexity; electromagnetic wave scattering; iterative methods; matrix decomposition; poles and zeros; radar cross-sections; CPU time; fast multipole method; iterative solvers; large targets; memory requirements; method of moments; scattering cross sections; Current density; Integral equations; Iterative methods; Matrix decomposition; Message-oriented middleware; Moment methods; Remuneration; Scattering; Sparse matrices; Strips;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Antennas and Propagation Society International Symposium, 1993. AP-S. Digest
Conference_Location :
Ann Arbor, MI, USA
Print_ISBN :
0-7803-1246-5
Type :
conf
DOI :
10.1109/APS.1993.385215
Filename :
385215
Link To Document :
بازگشت