The adaptive cross approximation algorithm for accelerated method of moments computations of EMC problems

This paper presents the adaptive cross approximation (ACA) algorithm to reduce memory and CPU time overhead in the method of moments (MoM) solution of surface integral equations. The present algorithm is purely algebraic; hence, its formulation and implementation are integral equation kernel (Green&...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on electromagnetic compatibility 2005-11, Vol.47 (4), p.763-773
Main Authors: Kezhong Zhao, Vouvakis, M.N., Jin-Fa Lee
Format: Article
Language:English
Subjects:
Adaptive algorithms
Algorithms
Applied sciences
Approximation methods
Automotive electromagnetic compatibility (EMC)
Central processing units
Computation
Diffraction, scattering, reflection
Electromagnetic compatibility
Exact sciences and technology
fast integral equation methods
Green's functions
infinite ground plane
Information, signal and communications theory
Integral equations
Mathematical analysis
Mathematical models
Method of moments
method of moments (MoM)
Moment methods
Partitioning
Radiocommunications
Radiowave propagation
Studies
Telecommunications
Telecommunications and information theory
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:This paper presents the adaptive cross approximation (ACA) algorithm to reduce memory and CPU time overhead in the method of moments (MoM) solution of surface integral equations. The present algorithm is purely algebraic; hence, its formulation and implementation are integral equation kernel (Green's function) independent. The algorithm starts with a multilevel partitioning of the computational domain. The interactions of well-separated partitioning clusters are accounted through a rank-revealing LU decomposition. The acceleration and memory savings of ACA come from the partial assembly of the rank-deficient interaction submatrices. It has been demonstrated that the ACA algorithm results in O(NlogN) complexity (where N is the number of unknowns) when applied to static and electrically small electromagnetic problems. In this paper the ACA algorithm is extended to electromagnetic compatibility-related problems of moderate electrical size. Specifically, the ACA algorithm is used to study compact-range ground planes and electromagnetic interference and shielding in vehicles. Through numerical experiments, it is concluded that for moderate electrical size problems the memory and CPU time requirements for the ACA algorithm scale as N/sup 4/3/logN.
ISSN:0018-9375
1558-187X
DOI:10.1109/TEMC.2005.857898