DocumentCode :
343894
Title :
Fast computation of scattering from (near-)resonant structures
Author :
Gurel, L. ; Yilmaz, A.E. ; Chew, W.C.
Author_Institution :
Dept. of Electr. & Electron. Eng., Bilkent Univ., Ankara, Turkey
Volume :
2
fYear :
1999
fDate :
11-16 July 1999
Firstpage :
1174
Abstract :
The direct solvers of this paper are recursive in nature: i.e., they introduce (sub)scatterers to the geometry one at a time and obtain the complete solution for a partial geometry at each recursion. As a new (sub)scatterer is added, its interaction with all the existing ones need to be computed. The existing (sub)scatterers are divided into two groups: near neighbors and distant neighbors with respect to the most recently added (sub)scatterer. The near-neighbor interactions are computed using the recursive aggregate interaction matrix algorithm (RIMA), whereas the distant-neighbors are aggregated and their wholesale interaction with the recently added (sub)scatterer is efficiently computed using the recursive aggregate T-matrix algorithm (RATMA).
Keywords :
electromagnetic wave scattering; matrix algebra; resonance; RATMA; RIMA; blockdiagonal preconditioners; convergence; distant neighbors; fast computation; near-neighbor interactions; near-resonant structures scattering; partial geometry; preconditioning; recursive aggregate T-matrix algorithm; recursive aggregate interaction matrix algorithm; recursive direct solvers; resonant structures scattering; scatterers; subscatterers; Aggregates; Electromagnetic scattering; Geometry; Impedance; Iterative algorithms; Message-oriented middleware; Reflection; Resonance; Solids;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Antennas and Propagation Society International Symposium, 1999. IEEE
Conference_Location :
Orlando, FL, USA
Print_ISBN :
0-7803-5639-x
Type :
conf
DOI :
10.1109/APS.1999.789522
Filename :
789522
Link To Document :
بازگشت