Enhancement of the numerical stability of the adaptive integral method at low frequencies through a loop-charge formulation of the method-of-moments approximation

The performance of integral-equation-based fast iterative solution schemes such as the adaptive integral method (AIM) and the conjugate gradient (CG) fast Fourier transform (FFT) algorithm can be substantially improved at low frequencies if the electric current and electric charge densities are trea...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on microwave theory and techniques 2004-03, Vol.52 (3), p.962-970
Main Authors: Okhmatovski, V.I., Morsey, J.D., Cangellaris, A.C.
Format: Article
Language:English
Subjects:
Algorithms
Character generation
Current density
EMP radiation effects
Fast Fourier transforms
Fourier transforms
Frequency locked loops
Iterative algorithms
Iterative methods
Magnetic separation
Moment methods
Numerical stability
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The performance of integral-equation-based fast iterative solution schemes such as the adaptive integral method (AIM) and the conjugate gradient (CG) fast Fourier transform (FFT) algorithm can be substantially improved at low frequencies if the electric current and electric charge densities are treated as two separate unknown quantities. The representation of the current density in terms of solenoidal expansion functions (loops) and the charge density in terms of pulse basis functions provides for an exact decomposition of the original electromagnetic (EM) boundary-value problem into its magnetostatic and electrostatic forms at zero frequency. This formulation allows for accurate EM modeling down to very low frequencies free of numerical instabilities, while the spectral properties of the matrix equation are substantially improved compared to the standard method of moments formulation in either loop-tree or loop-star basis. The AIM and the CG FFT algorithms can be appropriately adjusted to accommodate for the use of loop-charge basis functions, thus leading to efficient solvers with O(NlogN) solution complexity and O(N) memory requirements for two-and-one-half-dimensional and penetrable three-dimensional (3-D) structures. For general 3-D objects, the CPU time and memory of the algorithms scale as O(N/sup 1.5/logN) and O(N/sup 1.5/), respectively. The new implementation of the AIM is discussed and demonstrated through its application for the broad-band simulation of complex interconnect and electronic packaging structures.
ISSN:0018-9480
1557-9670
DOI:10.1109/TMTT.2004.823578