Title :
The application of recursive aggregate T-matrix algorithm in the Monte Carlo simulations of the extinction rate of random particles
Author :
Lu, C. ; Wang, Y. ; Chew, W. ; Tsang, L.
Author_Institution :
Dept. of Electr. & Comput. Eng., Illinois Univ., Urbana, IL, USA
fDate :
June 28 1993-July 2 1993
Abstract :
RATMA (recursive aggregate T-matrix algorithm) is used to compute the scattered field in the Monte Carlo simulation. RATMA is very efficient in solving the scattering problem by a large number of spheres. This method has two major advantages: reduction in computational complexity and reduction in memory requirement. Numerical results are presented.<>
Keywords :
Monte Carlo methods; computational complexity; convergence of numerical methods; electromagnetic wave scattering; random processes; recursive estimation; Monte Carlo simulation; RATMA; computational complexity; extinction rate; memory requirement; random particles; recursive aggregate T-matrix algorithm; scattered field; spheres; Aggregates; Computational modeling; Contracts; Convergence; Equations; Mie scattering; Numerical simulation; Physics computing; Polarization;
Conference_Titel :
Antennas and Propagation Society International Symposium, 1993. AP-S. Digest
Conference_Location :
Ann Arbor, MI, USA
Print_ISBN :
0-7803-1246-5
DOI :
10.1109/APS.1993.385430
