COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Efficient algorithms for convolutions based on contour integral methods
Efficient algorithms for convolutions based on contour integral methodsAdd to your list(s) Download to your calendar using vCal
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 talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCambridge Women Faculty of Economics Leica Scientific ForumOther talksHalfway to Rota's basis conjecture 3D Genomics in development and disease Sliding Modes for Estimation: theory and practice G I TAYLOR LECTURE - The Silent Flight of the Owl Investigating human blood development at the single-cell level Outline and Summary of INI Research Programme |