Adaptive, Fast and Oblivious Convolution in Evolution Equations with Memory

2006/11/07 by López-Fernández, María, Lubich, Christian, Schädle, Achim
#65M99 #65R20 #FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.math/0611168

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²) 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ödinger equation with concentrated nonlinearity, chemical reactions with inhibited diffusion, and viscoelasticity with a fractional order constitutive law.

Related

• Fast Summation by Interval Clustering for an Evolution Equation with Memory
• Adaptive multiresolution schemes with local time stepping for two-dimensional degenerate reaction-diffusion systems
• Sequence to sequence AE-ConvLSTM network for modelling the dynamics of PDE systems
• Fast and scalable computation of shape-morphing nonlinear solutions with application to evolutional neural networks
• CALM-PDE: Continuous and Adaptive Convolutions for Latent Space Modeling of Time-dependent PDEs