Application of recursive aggregate T-matrix algorithm in the Monte Carlo simulations of the extinction rate of random particles

C. C. Lu, Y. M. Wang, Weng Cho Chew

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Investigation of the scattering properties of randomly distributed particles has applications in wave propagation and remote sensing. The problem has been addressed by many scientists. In this paper the authors present a similar simulation with a different method for solving the scattering properties. The scattering solution method is the Recursive Aggregate T-Matrix Algorithm (RATMA) which is very efficient in solving the scattering problem by a large number of spheres. This method has two major advantages, one is the reduction in computational complexity, another is the reduction in memory requirement.

Original languageEnglish (US)
Title of host publicationAP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)
Editors Anon
PublisherPubl by IEEE
Pages1292-1295
Number of pages4
ISBN (Print)0780312465
StatePublished - Dec 1 1993
EventProceedings of the IEEE 1993 International Symposium Digest of Antennas and Propagation - Ann Arbor, MI, USA
Duration: Jun 28 1993Jul 2 1993

Publication series

NameAP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)
Volume3
ISSN (Print)0272-4693

Other

OtherProceedings of the IEEE 1993 International Symposium Digest of Antennas and Propagation
CityAnn Arbor, MI, USA
Period6/28/937/2/93

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Application of recursive aggregate T-matrix algorithm in the Monte Carlo simulations of the extinction rate of random particles'. Together they form a unique fingerprint.

Cite this