TY - GEN A1 - Schädle, Achim A1 - Lopez Fernandez, Maria A1 - Lubich, Christian T1 - Fast and oblivious convolution quadrature N2 - We give an algorithm to compute N steps of a convolution quadrature approximation to a continuous temporal convolution using only O(N logN) 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 integrodifferential equations of convolution type. In a numerical example we apply it to solve a subdiffusion equation with transparent boundary conditions. Y1 - 2006 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/212 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-2127 ER -