An aggregated interaction matrix algorithm

The recursive aggregate T matrix algorithm (RATMA) has been developed to solve for the scattering solution of N subscatterers with reduced computational complexity. For a general scattering problem, a scatterer is first decomposed into N subscatterers which are non-overlapping before the RATMA is applied. In computational electromagnetics, a scatterer is often discretized by using subdomain basis functions which are overlapping, essentially decomposing a scatterer into a set of overlapping subscatterers, as in the method of moments. We describe an improved RATMA which allows for overlapping subscatterers.<>