## Abstract

The computational work and storage of numerically solving the time fractional PDEs are generally huge for the traditional direct methods since they require total memory and work, where NT and NS represent the total number of time steps and grid points in space, respectively. To overcome this difficulty, we present an efficient algorithm for the evaluation of the Caputo fractional derivative of order α(0,1). The algorithm is based on an efficient sum-of-exponentials (SOE) approximation for the kernel t 1-α on the interval [Δt, T] with a uniform absolute error. We give the theoretical analysis to show that the number of exponentials N exp needed is of order for T1 or for TH1 for fixed accuracy. The resulting algorithm requires only storage and work when numerically solving the time fractional PDEs. Furthermore, we also give the stability and error analysis of the new scheme, and present several numerical examples to demonstrate the performance of our scheme.

Original language | English (US) |
---|---|

Pages (from-to) | 650-678 |

Number of pages | 29 |

Journal | Communications in Computational Physics |

Volume | 21 |

Issue number | 3 |

DOIs | |

State | Published - Mar 1 2017 |

## All Science Journal Classification (ASJC) codes

- Physics and Astronomy (miscellaneous)

## Keywords

- Caputo derivative
- Fractional derivative
- fast convolution algorithm
- fractional diffusion equation
- stability analysis
- sum-of-exponentials approximation