Title :
A windowed recursive T-matrix algorithm for wave-scattering solutions
Author :
Chew, W.C. ; Wang, Y.M. ; Gurel, Levent
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
Abstract :
A windowed RATMA (recursive aggregate T-matrix algorithm) is discussed which can be used for both E/sub z/ and H/sub z/ wave scatterings. This algorithm has an O(n/sup 2/) complexity in two-dimensions and an O(N/sup 7/3/) complexity in three dimensions which is faster than the method of moments with Gaussian elimination, and yet produces a solution valid for all angles of incidence.<>
Keywords :
computational complexity; electrical engineering computing; electromagnetic wave scattering; matrix algebra; recursive functions; E/sub z/-polarized waves; H/sub z/-polarized waves; complexity; wave-scattering solutions; windowed RATMA; windowed recursive T-matrix algorithm; Aggregates; Computational complexity; Contracts; Convergence; Electromagnetic scattering; Engine cylinders; Fourier series; Laboratories; Military computing; Moment methods;
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.221733
