University of Cambridge > > Isaac Newton Institute Seminar Series > Efficient algorithms for convolutions based on contour integral methods

Efficient algorithms for convolutions based on contour integral methods

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

  • UserMaria Lopez-Fernandez (Università degli Studi di Roma La Sapienza; Universidad de Málaga)
  • ClockThursday 12 December 2019, 11:30-12:30
  • HouseSeminar Room 1, Newton Institute.

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

CATW03 - Computational complex analysis

We propose an efficient family of algorithms for the approximation of Volterra integral equations of convolution type arising in two different applications. The first application we consider is the approximation of the fractional integral and associated fractional differential equations. The second application is the resolution of Schrödinger equations with concentrated potentials, which admit a formulation as systems of integral equations. In both cases, we are able to derive fast implementations of Lubich's Convolution Quadrature with very much reduced memory requirements and very easy to implement. Our algorithms are based on special contour integral representations of the Convolution Quadrature weights, according to the application, and special quadratures to compute them. Numerical experiments showing the performance of our methods will be shown.
This is joint work with Lehel Banjai (Heriot-Watt University)

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