University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Numerical steepest descent for singular and oscillatory integrals

Numerical steepest descent for singular and oscillatory integrals

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

If you have a question about this talk, please contact info@newton.ac.uk.

CATW03 - Computational complex analysis

Co-Authors: Daan Huybrechs, David Hewett

When modelling high frequency scattering, a common approach is to enrich the approximation space with oscillatory basis functions. This can lead to a significant reduction in the DOFs required to accurately represent the solution, which is advantageous in terms of memory requirements and it makes the discrete system significantly easier to solve. A potential drawback is that the each element in the discrete system is a highly oscillatory, and sometimes singular, integral. Therefore an efficient quadrature rule for such integrals is essential for an efficient scattering model. In this talk I will present a new class of quadrature rule we have designed for this purpose, combining Numerical Steepest Descent (which works well for oscillatory integrals) with Generalised Gaussian quadrature (which works well for singular integrals).

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