University of Cambridge > > Isaac Newton Institute Seminar Series > Efficient high-order accurate boundary integral solvers for complicated three dimensional geometries

Efficient high-order accurate boundary integral solvers for complicated three dimensional geometries

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

The numerical simulation of the Helmholtz and Maxwell equations play a critical role in chip and antennadesign, radar cross section determination, speaker design, biomedical imaging, wireless communications, and the development of new meta-materials and better waveguides to name a few. In order to enable design by simulation for problems arising in these applications, automatically adaptive solvers which resolve the complexity of the geometry and the input data play a critical role. In two dimensions, this has been made possible through the development of high-order integral equation based solvers which rely on well-conditioned integral representations, efficient quadrature formulas, and coupling to fast multipole methods/fast direct solvers. However, much is still to desired of these solvers in three dimensions (both in terms of their efficiency and accuracy), particularly in the context of enabling automatic adaptivity in complex geometries. In this talk, I will present efficient high-order accurate solvers for solving boundary integral equations in complex three dimensional geometries with focus on the following two issues—- quadrature methods for computing singular integrals on high order meshes surfaces, and a locally corrected quadrature framework for fast multipole accelerated iterative solvers and strong skeletonization based direct solvers.

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-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity