Publication | Closed Access
Fast Illinois solver code (FISC)
187
Citations
20
References
1998
Year
Numerical AnalysisEngineeringBasis FunctionsElectromagnetic CompatibilityNumerical ComputationArray ComputingFast IllinoisValidated NumericsMatrix MethodComputational ElectromagneticsParallel ComputingConjugate GradientComputer EngineeringComputer ScienceAlgorithmic DevelopmentComputational ScienceComputer AlgebraHigh-frequency ApproximationParallel Programming
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1