University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > A fast high order algorithm for multiple scattering from large configurations of scatterers

A fast high order algorithm for multiple scattering from large configurations of scatterers

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

MWSW03 - Computational methods for multiple scattering

Simulation of wave interactions with configurations containing large numbers of individual particles are important in diverse applications including oceanography and atmospheric science applications. Simulations need to account for reflections between all particles, the number of which grows with the square of the number of particles. Consequently, such simulations have been mostly limited to relatively small numbers of particles. We present an efficient solver based on a Krylov subspace method combined with a fast algorithm for computing matrix vector products whose complexity (memory and CPU time) grows only linearly with the number of particles.Our matrix vector product scheme is based on a novel numerically stable expansion of the field radiated by each particle in cylindrical or spherical wavefunctions. We demonstrate our algorithm by simulating multiple scattering for large configurations with tens or hundreds of thousands of individual particles. 

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity