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

C Lu,W Chew,Y Wang,L Tsang

doi:10.1109/aps.1993.385430

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

C Lu, W Chew + Show 2 more

https://doi.org/10.1109/aps.1993.385430

Copy DOI

Publication Date: Jun 28, 1993

Citations: 2

Affiliation: University of Illinois Urbana-Champaign, University of Washington

#Recursive Aggregate T-matrix Algorithm #Reduction In Memory Requirement + Show 8 more

Abstract
Full-Text
Similar Papers

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.