Adaptive, Fast, and Oblivious Convolution in Evolution Equations with Memory
Authors:
- María López-FernándezMLMaría López-Fernández
- Christian LubichCLChristian Lubich
- Achim SchädleASAchim Schädle
- 1 January 2008
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 30 (2) , 1015-1037
Abstract
To approximate convolutions which occur in evolution equations with memory terms, a variable-step-size algorithm is presented for which advancing N steps requires only $O(N\log N)$ operations and $O(\log N)$ active memory, in place of $O(N^2)$ operations and $O(N)$ memory for a direct implementation. A basic feature of the fast algorithm is the reduction, via contour integral representations, to differential equations which are solved numerically with adaptive step sizes. Rather than the kernel itself, its Laplace transform is used in the algorithm. The algorithm is illustrated on three examples: a blowup example originating from a Schrödinger equation with concentrated nonlinearity, chemical reactions with inhibited diffusion, and viscoelasticity with a fractional order constitutive law.
Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Parabolic and hyperbolic contours for computing the Bromwich integralMathematics of Computation, 2007
- On the numerical inversion of the Laplace transform of certain holomorphic mappingsApplied Numerical Mathematics, 2004
- Data-sparse approximation to a class of operator-valued functionsMathematics of Computation, 2004
- Time discretization of an evolution equation via Laplace transformsIMA Journal of Numerical Analysis, 2004
- Reaction front in anreaction-subdiffusion processPhysical Review E, 2004
- Non-Reflecting Boundary Conditions for Maxwell?s EquationsComputing, 2003
- Data-sparse approximation to the operator-valued functions of elliptic operatorMathematics of Computation, 2003
- A parallel method for time-discretization of parabolic problems based on contour integral representation and quadratureMathematics of Computation, 1999
- A modification of Talbot's method for the simultaneous approximation of several values of the inverse Laplace transformACM Transactions on Mathematical Software, 1995
- The Accurate Numerical Inversion of Laplace TransformsIMA Journal of Applied Mathematics, 1979