Title :
A comparison of the CG-FFT method and the recursive aggregate T-matrix algorithm (EM wave scattering)
Author :
Lin Jiun-Hwa ; Chew, W.C.
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
Abstract :
A comparison of the computing performances of the conjugate-gradient fast Fourier transform (CG-FFT) method and the recursive aggregate T-matrix algorithm (RATMA) is presented. The advantages of each method are discussed. It is shown that, when the biconjugate CG-FET (BiCG-FFT) works, even for lossless cases, its CPU time performance is quite comparable with RATMA. Since the FFT is a highly vectorizable scheme, implementation of CG-FET or BiCG-FFT on a parallel processing machine will increase the efficiency and save much computing time. However, that this is only for a single incidence angle. If different incident fields are considered, one needs to go through the whole process again for CGM or BiCGM. However, RATMA is valid for any incident field from any angle.<>
Keywords :
conjugate gradient methods; electromagnetic wave scattering; fast Fourier transforms; matrix algebra; parallel algorithms; recursive functions; BiCG-FFT; CG-FFT method; EM wave scattering; RATMA; biconjugate CG-FET; computing performances; conjugate-gradient fast Fourier transform; parallel processing; recursive aggregate T-matrix algorithm; Aggregates; Convolution; Electromagnetic scattering; Equations; Gradient methods; Iterative algorithms; Iterative methods; Laboratories; Symmetric matrices; User-generated content;
Conference_Titel :
Antennas and Propagation Society International Symposium, 1992. AP-S. 1992 Digest. Held in Conjuction with: URSI Radio Science Meeting and Nuclear EMP Meeting., IEEE
Conference_Location :
Chicago, IL, USA
Print_ISBN :
0-7803-0730-5
DOI :
10.1109/APS.1992.221732
