Title :
Recursive T-matrix algorithms for 1-D and 2-D clusterings of strips
Author :
Gurel, L. ; Chew, W.C.
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
Abstract :
Two recursive T-matrix algorithms were introduced for EM scattering by W.C. Chew (1989), W.C. Chew and Y.M. Wang (1990). In the present work, the authors discuss the application of these algorithms to conducting strip geometries, and analyze the complexities of the algorithms. The two algorithms are shown to have complexities of O(N/sup 2/P) and O(NP/sup 2/), where N is the number of unknowns in the problem, and P is the number of terms that satisfies a convergence criterion in the addition theorems for the cylindrical wave functions.<>
Keywords :
computational complexity; electromagnetic wave scattering; matrix algebra; 2-D clusterings; EM scattering; addition theorems; algorithm complexities; conducting strip geometries; convergence; cylindrical wave functions; recursive T-matrix algorithms; Application software; Clustering algorithms; Dielectrics; Frequency selective surfaces; Geometry; Laboratories; Message-oriented middleware; Radar scattering; Strips; Tellurium;
Conference_Titel :
Antennas and Propagation Society International Symposium, 1991. AP-S. Digest
Conference_Location :
London, Ontario, Canada
Print_ISBN :
0-7803-0144-7
DOI :
10.1109/APS.1991.174830
