Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fast algorithms for convolution quadrature of Riemann-Liouville fractional derivative

Published 16 Jan 2019 in math.NA and cs.NA | (1901.05128v1)

Abstract: Recently, the numerical schemes of the Fokker-Planck equations describing anomalous diffusion with two internal states have been proposed in [Nie, Sun and Deng, arXiv: 1811.04723], which use convolution quadrature to approximate the Riemann-Liouville fractional derivative; and the schemes need huge storage and computational cost because of the non-locality of fractional derivative and the large scale of the system. This paper first provides the fast algorithms for computing the Riemann-Liouville derivative based on convolution quadrature with the generating function given by the backward Euler and second-order backward difference methods; the algorithms don't require the assumption of the regularity of the solution in time, while the computation time and the total memory requirement are greatly reduced. Then we apply the fast algorithms to solve the homogeneous fractional Fokker-Planck equations with two internal states for nonsmooth data and get the first- and second-order accuracy in time. Lastly, numerical examples are presented to verify the convergence and the effectiveness of the fast algorithms.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.