Cart (Loading....) | Create Account
Close category search window
 

Fast algorithm for electromagnetic scattering by buried conducting plates 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, T.J. ; Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA ; Chew, W.C.

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)

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:47 ,  Issue: 6 )

Date of Publication:

Jun 1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.