Fast Illinois solver code: Requirements and scaling properties

Jiming Song, Weng Cho Chew

Research output: Contribution to journalArticlepeer-review


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 languageEnglish (US)
Pages (from-to)19-23
Number of pages5
JournalIEEE computational science & engineering
Issue number3
StatePublished - 1998

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'Fast Illinois solver code: Requirements and scaling properties'. Together they form a unique fingerprint.

Cite this