Efficient algorithms for convolutions based on contour integral methods

48 mins 28 secs,  88.68 MB,  MP3  44100 Hz,  249.81 kbits/sec
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Lopez-Fernandez, M
Thursday 12th December 2019 - 11:30 to 12:30
 
Created: 2019-12-16 12:35
Collection: Complex analysis: techniques, applications and computations
Publisher: Isaac Newton Institute
Copyright: Lopez-Fernandez, M
Language: eng (English)
Distribution: World     (downloadable)
Explicit content: No
Aspect Ratio: 16:9
Screencast: No
Bumper: UCS Default
Trailer: UCS Default
 
Abstract: 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)
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 640x360    1.93 Mbits/sec 704.07 MB View Download
WebM 640x360    364.93 kbits/sec 129.46 MB View Download
iPod Video 480x270    522.19 kbits/sec 185.18 MB View Download
MP3 * 44100 Hz 249.81 kbits/sec 88.68 MB Listen Download
Auto (Allows browser to choose a format it supports)