An efficient method to solve the scattering by a cluster of randomly located discrete scatterers is described. The scatterers can have an arbitrary shape, and only their T matrices need be known. An iterative method is suggested to solve this problem. To expedite the matrix‐vector multiply, we first aggregate the random scattering centers of the scatterers into centers that reside on a regular array. Then, the FFT method is used to perform the matrix‐vector multiply in O(N log N) operations. This method can solve a problem with a large number of unknowns, involving thousands of discrete scatterers, on a workstation.
No takes yet. Share an insight, caveat, or question.
Chew et al. (1995) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: