Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Fast algorithm for electromagnetic scattering by buried 3-D dielectric objects of large size

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cui, Tie Jun ; Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA ; Weng Cho Chew

A fast algorithm for electromagnetic scattering by buried three dimensional (3-D) dielectric objects of large size is presented by using the conjugate gradient (CG) method and fast Fourier transform (FFT). In this algorithm, the Galerkin method is utilized to discretize the electric field integral equations, where rooftop functions are chosen as both basis and testing functions. Different from the 3-D objects in homogeneous space, the resulting matrix equation for the buried objects contains both cyclic convolution and correlation terms, either of which can be solved rapidly by the CG-FFT method. The near-scattered field on the observation plane in the upper space has been expressed by two-dimensional (2-D) discrete Fourier transforms (DFTs), which also can be rapidly computed. Because of the use of FFTs to handle the Toeplitz matrix, the Sommerfeld integrals' evaluation which is time consuming yet essential for the buried object problem, has been reduced to a minimum. The memory required in this algorithm is of order N (the number of unknowns), and the computational complexity is of order NiterN log N, in which Niter is the iteration number, and Niter≪N is usually true for a large problem

Published in:

Geoscience and Remote Sensing, IEEE Transactions on  (Volume:37 ,  Issue: 5 )