Loading…
A fast IE-FFT algorithm for solving PEC scattering problems
This paper presents a novel fast integral equation method, termed IE-FFT, for solving large electromagnetic scattering problems. Similar to other fast integral equation methods, the IE-FFT algorithm starts by partitioning the basis functions into multilevel clustering groups. Subsequently, the entir...
Saved in:
Published in: | IEEE transactions on magnetics 2005-05, Vol.41 (5), p.1476-1479 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
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!
|
Summary: | This paper presents a novel fast integral equation method, termed IE-FFT, for solving large electromagnetic scattering problems. Similar to other fast integral equation methods, the IE-FFT algorithm starts by partitioning the basis functions into multilevel clustering groups. Subsequently, the entire impedance matrix is decomposed into two parts: one for the self and/or near field couplings, and one for well-separated group couplings. The IE-FFT algorithm employs two discretizations one is for the unknown current on an unstructured triangular mesh, and the other is a uniform Cartesian grid for interpolating the Green's function. By interpolating the Green's function on a regular Cartesian grid, the couplings between two well-separated groups can be computed using the fast Fourier transform (FFT). Consequently, the IE-FFT algorithm does not require the knowledge of addition theorem. It simply utilizes the Toeplitz property of the coefficient matrix and is therefore applicable to both static and wave propagation problems. |
---|---|
ISSN: | 0018-9464 1941-0069 |
DOI: | 10.1109/TMAG.2005.844564 |