By Topic

Parallel FFT Based Fast Algorithms for Solving Large Scale Electromagnetic Problems

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

4 Author(s)
Ming Zhang ; Tamasek Lab., Nat. Univ. of Singapore ; Tat Soon Yeo ; Le Wei Li ; Yeow Beng Gan

This paper presents two parallel schemes of fast algorithms based on the parallel FFT. In the first scheme, the parallel FFT is applied to speed up multiplication of the impedance matrix and a vector directly. In the second scheme, the AIM is parallelized. To demonstrate the efficiency of the parallel schemes, electromagnetic scattering by a very large cylindrical wire array and a conducting sphere are computed

Published in:

Antennas and Propagation Society International Symposium 2006, IEEE

Date of Conference:

9-14 July 2006