Coding With Fun
Home Docker Django Node.js Articles Python pip guide FAQ Policy

Which is slower t matrix or t matrix?


Asked by Gunner Lynn on Dec 07, 2021 FAQ



In application to bispheres, the multi-sphere T -matrix code is slower than the bisphere code. However, it can be applied to clusters with a number of components larger than 2.
Next,
The regular T -matrix codes for randomly oriented particles are based on the analytical orientation averaging procedure described in the paper M. I. Mishchenko, J. Opt. Soc. Am. A 8, 871-882 (1991). This efficient procedure makes the codes 1 to 2 orders of magnitude faster than T -matrix codes based on the standard numerical averaging approach.
In fact, The standard way to actually calculate the T-Matrix method is the Null-Field Method, that relies on the Stratton-Chu equations. They basically state that the electromagnetic fields outside a given volume can be expressed as integrals over the surface enclosing the volume involving only the tangential components of the fields on the surface.
Indeed,
The regular T -matrix codes are applicable to rotationally symmetric particles with equivalent-sphere size parameters exceeding 100. At present, the T -matrix method is the fastest exact technique for the computation of nonspherical scattering based on a direct solution of Maxwell's equations.
Just so,
Alexander G. Kyurkchan, Nadezhda I. Smirnova, in Mathematical Modeling in Diffraction Theory, 2016 Chapter 3 examines the null field and T-matrix methods, which are widely used to solve problems of radiophysics, radioastronomy, biophysics, etc.