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, W. C. Chew

Producción científica: Conference contributionrevisión exhaustiva

5 Citas (Scopus)

Resumen

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.

Idioma originalEnglish
Título de la publicación alojadaAP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)
Editores Anon
Páginas1292-1295
Número de páginas4
EstadoPublished - 1993
EventoProceedings of the IEEE 1993 International Symposium Digest of Antennas and Propagation - Ann Arbor, MI, USA
Duración: jun 28 1993jul 2 1993

Serie de la publicación

NombreAP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)
Volumen3
ISSN (versión impresa)0272-4693

Conference

ConferenceProceedings of the IEEE 1993 International Symposium Digest of Antennas and Propagation
CiudadAnn Arbor, MI, USA
Período6/28/937/2/93

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Huella

Profundice en los temas de investigación de 'Application of recursive aggregate T-matrix algorithm in the Monte Carlo simulations of the extinction rate of random particles'. En conjunto forman una huella única.

Citar esto