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

Producción científica: Article › revisión exhaustiva

183 Citas (Scopus)

Resumen

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.

Idioma original	English
Páginas (desde-hasta)	27-33
Número de páginas	7
Publicación	IEEE Antennas and Propagation Magazine
Volumen	40
N.º	3
DOI	https://doi.org/10.1109/74.706067
Estado	Published - jun 1998

Nota bibliográfica

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.

Financiación

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.

Financiadores	Número del financiador
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

ASJC Scopus subject areas

Condensed Matter Physics
Electrical and Electronic Engineering

Acceder al documento

10.1109/74.706067

Otros archivos y enlaces

Citar esto

@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 - https://www.scopus.com/pages/publications/0032090314

UR - https://www.scopus.com/pages/publications/0032090314#tab=citedBy

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)

Resumen

Nota bibliográfica

Financiación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto