Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T10:03:28.867Z Has data issue: false hasContentIssue false

Fast Evaluation of the Caputo Fractional Derivative and its Applications to Fractional Diffusion Equations

Published online by Cambridge University Press:  07 February 2017

Shidong Jiang*
Affiliation:
Department of Mathematical Sciences, New Jersey Institute of Technology, Newark, NJ 07102, USA
Jiwei Zhang*
Affiliation:
Beijing Computational Science Research Center, Beijing 100093, China
Qian Zhang*
Affiliation:
Beijing Computational Science Research Center, Beijing 100093, China
Zhimin Zhang*
Affiliation:
Beijing Computational Science Research Center, Beijing 100093, ChinaDepartment of Mathematics, Wayne State University, Detroit, MI 48202, USA
*
*Corresponding author. Email addresses:shidong.jiang@njit.edu (S. Jiang), jwzhang@csrc.ac.cn (J. Zhang), qianzhang@csrc.ac.cn (Q. Zhang), zmzhang@csrc.ac.cn (Z. Zhang)
*Corresponding author. Email addresses:shidong.jiang@njit.edu (S. Jiang), jwzhang@csrc.ac.cn (J. Zhang), qianzhang@csrc.ac.cn (Q. Zhang), zmzhang@csrc.ac.cn (Z. Zhang)
*Corresponding author. Email addresses:shidong.jiang@njit.edu (S. Jiang), jwzhang@csrc.ac.cn (J. Zhang), qianzhang@csrc.ac.cn (Q. Zhang), zmzhang@csrc.ac.cn (Z. Zhang)
*Corresponding author. Email addresses:shidong.jiang@njit.edu (S. Jiang), jwzhang@csrc.ac.cn (J. Zhang), qianzhang@csrc.ac.cn (Q. Zhang), zmzhang@csrc.ac.cn (Z. Zhang)

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 T≫1 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.

Information

Type
Research Article
Copyright
Copyright © Global-Science Press 2017