Requirements scaling properties in large scale computing

Authors :: Weng Cho Chew
Jiming Song
Source :: IEEE Antennas and Propagation Society International Symposium. 1998 Digest. Antennas: Gateways to the Global Network. Held in conjunction with: USNC/URSI National Radio Science Meeting (Cat. No.98CH36194).
Publication Year :: 2002
Publisher :: IEEE, 2002.
Abstract: The Fast Illinois Solver Code (FISC) is a code to tackle large scale computing and scattering problems using multi-level fast multipole algorithms. FISC requirements for memory and CPU time are discussed. Some empirically derived formulas and charts are given. The examples used to get these conclusions are also plotted. FISC is designed to compute the RCS of a target described by a triangular facet file. Both complexities for the CPU time per iteration and memory requirements are of O(NlogN), where N is the number of unknowns.

Subjects :: Theoretical computer science
Computational complexity theory
Scale (ratio)
Computer science
Iterative method
Computational electromagnetics
CPU time
Central processing unit
Solver
Computational science
Sparse matrix

Database :: OpenAIRE
Journal :: IEEE Antennas and Propagation Society International Symposium. 1998 Digest. Antennas: Gateways to the Global Network. Held in conjunction with: USNC/URSI National Radio Science Meeting (Cat. No.98CH36194)
Accession number :: edsair.doi...........2edefad73a16f96131c64ed0ab35f391
Full Text :: https://doi.org/10.1109/aps.1998.690834