A fast sparse iterative method (SIM) for method of moments

Author

Fourie, A.P.C. ; Nitch, D.C.

Author_Institution

Dept. of Electr. Eng., Univ. of the Witwatersrand, Johannesburg, South Africa

Volume

2

fYear

1994

fDate

20-24 June 1994

Firstpage

1146

Abstract

The sparse iterative method (SIM) provides a faster solution to method of moments (MoM) matrix equations than does LU-decomposition with forward and back substitution. The SIM produces a solution with computational time proportional to N/sup 2/, as opposed to the N/sup 3/ time dependence associated with LU-decomposition. The SIM is implemented in an object oriented MoM program which is functionally equivalent to NEC2. In three examples, the SIM is shown to produce results as accurate as LU-decomposition. For dipoles, a flat wire grid and a generic three dimensional missile shape, the speed increase ranged from 3-30 times the speed of LU-decomposition; greater speed increases can be expected with electrically larger problems. The SIM requires no problem formulation changes, such as segment renumbering, and despite the fact that it is demonstrated for a wire MoM based on NEC2, it is general enough to be incorporated to any MoM formulation.<>

Keywords

dipole antennas; electrical engineering; electrical engineering computing; iterative methods; method of moments; missiles; object-oriented programming; MoM matrix equations; NEC2; computational time; dipoles; fast sparse iterative method; flat wire grid; method of moments; object oriented MoM program; three dimensional missile shape; Africa; Computer hacking; Equations; Iterative methods; Matrix decomposition; Message-oriented middleware; Missiles; Moment methods; Sparse matrices; Wire;

fLanguage

English

Publisher

ieee

Conference_Titel

Antennas and Propagation Society International Symposium, 1994. AP-S. Digest

Conference_Location

Seattle, WA, USA

Print_ISBN

0-7803-2009-3

Type

conf

DOI

10.1109/APS.1994.407888

Filename

407888