Title :
Fast algorithm for electromagnetic scattering by buried conducting plates of large size
Author :
Cui, T.J. ; Chew, W.C.
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
fDate :
6/1/1999 12:00:00 AM
Abstract :
This letter presents a fast algorithm for electromagnetic scattering by buried conducting plates of large size and arbitrary shape using the conjugate gradient (CG) method combined with the fast Fourier transform (FFT). Due to the use of FFT in handling the cyclic convolutions related to Toeplitz matrices, the Sommerfeld integrals´ evaluation for the buried scattering problem, which is usually time consuming, has been reduced to a minimum. The memory required for this algorithm is of the order N-the number of unknowns-and the computational complexity is of order NiterNlogN (Niter is the iteration number Niter≪N for large problems)
Keywords :
Galerkin method; Toeplitz matrices; computational complexity; conducting bodies; conjugate gradient methods; electric field integral equations; electromagnetic wave scattering; fast Fourier transforms; EFIE; FFT; Galerkin method; Sommerfeld integrals; Toeplitz matrices; buried conducting plates; computational complexity; conjugate gradient method; cyclic convolutions; electric field integral equation; electromagnetic scattering; fast Fourier transform; fast algorithm; iteration; large arbitrary shaped plates; Buried object detection; Character generation; Computational complexity; Electromagnetic radiation; Electromagnetic scattering; Fast Fourier transforms; Large-scale systems; Moment methods; Nonhomogeneous media; Shape;
Journal_Title :
Antennas and Propagation, IEEE Transactions on
