Fast and Oblivious Convolution Quadrature

From MaRDI portal



Abstract: We give an algorithm to compute N steps of a convolution quadrature approximation to a continuous temporal convolution using only O(NlogN) multiplications and O(logN) active memory. The method does not require evaluations of the convolution kernel, but instead O(logN) evaluations of its Laplace transform, which is assumed sectorial. The algorithm can be used for the stable numerical solution with quasi-optimal complexity of linear and nonlinear integral and integro-differential equations of convolution type. In a numerical example we apply it to solve a subdiffusion equation with transparent boundary conditions.





Cited in
(only showing first 100 items - show all)








This page was built for publication: Fast and Oblivious Convolution Quadrature

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470429)