- Journal Home
- Volume 22 - 2025
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
In this work, we consider a new fractional derivative with nonsingular kernel introduced by Caputo–Fabrizio (CF) and propose a finite difference method for computing the CF fractional derivatives. Based on an iterative technique, we can reduce the computational complexity from $O$($J$2$N$) to $O$($JN$), and the corresponding storage will be cut down from $O$($JN$) to $O$($N$), which makes the computation much more efficient. Besides, by adopting piece-wise Lagrange polynomials of degrees 1, 2, and 3, we derive the second, third, and fourth order discretization formulas respectively. The error analysis and numerical experiments are carefully provided for the validation of the accuracy and efficiency of the presented method.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/13647.html} }In this work, we consider a new fractional derivative with nonsingular kernel introduced by Caputo–Fabrizio (CF) and propose a finite difference method for computing the CF fractional derivatives. Based on an iterative technique, we can reduce the computational complexity from $O$($J$2$N$) to $O$($JN$), and the corresponding storage will be cut down from $O$($JN$) to $O$($N$), which makes the computation much more efficient. Besides, by adopting piece-wise Lagrange polynomials of degrees 1, 2, and 3, we derive the second, third, and fourth order discretization formulas respectively. The error analysis and numerical experiments are carefully provided for the validation of the accuracy and efficiency of the presented method.