An IE-FFT Algorithm to Analyze PEC Objects for MFIE Formulation

An IE-FFT algorithm is implemented and applied to the electromagnetic (EM) solution of perfect electric conducting (PEC) scattering problems. The solution of the method of moments (MoM), based on the magnetic field integral equation (MFIE), is obtained for PEC objects with closed surfaces. The IE-FF...

Full description

Bibliographic Details
Main Author: Seung Mo Seo
Format: Article
Language:English
Published: The Korean Institute of Electromagnetic Engineering and Science 2019-01-01
Series:Journal of the Korean Institute of Electromagnetic Engineering and Science
Subjects:
Online Access:http://www.jees.kr/upload/pdf/jees-2019-19-1-6.pdf
Description
Summary:An IE-FFT algorithm is implemented and applied to the electromagnetic (EM) solution of perfect electric conducting (PEC) scattering problems. The solution of the method of moments (MoM), based on the magnetic field integral equation (MFIE), is obtained for PEC objects with closed surfaces. The IE-FFT algorithm uses a uniform Cartesian grid to apply a global fast Fourier transform (FFT), which leads to significantly reduce memory requirement and speed up CPU with an iterative solver. The IE-FFT algorithm utilizes two discretizations, one for the unknown induced surface current on the planar triangular patches of 3D arbitrary geometries and the other on a uniform Cartesian grid for interpolating the free-space Green’s function. The uniform interpolation of the Green’s functions allows for a global FFT for far-field interaction terms, and the near-field interaction terms should be adequately corrected. A 3D block-Toeplitz structure for the Lagrangian interpolation of the Green’s function is proposed. The MFIE formulation with the IE-FFT algorithm, without the help of a preconditioner, is converged in certain iterations with a generalized minimal residual (GMRES) method. The complexity of the IE-FFT is found to be approximately O(N1.5) and O(N1.5logN) for memory requirements and CPU time, respectively.
ISSN:2234-8409
2234-8395