Sparse-Matrix Canonical-Grid Method for Scattering by Many Scatterers

摘要

A new efficient algorithm based on the decomposition of strong and weakinteractions among scatterers a proposed. The weak interactions, which account for the majority of the required CPU time and memory, at calculated using a canonical grid with a transition addition theorem. This facilitates the use of FFT and results in an N log N-type efficiency for CPU and 0(N) for memory. (AN).