Efficient computation of the Grunwald-Letnikov fractional diffusion derivative using adaptive time step memory

Abstract

Computing numerical solutions to fractional differential equations can be computationally intensive due to the effect of non-local derivatives in which all previous time points contribute to the current iteration. In general, numerical approaches that depend on truncating part of the system history while efficient, can suffer from high degrees of error and inaccuracy. Here we present an adaptive time step memory method for smooth functions applied to the Grunwald-Letnikov fractional diffusion derivative. This method is computationally efficient and results in smaller errors during numerical simulations. Sampled points along the system history at progressively longer intervals are assumed to reflect the values of neighboring time points. By including progressively fewer points backward in time, a temporally weighted history is computed that includes contributions from the entire past of the system, maintaining accuracy, but with fewer points actually calculated, greatly improving computational efficiency.

25 pages; in press in The Journal of Computational Physics

References in corpus (1)

• Matrix approach to discrete fractional calculus II: partial fractional differential equations

Cited by in corpus (5)

• Trends, Directions for Further Research, and Some Open Problems of Fractional Calculus
• An adaptive memory method for accurate and efficient computation of the Caputo fractional derivative
• Effective diffusion coefficients in reaction-diffusion systems with anomalous transport
• Stability and Complexity Analyses of Finite Difference Algorithms for the Time-Fractional Diffusion Equation
• Grünwald--Letnikov Memory Truncation in a Fractional Duffing Oscillator: Coherence Loss and Effective Delay Complexity