Please use this identifier to cite or link to this item:
Title: Analyzing PEC scattering structure using an IE-FFT algorithm
Authors: Seo, S.M.
Wang, C.-F. 
Lee, J.-F.
Keywords: And integral equation
Electromagnetic scattering
Fast Fourier Transform
Methods of moment
Numerical method
Issue Date: Apr-2009
Source: Seo, S.M.,Wang, C.-F.,Lee, J.-F. (2009-04). Analyzing PEC scattering structure using an IE-FFT algorithm. Applied Computational Electromagnetics Society Journal 24 (2) : 116-128. ScholarBank@NUS Repository.
Abstract: In this paper a fast integral equation method, termed IE-FFT, is developed, analyzed and applied to the electromagnetic (EM) solution of scattering problems. The methodology is developed for the Method of Moments (MoM) solution of the Electric Field Integral Equation (EFIE) on electrically large Perfect Electric Conducting (PEC) structures. Similar to other Fast Fourier Transform (FFT) based algorithms, IE-FFT uses a Cartesian grid to drastically decrease memory storage and speed up the matrix-vector multiplication. The EE-FFT algorithm employs two discretizations, one for the unknown current on an unstructured triangular mesh and the other on a uniform Cartesian grid for interpolating the Green's function. The uniform interpolation of the Green's function allows the fast computation of well-separated MoM interaction terms with the aid of a global FFT. Nevertheless, the coupling between near-interaction terms should be adequately corrected. The major contribution of this paper lies on the Lagrangian interpolation of the Green's function. This not only allows simple and efficient algorithmic implementation, but also naturally suggests a rigorous error analysis of the algorithm. The efficiency of the method is based on the Toeplitz structure of the interpolated Green's function. Therefore, it is applicable on both asymptotically-smooth and oscillatory kernels arisen in static and wave propagation problems, respectively. Through numerical simulations of electromagnetic wave scattering from a PEC sphere, the complexity of the IE-FFT algorithm is found to scale as O(N1.5) and O(N1.5logN) for memory and CPU time, © 2009 ACES.
Source Title: Applied Computational Electromagnetics Society Journal
ISSN: 10544887
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jan 13, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.