Title :
Fast Illinois solver code (FISC)
Author :
Song, J.M. ; Lu, C.C. ; Chew, W.C. ; Lee, S.W.
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
fDate :
6/1/1998 12:00:00 AM
Abstract :
FISC (Fast Illinois solver code), co-developed by the Center for Computational Electromagnetics, University of Illinois, and DEMACO, is designed to compute the RCS of a target described by a triangular-facet file. The problem is formulated using the method of moments (MoM), where the Rao, Wilton, and Glisson (1982) basis functions are used. The resultant matrix equation is solved iteratively by the conjugate gradient (CG) method. The multilevel fast multipole algorithm (MLFMA) is used to speed up the matrix-vector multiplication in the CG method. The complexities for both the CPU time per iteration and the memory requirements are of O(Nlog N), where N is the number of unknowns. A 2.4-million unknown problem is solved in a few hours on the SGI GRAY origin 2000 at NCSA of the University of Illinois at Urbana-Champaign
Keywords :
computational complexity; conjugate gradient methods; electromagnetic wave scattering; iterative methods; matrix multiplication; method of moments; radar cross-sections; FISC; MLFMA; RCS; Rao Wilton Glisson basis functions; complexities; conjugate gradient method; fast Illinois solver code; iterative; matrix equation; matrix-vector multiplication; memory requirements; method of moments; multilevel fast multipole algorithm; triangular-facet file; Acoustic scattering; Character generation; Computational electromagnetics; Electromagnetic scattering; Integral equations; Interpolation; MLFMA; Moment methods; Particle scattering; Radar cross section;
Journal_Title :
Antennas and Propagation Magazine, IEEE
