Recursive aggregate T-matrix algorithm

If the number of particles increases, the dimension of the global matrix A becomes excessively large. Wang and Chew [250,251] proposed a recursive T-matrix algorithm, which computes the T matrix of a system of n components by using the transition matrices of the newly added q components and the 

T matrix of the previous system oi n — q components. In this section we use the recursive T-matrix algorithm to analyze electromagnetic scattering by a system of identical particles randomly distributed inside an imaginary spherical surface. 

At the first iteration step, we compute the system T-matrix of all particles situated inside the sphere of radius f cs(l)- At the iteration step k, we compute the system T-matrix of all particles situated inside the sphere of radius Rcs k) by considering a [Af k) + l]-scatterer problem. In fact, the transition matrix T is computed by using the system T-matrix of the 

---