Abstract
The Fast Illinois Solver Code (FISC) is developed to solve large-scale computing and scattering problems and to expand knowledge about iterative solvers. It uses the multilevel fast multipole algorithms. With FISC a very large problems involving as many as two million unknowns are solved. The FISC's memory requirements and central processing unit (CPU) time are discussed.
Original language | English (US) |
---|---|
Pages (from-to) | 19-23 |
Number of pages | 5 |
Journal | IEEE computational science & engineering |
Volume | 5 |
Issue number | 3 |
DOIs | |
State | Published - Jul 1998 |
Externally published | Yes |
ASJC Scopus subject areas
- Engineering(all)