2005 · 122 citations · 19 references
ComputingComputer SciencePhysicsAlgorithmsComputational MechanicsComputational PhysicsIntegral EquationsNumerical AlgorithmsNumerical AnalysisNumerical IntegrationNumerical Methods For Differential EquationsTime IntegrationComplexityConvolutionDifferential Equation SolversLaplace TransformNumerical Methods For Integral EquationsQuadrature RulesTransparent Boundary Conditions
Abstract. We give an algorithm to compute N steps of a convolution quadrature approximation to a continuous temporal convolution using only O(N log N) multiplications and O(log N) active memory. The method does not require evaluations of the convolution kernel, but instead O(log N) 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.
19
The Accurate Numerical Inversion of Laplace Transforms
A. Talbot · IMA Journal of Applied Mathematics · 1979 · 818 citations
Computing, Computer Science, Physics +17
Convolution quadrature and discretized operational calculus. I
Christian Lubich · Numerische Mathematik · 1988 · 703 citations