Electromagnetics scattering from a cluster of spheres

Author

Wang, Y.M. ; Chew, W.C.

Author_Institution

Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA

fYear

1992

fDate

18-25 June 1992

Firstpage

929

Abstract

The authors present a solution for electromagnetic scattering from a cluster of spheres by using the generalized RATMA (recursive aggregate T-matrix algorithm). Numerical simulations demonstrate that this method could easily generate an electromagnetic scattering solution for hundreds of spheres. The computational complexity of the algorithm is proportional to N/sup 2/MP/sup 2/, where N is the number of spheres and P is the number of spherical harmonics used in the expansion of the field, instead of N/sup 3/P/sup 3/ for the brute force method.<>

Keywords

electromagnetic wave scattering; matrix algebra; RATMA; RCS; computational complexity; electromagnetic scattering; field expansion; numerical simulations; recursive aggregate T-matrix algorithm; spheres; spherical harmonics; Aggregates; Clustering algorithms; Computational complexity; Contracts; Electromagnetic scattering; Electromagnetic wave polarization; Equations; Laboratories; Numerical simulation; Tellurium;

fLanguage

English

Publisher

ieee

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

Type

conf

DOI

10.1109/APS.1992.221799

Filename

221799