DocumentCode
2798250
Title
A recursive algorithm for reducing algorithmic complexity of scattering problems
Author
Chew, W.C. ; Wang, Y.M.
Author_Institution
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
fYear
1990
fDate
7-11 May 1990
Firstpage
52
Abstract
A recursive algorithm for calculating the exact solution of field scattering from a dielectric object is proposed. As in the method of moments, the object is first divided into N subobjects. Then, every subject is treated as a single scatterer in an N-scatterer problem. The recursive algorithm is then employed to calculate the (n+1)-scatterer tensor-T matrix from the n-scatterer tensor-T matrix. With this recursive algorithm, the N-scatterer tensor-T matrix can be derived. From this N-scatterer tensor T-matrix, the scattered field from the object can be obtained. This results in an N/sup 2/ and a linear in N algorithm in the long wavelength limit rather than the N/sup 3/ algorithm as in the method of moments.<>
Keywords
computational complexity; electromagnetic field theory; electromagnetic wave scattering; matrix algebra; EM wave scattering; algorithmic complexity; dielectric object; exact solution; field scattering; long wavelength limit; method of moments; recursive algorithm; scattering problems; tensor-T matrix; Aggregates; Dielectrics; Electromagnetic scattering; Equations; Forward contracts; Frequency; Laboratories; Moment methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Antennas and Propagation Society International Symposium, 1990. AP-S. Merging Technologies for the 90's. Digest.
Conference_Location
Dallas, TX, USA
Type
conf
DOI
10.1109/APS.1990.115046
Filename
115046
Link To Document