期刊
AIMS MATHEMATICS
卷 5, 期 3, 页码 1729-1744出版社
AMER INST MATHEMATICAL SCIENCES-AIMS
DOI: 10.3934/math.2020117
关键词
Caputo-Fabrizio fractional derivative; novel approximation formula; fast algorithm; second-order convergence rate; computing complexity
资金
- National Natural Science Fund [11661058, 11761053]
- Natural Science Fund of Inner Mongolia Autonomous Region [2017MS0107]
- program for Young Talents of Science, and Technology in Universities of the Inner Mongolia Autonomous Region [NJYT-17-A07]
In this study, we propose a novel second-order numerical formula that approximates the Caputo-Fabrizio (CF) fractional derivative at node t(k+1/2). The nonlocal property of the CF fractional operator requires O(M-2) operations and O(M) memory storage, where M denotes the numbers of divided intervals. To improve the efficiency, we further develop a fast algorithm based on the novel approximation technique that reduces the computing complexity from O(M-2) to O(M), and the memory storage from O(M) to O(1). Rigorous arguments for convergence analyses of the direct method and fast method are provided, and two numerical examples are implemented to further confirm the theoretical results and efficiency of the fast algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据