Fast Summation by Interval Clustering for an Evolution Equation with Memory

From MaRDI portal
Publication:4908652

DOI10.1137/120870505zbMATH Open1276.65059arXiv1203.4032OpenAlexW2012631548MaRDI QIDQ4908652FDOQ4908652

William Mclean

Publication date: 6 March 2013

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

Abstract: We solve a fractional diffusion equation using a piecewise-constant, discontinuous Galerkin method in time combined with a continuous, piecewise-linear finite element method in space. If there are N time levels and M spatial degrees of freedom, then a direct implementation of this method requires O(N2M) operations and O(NM) active memory locations, owing to the presence of a memory term: at each time step, the discrete evolution equation involves a sum over emph{all} previous time levels. We show how the computational cost can be reduced to O(MNlogN) operations and O(MlogN) active memory locations.


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




Recommendations





Cited In (33)





This page was built for publication: Fast Summation by Interval Clustering for an Evolution Equation with Memory

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