TY - JOUR
T1 - A high-order algorithm for multiple electromagnetic scattering in three dimensions
AU - Ganesh, M.
AU - Hawkins, S. C.
PY - 2009/4
Y1 - 2009/4
N2 - We describe a fully discrete high-order algorithm for simulating multiple scattering of electromagnetic waves in three dimensions by an ensemble of perfectly conducting scattering objects. A key component of our surface integral algorithm is high-order tangential approximation of the surface current on each obstacle in the ensemble. The high-order nature of the algorithm leads to relatively small numbers of unknowns, which allows us to use either a direct method or an iterative boundary decomposition method for simulations of multiple scattering. We demonstrate the algorithm using both of these techniques for near and well separated obstacles. Using a small computing cluster (with 20 processors), we simulate multiple scattering by up to 125 objects for frequencies in the resonance region, and by paired obstacles of diameter 20 to 30 times the incident wavelength. Many physically important problems, such as scattering by atmospheric aerosols or ice crystals, involve multiple scattering by ensembles of particles, each particle having its own distinct shape, but with all particles fitting a stochastic description with a small number of fixed parameters in local spherical coordinates. We demonstrate our algorithm for multiple scattering by ensembles of such unique particles, whose stochastic description corresponds to computer models of ice crystals and dust particles.
AB - We describe a fully discrete high-order algorithm for simulating multiple scattering of electromagnetic waves in three dimensions by an ensemble of perfectly conducting scattering objects. A key component of our surface integral algorithm is high-order tangential approximation of the surface current on each obstacle in the ensemble. The high-order nature of the algorithm leads to relatively small numbers of unknowns, which allows us to use either a direct method or an iterative boundary decomposition method for simulations of multiple scattering. We demonstrate the algorithm using both of these techniques for near and well separated obstacles. Using a small computing cluster (with 20 processors), we simulate multiple scattering by up to 125 objects for frequencies in the resonance region, and by paired obstacles of diameter 20 to 30 times the incident wavelength. Many physically important problems, such as scattering by atmospheric aerosols or ice crystals, involve multiple scattering by ensembles of particles, each particle having its own distinct shape, but with all particles fitting a stochastic description with a small number of fixed parameters in local spherical coordinates. We demonstrate our algorithm for multiple scattering by ensembles of such unique particles, whose stochastic description corresponds to computer models of ice crystals and dust particles.
UR - http://www.scopus.com/inward/record.url?scp=63349097608&partnerID=8YFLogxK
U2 - 10.1007/s11075-008-9238-z
DO - 10.1007/s11075-008-9238-z
M3 - Article
AN - SCOPUS:63349097608
SN - 1017-1398
VL - 50
SP - 469
EP - 510
JO - Numerical Algorithms
JF - Numerical Algorithms
IS - 4
ER -