Parallel FFT Based Fast Algorithms for Solving Large Scale Electromagnetic Problems

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 parall...

Full description

Saved in:
Bibliographic Details
Published in2006 IEEE Antennas and Propagation Society International Symposium pp. 3995 - 3998
Main Authors Ming Zhang, Tat Soon Yeo, Le Wei Li, Yeow Beng Gan
Format Conference Proceeding
LanguageEnglish
Published IEEE 2006
Subjects
Acceleration
Convolution
Electromagnetic scattering
Gallium nitride
Impedance
Large-scale systems
Linear systems
Matrix converters
Moment methods
Sparse matrices
Online AccessGet full text
ISBN1424401232
9781424401239
ISSN1522-3965
DOI10.1109/APS.2006.1711502

Cover

More Information
Summary: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
ISBN:1424401232
9781424401239
ISSN:1522-3965
DOI:10.1109/APS.2006.1711502