Fast Illinois Solver Code (FISC)

J. M. Song; C. C. Lu; W. C. Chew; S. W. Lee

doi:10.1109/74.706067

Fast Illinois Solver Code (FISC)

J. M. Song, C. C. Lu, W. C. Chew, S. W. Lee

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

176 Scopus citations

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 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 multiply in the CG method. The complexities for both the CPU time per iteration and the memory requirements are of O(N log N), where N is the number of unknowns. A 2.4-million unknown problem is solved in a few hours on the SGI CRAY Origin 2000 at NCSA of the University of Illinois at Urbana-Champaign.

Original language	English
Pages (from-to)	27-33
Number of pages	7
Journal	IEEE Antennas and Propagation Magazine
Volume	40
Issue number	3
DOIs	https://doi.org/10.1109/74.706067
State	Published - Jun 1998

Bibliographical note

Funding Information:
This work was supported by AFOSR, under MURI grant F49620-96-1-0025; the Office of Naval Research, under grant N00014-95-1-0872; and the National Science Foundation, under grant NSF ECS 93-02145. The computer time was provided by the National Center for Supercomputing Applications (NCSA) at the University of Illinois at Urbana-Champaign, and the ASC MSRC.

Funding

This work was supported by AFOSR, under MURI grant F49620-96-1-0025; the Office of Naval Research, under grant N00014-95-1-0872; and the National Science Foundation, under grant NSF ECS 93-02145. The computer time was provided by the National Center for Supercomputing Applications (NCSA) at the University of Illinois at Urbana-Champaign, and the ASC MSRC.

Funders	Funder number
National Science Foundation (NSF)	ECS 93-02145
Office of Naval Research	N00014-95-1-0872
Air Force Office of Scientific Research, United States Air Force
Multidisciplinary University Research Initiative	F49620-96-1-0025

Keywords

Electromagnetic scattering
Fast multipole
Integral equations
Method of Moments
Multilevel algorithm
Radar cross sections

ASJC Scopus subject areas

Condensed Matter Physics
Electrical and Electronic Engineering

Access to Document

10.1109/74.706067

Cite this

@article{d8284b372af642beb537c089f8b28767,

title = "Fast Illinois Solver Code (FISC)",

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 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 multiply in the CG method. The complexities for both the CPU time per iteration and the memory requirements are of O(N log N), where N is the number of unknowns. A 2.4-million unknown problem is solved in a few hours on the SGI CRAY Origin 2000 at NCSA of the University of Illinois at Urbana-Champaign.",

keywords = "Electromagnetic scattering, Fast multipole, Integral equations, Method of Moments, Multilevel algorithm, Radar cross sections",

author = "Song, {J. M.} and Lu, {C. C.} and Chew, {W. C.} and Lee, {S. W.}",

note = "Funding Information: This work was supported by AFOSR, under MURI grant F49620-96-1-0025; the Office of Naval Research, under grant N00014-95-1-0872; and the National Science Foundation, under grant NSF ECS 93-02145. The computer time was provided by the National Center for Supercomputing Applications (NCSA) at the University of Illinois at Urbana-Champaign, and the ASC MSRC.",

year = "1998",

month = jun,

doi = "10.1109/74.706067",

language = "English",

volume = "40",

pages = "27--33",

number = "3",

}

TY - JOUR

T1 - Fast Illinois Solver Code (FISC)

AU - Song, J. M.

AU - Lu, C. C.

AU - Chew, W. C.

AU - Lee, S. W.

N1 - Funding Information: This work was supported by AFOSR, under MURI grant F49620-96-1-0025; the Office of Naval Research, under grant N00014-95-1-0872; and the National Science Foundation, under grant NSF ECS 93-02145. The computer time was provided by the National Center for Supercomputing Applications (NCSA) at the University of Illinois at Urbana-Champaign, and the ASC MSRC.

PY - 1998/6

Y1 - 1998/6

N2 - 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 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 multiply in the CG method. The complexities for both the CPU time per iteration and the memory requirements are of O(N log N), where N is the number of unknowns. A 2.4-million unknown problem is solved in a few hours on the SGI CRAY Origin 2000 at NCSA of the University of Illinois at Urbana-Champaign.

AB - 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 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 multiply in the CG method. The complexities for both the CPU time per iteration and the memory requirements are of O(N log N), where N is the number of unknowns. A 2.4-million unknown problem is solved in a few hours on the SGI CRAY Origin 2000 at NCSA of the University of Illinois at Urbana-Champaign.

KW - Electromagnetic scattering

KW - Fast multipole

KW - Integral equations

KW - Method of Moments

KW - Multilevel algorithm

KW - Radar cross sections

UR - http://www.scopus.com/inward/record.url?scp=0032090314&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032090314&partnerID=8YFLogxK

U2 - 10.1109/74.706067

DO - 10.1109/74.706067

M3 - Article

AN - SCOPUS:0032090314

SN - 1045-9243

VL - 40

SP - 27

EP - 33

JO - IEEE Antennas and Propagation Magazine

JF - IEEE Antennas and Propagation Magazine

IS - 3

ER -

Fast Illinois Solver Code (FISC)

Abstract

Bibliographical note

Funding

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this