Adaptive, Fast, and Oblivious Convolution in Evolution Equations with Memory

From MaRDI portal
Publication:3617201

DOI10.1137/060674168zbMATH Open1160.65356arXivmath/0611168OpenAlexW2018348423MaRDI QIDQ3617201FDOQ3617201


Authors: María López-Fernández, Christian Lubich, Achim Schädle Edit this on Wikidata


Publication date: 27 March 2009

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize 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 blow-up example originating from a Schr"odinger equation with concentrated nonlinearity, chemical reactions with inhibited diffusion, and viscoelasticity with a fractional order constitutive law.


Full work available at URL: https://arxiv.org/abs/math/0611168




Recommendations





Cited In (50)

Uses Software





This page was built for publication: Adaptive, Fast, and Oblivious Convolution in Evolution Equations with Memory

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