Next Article in Journal
Prediction of Uniaxial Compressive Strength in Rocks Based on Extreme Learning Machine Improved with Metaheuristic Algorithm
Previous Article in Journal
Instability of Viscoelastic Liquid Sheets in a Transverse Electric Field
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Modified Three-Point Fractional Formulas with Richardson Extrapolation

1
Department of Mathematics, Faculty of Science and Technology, Irbid National University, Irbid 2600, Jordan
2
Nonlinear Dynamics Research Center (NDRC), Ajman University, Ajman 346, United Arab Emirates
3
Department of Mathematics, Al Al-Bayt University, Mafraq 25113, Jordan
4
Department of Mathematics and Computer Science, University of Larbi Ben M’hidi, Oum El Bouaghi 04000, Algeria
5
Department of Mathematics, The University of Jordan, Amman 11942, Jordan
6
Department of Mathematics, Faculty of Science, Zarqa University, Zarqa 13110, Jordan
*
Authors to whom correspondence should be addressed.
Submission received: 22 August 2022 / Revised: 5 September 2022 / Accepted: 13 September 2022 / Published: 24 September 2022
(This article belongs to the Section Functional Interpolation)

Abstract

:
In this paper, we introduce new three-point fractional formulas which represent three generalizations for the well-known classical three-point formulas; central, forward and backward formulas. This has enabled us to study the function’s behavior according to different fractional-order values of α numerically. Accordingly, we then introduce a new methodology for Richardson extrapolation depending on the fractional central formula in order to obtain a high accuracy for the gained approximations. We compare the efficiency of the proposed methods by using tables and figures to show their reliability.

1. Introduction

The differential equations with non-integer order derivatives are used to represent the dynamical system, called the fractional-order system. In general, fractional-order dynamics (FoD) is used to describe most practical systems; we can consider a special case for the system called the integer-order representation. We recommend the article in [1,2,3], since it discusses several fractional-order dynamical system problems. In 1675, Issac Newton found the interpolation formula, which was subsequently named after J. L. Lagrange (1736–1813), but it first appeared in 1779, presented by Edward Waring (1736–1798). The interpolation method was mainly studied and written by Lagrange, and his works had a substantial influence on mathematicians in the future. This result was published in 1795. The Lagrange polynomials were studied by Axelsson, O. and V. A. Barker in [4], where they found an explicit representation for it and the error when approximating a function on an interval. These polynomials are frequently used for interpolating tabular data. Note that, in similar cases, the explicit representation of the polynomial is not essential, only the values of the polynomial at specified points are required. Additionally, if the data function is unknown, we cannot use the explicit form. In 1932, E. H. Neville gave in his paper a modification of the Lagrange formula, Neville’s Method. The application of the error term to Lagrange interpolation poses a practical challenge; because of this, it is typically unknown what degree of the polynomial is required for the necessary precision until computations have been made. It is customary to compute the results using different polynomials until the desired agreement is attained. As in many areas, Isaac Newton is prominent in studying differential equations. In 1675, he developed interpolation formulas through means using his notation Δ in tables of differences. He produced explicit examples by taking a very general approach to the different formulas, including Lagrange’s formulas, which are called by several other names. Consider that f C n [ a , b ] and x 0 , x 1 , , x n are distinct numbers in [a,b]. Then, a number ξ exists in (a,b) with
f [ x 0 , x 1 , , x n ] = f ( n ) ( ξ ) n ! .
A. Aitken applied the following method in 1926 to accelerate a series rate of convergence in his paper [5], Aitken’s method is based on the assumption that the sequence { P ^ n } n = 0 , defined by
P ^ n = P n ( P n + 1 P n ) 2 P n + 2 2 P n + 1 + P n ,
converges more rapidly to P than does the original sequence { P n } n = 0 ; the procedure for this method is similar to that used by the Japanese mathematician T. S. Kowa. The forward difference notation D e l t a developed by Aitken’s D e l t a 2 approach was used to build the Newton forward-difference formula. With this notation,
f [ x 0 , x 1 ] = f ( x 1 ) f ( x 0 ) x 1 x 0 = 1 h ( f ( x 1 ) f ( x 0 ) ) = 1 h Δ f ( x 0 ) ,
f [ x 0 , x 1 , x 2 ] = 1 2 h Δ f ( x 1 ) Δ f ( x 0 ) h = 1 2 h 2 Δ 2 f ( x 0 ) ,
and, in general,
f [ x 0 , x 1 , , x k ] = 1 k ! h k Δ k f ( x 0 ) .
Then, the Newton forward-difference formula is given by the following:
P n ( x ) = f ( x 0 ) + k = 1 n s k Δ k f ( x 0 ) .
The Newton backward-difference formula is given by the following:
P n ( x ) = f [ x n ] + k = 1 n ( 1 ) k s k k f ( x n ) .
Note that if we take the function f ( x ) when x lies near the center of the table, then the Newton backward-difference and forward-difference formulas are inappropriate because neither will allow x 0 to be close to x for the highest-order difference. Several divided-difference formulas can be employed in this case, and each one has specific circumstances where it works well. These procedures are referred to as “centered-difference formulas”. We focus on Stirling’s method and consider only one centered difference formula by choosing x 0 near the point being approximated and by labeling the nodes directly below x 0 as x 1 , x 2 , and those directly above as x 1 , x 2 , . With this convention, Stirling’s formula is given by the following [6]:
P n ( x ) = P 2 m + 1 ( x ) = f [ x 0 ] + s h 2 ( f [ x 1 , x 0 ] + f [ x 0 , x 1 ] ) + s 2 h 2 f [ x 1 , x 0 , x 1 ] s ( s 2 1 ) h 3 2 ( f [ x 2 , x 1 , x 0 , x 1 ] + f [ x 1 , x 0 , x 1 , x 2 ] ) + + s 2 ( s 2 1 ) ( s 2 4 ) ( s 2 ( m 1 ) 2 ) h 2 m f [ x m , , x m ] + s ( s 2 1 ) ( s 2 m 2 ) h 2 m + 1 2 ( f [ x m 1 , , x m ] + f [ x m , , x m + 1 ] ) ,
if n = 2 m + 1 is odd. If n = 2 m is even, we use the same formula but delete the last line. In the last quarter of the 17th century, Isaac Newton used and popularized the difference equations, and T. Harriot and H. Briggs developed many of these techniques. The navigation techniques were studied by T. Harriot and saw significant advances. H. Briggs was the most responsible for accepting logarithms as an aid to computation. One of the classical techniques is Richardson extrapolation (RE); see [1,2], which depends on a small parameter to accelerate the convergence of numerical sequences by eliminating the lowest order error term ( s ) from the corresponding asymptotic expansion. When the sequence is generated by a numerical method, resolving the initial-value problem
y ( t ) = f ( t , y ( t ) ) , y ( t 0 ) = y 0 ,
the discretization step size h > 0 can be selected as the parameter in RE. The application of RE to one-step sequences, such as Runge–Kutta methods, are described, for example, in [7,8]. In [9], global (also known as passive) or local (active) versions of RE are implemented with Runge–Kutta sequences. These integrated methods can be used to solve air pollution issues [10] or to improve machine learning [11]. For an overview of real systems (e.g., physical and biological systems) where fractional derivatives are suitable to describe their dynamics, see [12,13,14]; in the article [15], in order to describe the behavior of porous electrodes, the authors presented a method for electrochemical capacitor quality management using fractional order models. For more applications on fractional order differential equations see [16,17,18,19,20,21].
The organization of this paper is arranged as follows: Section 2 aims to recall some basic facts and definitions connected with fractional calculus. Section 3 demonstrates the main results of this work so that it contains the definition of the modified three-point fractional formulas. Section 4 develops the classical Richardson extrapolation to be valid for fractional calculus. Section 5 illustrates numerical results that confirm the theoretical findings of this work, followed by the final section that summarizes the conclusion.

2. Preliminaries

In this section, basic definitions and theorems such as the Riemann–Liouville integral and derivative, the Caputo derivative, etc. are introduced with their references.
Definition 1
([22]). The fractional integral of a function f(Y,t) ∈ C δ ( δ 1 ) and of order μ > 0 initially defined by Riemann–Liouville is presented as follows:
J μ f ( Y , t ) = 1 Γ ( μ ) 0 t f ( Y , τ ) ( t τ ) μ 1 d τ , t > 0 , μ > 0 ,
where Y = ( x 1 , x 2 , x 3 , , x n ) is a vector of n variables.
Some of the properties of the Riemann–Liouville integral are as follows:
( 1 ) J 0 f ( Y , t ) = f ( Y , t ) .
( 2 ) J μ t γ = Γ ( γ + 1 ) t α + γ Γ ( α + γ + 1 ) γ 1 .
( 3 ) J μ J β f ( Y , t ) = J β J μ f ( Y , t ) α , β 0 .
( 4 ) J μ J β f ( Y , t ) = J μ + β f ( Y , t ) α , β 0 .
Definition 2
([15]). The Caputo time fractional derivative of order α > 0 with m being a small number greater than α is defined as follows:
D t α f ( Y , t ) = 1 Γ ( n α ) 0 t ( t τ ) α + n 1 m f ( Y , τ ) τ m d τ , m 1 < α < m m f ( Y , t ) t m , α = m
where Y = ( x 1 , x 2 , x 3 , , x n ) is a vector of n variables and for n 1 < α n , n N , t > 0 , f(Y,t) is a real value function while the parameter α is the order of the derivative.
Some of the characteristics of the Caputo derivative are listed below:
(1) D t α c = 0 , where c is constant.
(2)
D t α t ρ = Γ ( ρ + 1 ) Γ ( ρ α + 1 ) t ρ α : ρ > α 1 0 : O t h e r w i s e
(3) D t α is linear, i.e.,
D t α ( μ f ( Y , t ) + ω k ( Y , t ) ) = μ D t α ( f ( Y , t ) ) + ω D t α ( k ( t ) ) ,
where μ and ω are constant.
Additionally, we need two of its basic properties. If n 1 < α n , n N , then
D α J α f ( x ) = f ( x ) , J α D α f ( x ) = f ( x ) i = 1 n f i ( 0 + ) x i i ! , x > 0 .
Definition 3
([6]). The Riemann—Liouville fractional derivative. The fractional derivative can be defined using the definition of the fractional integral. To this end, suppose that v = n u , where 0 < v < 1 and n is the smallest integral greater than u. Then, the fractional derivative of f ( x ) of the order u is
D u f ( x ) = D n [ D v f ( x ) ] .
Definition 4
([6]). The linear Lagrange interpolating polynomial through ( x 0 , y 0 ) and ( x 1 , y 1 ) , where
L 0 ( x ) = x x 1 x 0 x 1 a n d L 1 ( x ) = x x 0 x 1 x 0 ,
is
P ( x ) = L 0 ( x ) f ( x 0 ) + L 1 ( X ) f ( x 1 ) = x x 1 x 0 x 1 f ( x 0 ) + x x 0 x 1 x 0 f ( x 1 ) .
Note that
L 0 ( x 0 ) = 1 , L 0 ( x 1 ) = 0 , L 1 ( x 0 ) = 0 , L 1 ( x 1 ) = 1 ,
which implies that
P ( x 0 ) = 1 · f ( x 0 ) + 0 · f ( x 1 ) = f ( x 0 ) = y 0
and
P ( x 1 ) = 0 · f ( x 0 ) + 1 · f ( x 1 ) = f ( x 1 ) = y 1 .
Therefore, P is a unique polynomial with a degree of, at most, one that passes through ( x 0 , y 0 ) and ( x 1 , y 1 ) .
Theorem 1
([6]). Consider x 0 , x 1 , …, x n as n + 1 distinct numbers to define the nth Lagrange interpolating polynomial, where the values of the function f are provided by these numbers, with the one with the highest degree n existing with
f ( x k ) = p ( x k ) ,
for each k = 0 , 1 , , n . This polynomial is given by the following:
p ( x ) = f ( x 0 ) L n , 0 ( x ) + + f ( x n ) L n , n ( x ) = k = 0 n f ( x k ) L n , k ( x ) ,
where, for each k = 0 , 1 , , n ,
L n , k ( x ) = ( x x 0 ) ( x x 1 ) ( x x k 1 ) ( x x k + 1 ) ( x x n ) ( x k x 0 ) ( x k x 1 ) ( x k x k 1 ) ( x k x k + 1 ) ( x K x n ) ,
i = 0 i k n ( x x i ) ( x k x i ) .
We write L n , k ( x ) simply as L k ( x ) when there is no confusion as to its degree.
Theorem 2
([6]). The interval [ a , b ] contains the following distinct numbers x 0 , x 1 , , x n and f C n + 1 [ a , b ] . Then, for each x in [ a , b ] , a number ξ ( x ) (generally unknown) between x 0 , x 1 , , x n and hence in ( a , b ) , exists with
f ( x ) = P ( x ) + f ( n + 1 ) ( ξ ( x ) ) ( n + 1 ) ! ( x x 0 ) ( x x 1 ) ( x x n ) ,
where P ( x ) is the interpolating polynomial given in (11).

3. Fractional Central Formula

We introduce in this section the fractional central formula to study the function’s behavior according to different numerical or fractional values of α .
Theorem 3.
Suppose that x 0 , x 1 , and x 2 are distinct points in the interval [ a , b ] and f C 2 + 1 [ a , b ] . Then, for each x [ a , b ] , a point ξ ( x ) (generally unknown) within x 0 , x 1 , and x 2 and, hence, in ( a , b ) exists with a = x 0 < x 1 = x 0 + h < x 2 = x 0 + 2 h = b and h > 0 , so that, by Theorem (2), we have the following:
D α f ( x ) = x 2 α h 2 Γ ( 3 α ) ( f ( x 0 ) 2 f ( x 1 ) + f ( x 2 ) ) x 1 α 2 h 2 Γ ( 2 α ) ( f ( x 0 ) ( x 1 + x 2 ) 2 f ( x 1 ) ( x 0 + x 2 ) + f ( x 2 ) ( x 0 + x 1 ) + f ( 3 ) ( ξ ) 6 ( 6 x 3 α Γ ( 4 α ) 2 ( x 0 + x 1 + x 2 ) Γ ( 3 α ) x 2 α + ( x 0 x 1 + x 0 x 2 + x 1 x 2 ) Γ ( 2 α ) x 1 α ) .
Proof. 
In general, f ( x k ) = P ( x k ) for each k = 0 , 1 , 2 , , n . This polynomial is given by the following: P ( x ) = f ( x 0 ) L n , 0 ( x ) + + f ( x n ) L n , n ( x ) = k = 0 n f ( x k ) L n , k ( x ) , where for each k = 0 , 1 , 2 , , n , we have the following:
L n , k ( x ) = ( x x 0 ) ( x x 1 ) ( x x k 1 ) ( x x k + 1 ) ( x x n ) ( x k x 0 ) ( x k x 1 ) ( x k x k 1 ) ( x k x k + 1 ) ( x k x n ) .
Consider L n , k ( x ) as L k ( x ) throughout the paper when the degree is clear and unambiguous.
Then, we can write f ( x ) in general form as follows:
f ( x ) = k = 0 m f ( x k ) L k ( x ) + ( x x 0 ) ( x x n ) ( n + 1 ) ! f ( ξ ( x ) ) n + 1 .
For n = 2, we have the following:
f ( x ) = k = 0 2 f ( x k ) L k ( x ) + ( x x 0 ) ( x x 1 ) ( x x 2 ) 3 ! f ( 3 ) ( ξ ( x ) ) .
By simplifying the summation, we have the following:
f ( x ) = f ( x 0 ) L 0 ( x ) + f ( x 1 ) L 1 ( x ) + f ( x 2 ) L 2 ( x ) + 1 6 f ( 3 ) ( ξ ( x ) ) ( x x 0 ) ( x x 1 ) ( x x 2 ) .
By using (13), we have the following:
f ( x ) = f ( x 0 ) ( x x 1 ) ( x x 2 ) ( x 0 x 1 ) ( x 0 x 2 ) + f ( x 1 ) ( x x 0 ) ( x x 2 ) ( x 1 x 0 ) ( x 1 x 2 ) + f ( x 2 ) ( x x 0 ) ( x x 1 ) ( x 2 x 0 ) ( x 2 x 1 ) + 1 6 f ( 3 ) ( ξ ( x ) ) ( x x 0 ) ( x x 1 ) ( x x 2 ) .
Pull out the common factors:
f ( x ) = f ( x 0 ) ( x 0 x 1 ) ( x 0 x 2 ) ( x 2 ( x 1 + x 2 ) x + x 1 x 2 ) + f ( x 1 ) ( x 1 x 0 ) ( x 1 x 2 ) ( x 2 ( x 0 + x 2 ) x + x 0 x 2 ) + f ( x 2 ) ( x 2 x 0 ) ( x 2 x 1 ) ( x 2 ( x 0 + x 1 ) x + x 0 x 1 ) + f ( 3 ) ( ξ ( x ) ) 6 ( x x 0 ) ( x x 1 ) ( x x 2 ) .
By using x 1 = x 0 + h and x 2 = x 0 + 2 h , we can write f ( x ) with respect to h:
f ( x ) = f ( x 0 ) ( h ) ( 2 h ) ( x 2 ( x 1 + x 2 ) x + x 1 x 2 ) + f ( x 1 ) ( h ) ( h ) ( x 2 ( x 0 + x 2 ) x + x 0 x 2 ) + f ( x 2 ) ( h ) ( 2 h ) ( x 2 ( x 0 + x 1 ) x + x 0 x 1 ) + f ( 3 ) ( ξ ( x ) ) 6 ( x 3 ( x 0 + x 1 + x 2 ) x 2 + ( x 0 x 1 + x 0 x 2 + x 1 x 2 ) x x 0 x 1 x 2 ) .
The Caputo time fractional derivative can be defined for f ( x ) by (2):
D α f ( x ) = f ( x 0 ) 2 h 2 Γ ( 2 + 1 ) x 2 α Γ ( α + 2 + 1 ) ( x 1 + x 2 ) Γ ( 1 + 1 ) x 1 α Γ ( α + 1 + 1 ) + 0 + f ( x 1 ) h 2 Γ ( 2 + 1 ) x 2 α Γ ( α + 2 + 1 ) ( x 0 + x 2 ) Γ ( 1 + 1 ) x 1 α Γ ( α + 1 + 1 ) + 0 + f ( x 2 ) 2 h 2 Γ ( 2 + 1 ) x 2 α Γ ( α + 2 + 1 ) ( x 0 + x 1 ) Γ ( 1 + 1 ) x 1 α Γ ( α + 1 + 1 ) + 0 + f ( 3 ) ( ξ ) σ Γ ( 3 + 1 ) x 3 α Γ ( α + 3 + 1 ) ( x 0 + x 1 + x 2 ) Γ ( 2 + 1 ) x 2 α Γ ( α + 2 + 1 ) ( x 0 x 1 + x 2 x 1 + x 0 x 2 ) Γ ( 1 + 1 ) x 1 α Γ ( α + 1 + 1 ) + 0 .
Simplify the formula.
D α f ( x ) = f ( x 0 ) 2 h 2 [ 2 Γ ( 3 α ) x 2 α ( x 1 + x 2 ) Γ ( 2 α ) x 1 α ] f ( x 1 ) h 2 [ 2 Γ ( 3 α ) x 2 α ( x 0 + x 2 ) Γ ( 2 α ) x 1 α + f ( x 2 ) 2 h 2 [ 2 x 2 α Γ ( 3 α ) ( x 0 + x 1 ) Γ ( 2 α ) x 1 α ] + f ( 3 ) ( ξ ) 6 6 Γ ( 4 α ) x 3 α 2 ( x 0 + x 1 + x 2 ) Γ ( 3 α ) x 2 α + ( x 0 x 1 + x 0 x 2 + x 1 x 2 Γ ( 2 α ) x 1 α .
Consequently, the formula can be expressed as follows:
D α f ( x ) = f ( x 0 ) ( 2 h 2 ) ( 2 x 2 α ) Γ ( 3 α ) ( f ( x 1 ) ) h 2 ( 2 x 2 α ) Γ ( 3 α ) + f ( x 2 ) 2 h 2 ( 2 x 2 α ) Γ ( 3 α ) ( f ( x 0 ) ) ( 2 h 2 ) ( ( x 1 + x 2 ) x 1 α ) Γ ( 2 α ) + ( f ( x 1 ) ) h 2 ( ( x 0 + x 2 ) x 1 α ) Γ ( 2 α ) ( f ( x 2 ) ) ( 2 h 2 ) ( ( x 0 + x 1 ) x 1 α ) Γ ( 2 α ) f ( 3 ) ( ξ ) 6 [ 6 x 3 α Γ ( 4 α ) ( x 0 + x 1 + x 2 ) ( 2 x 2 α ) Γ ( 3 α ) + ( x 0 x 1 + x 2 x 1 + x 0 x 2 ) x 1 α Γ ( 2 α ) .
Finally, we obtain the final form:
D α f ( x ) = x 2 α h 2 Γ ( 3 α ) ( f ( x 0 ) 2 f ( x 1 ) + f ( x 2 ) ) x 1 α 2 h 2 Γ ( 3 α ) ( f ( x 0 ) ( x 1 + x 2 ) 2 f ( x 1 ) ( x 0 + x 2 ) + f ( x 2 ) ( x 0 + x 1 ) ) + f ( 3 ) ( ξ ) 6 6 x 3 α Γ ( 4 α ) 2 ( x 0 + x 1 + x 2 ) Γ ( 3 α ) x 2 α + ( x 0 x 1 + x 0 x 2 + x 1 x 2 ) Γ ( 2 α ) .
Lemma 1.
From Theorem (3), we can obtain the classical central formula in the general form given by the following:
f ( x 1 ) = f ( x 2 ) f ( x 0 ) 2 h h 2 6 f ( 3 ) ( ξ ) .
Proof. 
To obtain the central formula from Theorem (3), let x = x 1 ; then, we have the following:
D α f ( x 1 ) = x 1 2 α h 2 Γ ( 3 α ) f ( x 0 ) 2 f ( x 1 ) + f ( x 2 ) x 1 1 α 2 h 2 Γ ( 2 α ) f ( x 0 ) ( x 1 + x 2 ) 2 f ( x 1 ) ( x 0 + x 2 ) + f ( x 2 ) ( x 0 + x 1 ) + f ( 3 ) ( ξ ) 6 6 x 1 3 α Γ ( 4 α ) 2 ( x 0 + x 1 + x 2 ) Γ ( 3 α ) x 1 2 α + ( x 0 x 1 + x 0 x 2 + x 1 x 2 ) Γ ( 2 α ) x 1 1 α ,
By applying the power rule for the Caputo derivative, we have the following:
f ( x ) = x 1 h 2 Γ ( 2 ) ( f ( x 0 ) + 2 f ( x 1 ) + f ( x 2 ) ) 1 2 h 2 ( f ( x 0 ) ( x 1 + x 2 ) + 2 f ( x 1 ) ( x 0 + x 2 ) + f ( x 2 ) ( x 0 + x 1 ) ) + f ( 3 ) ( ξ ) 6 [ 6 x 1 2 2 2 ( x 0 + x 1 + x 2 ) + x 0 x 1 + x 2 x 1 + x 0 x 2 ] .
Consequently,
f ( x ) = 1 h 2 ( x 1 f ( x 0 ) + 2 x 1 f ( x 1 ) + x 1 f ( x 2 ) ) 1 2 x 1 f ( x 0 ) 1 2 x 2 f ( x 0 ) + x 0 f ( x 1 ) + x 2 f ( x 1 ) 1 2 x 0 f ( x 2 ) 1 2 x 1 f ( x 2 ) + f ( 3 ) ( ξ ) 6 [ 3 x 1 2 2 x 0 x 1 2 x 1 2 2 x 2 x 1 + x 0 x 1 + x 2 x 1 + x 0 x 2 ] ,
By substituting x = x 1 , we have the following:
f ( x 1 ) = 1 h 2 1 2 x 1 f ( x 0 ) 2 x 1 f ( x 1 ) + 1 2 x 1 f ( x 2 ) 1 2 x 2 f ( x 0 ) + x 0 f ( x 1 ) + x 2 f ( x 1 ) 1 2 x 0 f ( x 2 ) + f ( 3 ) ( ξ ) 6 x 1 2 x 0 x 1 x 1 x 2 + x 0 x 2 .
Consequently,
f ( x 1 ) = 1 h 2 [ 1 2 x 1 f ( x 0 ) + 2 f ( x 1 ) [ 2 x 1 + x 0 + x 2 ] + 1 2 x 1 f ( x 2 ) 1 2 x 2 f ( x 0 ) 1 2 x 0 f ( x 2 ) + f ( 3 ) ( ξ ) 6 [ x 1 2 x 0 x 1 x 1 x 2 + x 0 x 2 ] ] ,
Simplify:
f ( x 1 ) = 1 h 2 1 2 f ( x 0 ) ( x 1 x 2 ) + 1 2 f ( x 2 ) ( x 1 x 0 ) + f ( 3 ) ( ξ ) 6 ( x 1 x 0 ) ( x 1 x 2 ) ,
Finally, we have the following:
f ( x 1 ) = 1 h 2 [ h 2 f ( x 0 ) + h 2 f ( x 2 ) ] + f ( 3 ) ( ξ ) 6 ( h ) ( h ) .
Then, we have the central series:
f ( x 1 ) = f ( x 2 ) f ( x 0 ) 2 h + h 2 6 f ( 3 ) ( ξ ) .
Remark 1.
Note that if we let x = x 0 in the Theorem (3), we obtain the classical form of the forward formula in the same way as in Lemma (1).
Remark 2.
Note that if we let x = x 2 in the Theorem (3), we obtain the classical form of the backward formula the same way as in Lemma (1).

4. Richardson Extrapolation

To obtain high-accuracy results for low-order formulas, we use Richardson’s extrapolation. For more about the history and applications of Richardson’s extrapolation method, we recommend the article by Joyce, D. C. [23]. In this section, we introduce our methodology for Richardson extrapolation depending on our fractional central form [21]. Depending on the modified central formula [21], for x [ a , b ] , assume that α = 1 and, without losing generality, we have the following:
f ( x ) = f ( x + h ) f ( x h ) 2 h h 2 6 f ( 3 ) ( ξ ) .
Note that we denote f ( x ) as R v , f ( x + h ) f ( x h ) 2 h as S v ( h ) and c = f ( 3 ) ( ξ ) 6 . Then, we obtain the following equation:
R v = ( S v ) ( h ) + c h 2 .
If we substitute h 2 instead of h in (17), we have the following:
R v = ( S v ) h 2 + c h 2 2 .
By simplifying the previous equation and substituting with ( 4 ) , we have the following:
4 ( R v = ( A v ) h 2 + 1 4 c h 2 ) .
By subtracting (18) from (17), we have the following:
3 R v = ( S v ) ( h ) ( S v ) ( h 2 ) 3 ( S v ) ( h 2 ) ,
then
R v = ( S v ) h 2 + ( S v ) ( h 2 ) ( A v ) ( h ) 3 .
Suppose that R v = M 2 ( h ) , M 1 ( h ) = ( S v ) ( h ) and N 1 h 2 . We obtain the following from that:
M 2 ( h ) = M 1 h 2 + M 1 ( h 2 ) M 1 ( h ) 3 .
If we continue in the same way, we obtain the following Table 1, which illustrates how we can use Richardson’s extrapolation to build a fourth-order approximation, using four first-order approximations:
Consider for M 1
M 1 ( h ) = f ( x + h ) f ( x h ) 2 h ,
M 1 ( h 2 ) = f ( x + h 2 ) f ( x h 2 ) h ,
M 1 ( h 4 ) = f ( x + h 4 ) f ( x h 4 ) h 2 ,
M 1 ( h 8 ) = f ( x + h 8 ) f ( x h 8 ) h 4 .
Consider for M 2
M 2 ( h ) = M 1 ( h 2 ) + M 1 ( h 2 ) M 1 ( h ) 3 ,
M 2 ( h 2 ) = M 1 ( h 4 ) + M 1 ( h 4 ) M 1 ( h 2 ) 3 ,
M 2 ( h 4 ) = M 1 ( h 8 ) + M 1 ( h 8 ) M 1 ( h 4 ) 3 .
Consider for M 3
M 3 ( h ) = M 2 ( h 2 ) + M 2 ( h 2 ) M 2 ( h ) 15 ,
M 3 ( h 2 ) = M 2 ( h 4 ) + M 2 ( h 4 ) M 2 ( h 2 ) 15 .
Consider that for M 4 :
M 4 ( h ) = M 3 ( h 2 ) + M 3 ( h 2 ) M 3 ( h ) 63 .
Performing this process further results for each i = 2 , 3 , , the Q ( h 2 i ) approximation becomes
M i ( h ) = M i 1 h 2 + M i 1 ( h 2 ) M i 1 ( h ) 4 i 1 1 .
Remark 3.
We can generalize the Q ( h 2 i ) approximation for the fractional case when α is fractional and can obtain the same result as (19).

5. Numerical Examples

In this section, we compare the efficiency between the fractional central formula and the Richardson extrapolation; tables and figures are used to present and compare the outcomes in order to demonstrate the validity of the suggested approaches.
Example 1.
Let the main function be f ( x ) = 4 x 2 2 x 15 , and consider α = 1 ; then, the Caputo derivative is given by the following:
f ( x ) = 4 Γ ( 3 ) Γ ( 2 ) x 2 Γ ( 2 ) Γ ( 1 ) .
Take the point of evaluation x 0 = 2 ; f ( 2 ) = 14 . Then, the exact values of the derivatives (the classical central formula) equal the Caputo derivative. By taking the step initial value h = 0.01 and the order of extrapolation N = 8 , we obtain the results shown in Table 2.
Consider the fractional case when α = 0.75 and for x 0 = 2 :
D 0.75 f ( 2 ) = 4 Γ ( 3 ) Γ ( 2.25 ) x 1.25 2 Γ ( 2 ) Γ ( 1.25 ) x 0.25 = 14.1697 ,
and the Richardson extrapolation in view of the fractional central formula formulated by using Caputo derivative as shown in Table 3.
We introduce the absolute error for Richardson extrapolation in Table 4 by tacking different values of α to see the efficiency of the proposed methods.
In what follows, we introduce (Figure 1) some graphical comparisons between the results generated using the analytical and fractional central formulas.
Example 2.
Let the main function f ( x ) = 1 4 x 3 8 x , and consider α = 1 ; then, the Caputo derivative is given by the following:
f ( x ) = 1 4 Γ ( 5 2 ) Γ ( 5 2 1 ) x 8 Γ ( 3 2 ) Γ ( 3 2 1 ) 1 x .
Take the point of evaluation x 0 = 1 2 : f ( 1 2 ) = 5.3917 ; then, the exact values of the derivatives (the classical central formula) equal the Caputo derivative. By taking the step initial value h = 0.01 and the order of extrapolation N = 8 , we get the results shown in Table 5.
Consider the fractional case when α = 0.98 and for x 0 = 1 2 :
D 0.98 f ( 1 2 ) = 1 4 Γ ( 5 2 ) Γ ( 5 2 0.98 ) x 3 2 0.98 8 Γ ( 3 2 ) Γ ( 3 2 0.98 ) x 1 2 0.98 = 5.5355 ,
and the Richardson extrapolation in view of the fractional central formula formulated by using Caputo derivative as shown in Table 6.
We introduce the absolute error for Richardson extrapolation in Table 7 by tacking different values of α to see the efficiency of the proposed methods.
In what follows, we introduce (Figure 2) some graphical comparisons between the results generated using the analytical and fractional central formulas.
Example 3.
Let the main function be f ( x ) = 1 x 2 2 ! + x 4 4 ! x 6 6 ! + x 8 8 ! x 1 0 10 ! , and consider α = 1 ; then, the Caputo derivative of the function is given by the following:
f ( x ) = Γ ( 3 ) Γ ( 2 ) 1 2 ! x + Γ ( 5 ) Γ ( 4 ) 1 4 ! x 3 Γ ( 7 ) Γ ( 6 ) 1 6 ! x 5 + Γ ( 9 ) Γ ( 8 ) 1 8 ! x 7 Γ ( 11 ) Γ ( 10 ) 1 10 ! x 9 .
Take the point of evaluation x 0 = π 6 : f ( π 6 ) = 0.5000 ; then, the exact values of the derivatives (the classical central formula) equal the Caputo derivative. By taking the step initial value h = 0.01 and the order of extrapolation N = 8 , we obtain the results shown in Table 8.
Consider the fractional case when α = 0.35 and for x 0 = π 6 :
D 0.35 f ( π 6 ) = Γ ( 3 ) Γ ( 3 0.35 ) 1 2 ! x 2 0.35 + Γ ( 5 ) Γ ( 5 0.35 ) 1 4 ! x 4 0.35 Γ ( 7 ) Γ ( 7 0.35 ) 1 6 ! x 6 0.35
+ Γ ( 9 ) Γ ( 9 0.35 ) 1 8 ! x 8 0.35 Γ ( 11 ) Γ ( 11 0.35 ) 1 10 ! x 10 0.35 = 0.2250 ,
and the Richardson extrapolation in view of the fractional central formula formulated by using Caputo derivative as shown in Table 9.
We introduce the absolute error for Richardson extrapolation in Table 10 by tacking different values of α to see the efficiency of the proposed methods.
In what follows, we introduce (Figure 3) some graphical comparisons between the results generated using the analytical and fractional central formulas.

6. Conclusions

In this work, we generalized the classical central formula to introduce the modified three-point fractional formula; the function’s behavior for our classical central formula is the same as the main function, and we show this in Section 5 from the figures and tables. Additionally, we made a new methodology for the Richardson extrapolation. In our next work, we will generate our proposed scheme to establish a new generalization of the second-order central formula in the fractional central case.

Author Contributions

Conceptualization, I.M.B. and S.A.; Data curation, I.M.B. and S.A.; Formal analysis, I.M.B., S.A. and M.A.; Funding acquisition, I.M.B., S.A., A.O. and M.A.; Investigation, S.A.; Methodology, I.M.B. and S.A.; Project administration, S.A. and S.M.; Resources, S.A., O.Y.A. and M.A.; Software, S.A.; Supervision, S.A. and M.A.; Validation, S.A.; Visualization, S.A.; Writing—original draft, S.A.; Writing—review & editing, S.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Aho, A.V.; Hopcroft, J.E.; Ullman, J.D. The Design and Analysis of Computer Algorithms; Addison-Wesley: Reading, MA, USA, 1974; 470p. [Google Scholar]
  2. Aitken, A.C. On interpolation by iteration of proportional parts, without the use of differences. Proc. Edinburgh Math. Soc. 1932, 3, 56–76. [Google Scholar] [CrossRef]
  3. Batiha, I.M.; El-Khazali, R.; AlSaedi, A.; Momani, S. The general solution of singular fractional-order linear time-invariant continuous systems with regular pencils. Entropy 2018, 20, 400. [Google Scholar] [CrossRef] [PubMed]
  4. Axelsson, O.; Barker, V.A. Finite Element Solution of Boundary Value Problems: Theory and Computation; Academic Press: Orlando, FL, USA, 1984; 432p. [Google Scholar]
  5. Aitken, A.C. On the theory of graduation. Proc. R. Soc. Edinb. 1926, 47, 36–45. [Google Scholar]
  6. Burden, R.L.; Faires, J.D. Numerical Analysis, 9th ed.; Brooks/Cole: Pacific Grove, CA, USA, 2011. [Google Scholar]
  7. Allgower, E.; Georg, K. Numerical Continuation Methods: An Introduction; Springer: New York, NY, USA, 1990; 388p. [Google Scholar]
  8. Ames, W.F. Numerical Methods for Partial Differential Equations, 3rd ed.; Academic Press: New York, NY, USA, 1992; 451p. [Google Scholar]
  9. Andrews, H.C.; Patterson, C.L. Outer product expansions and their uses in digital image processing. Am. Math. Mon. 1975, 82, 1–13. [Google Scholar] [CrossRef]
  10. Argyros, I.K.; Szidarovszky, F. The Theory and Applications of Iteration Methods; CRC Press: Boca Raton, FL, USA, 1993; 355p. [Google Scholar]
  11. Ascher, U.M.; Mattheij, R.M.M.; Russell, R.D. Numerical Solution of Boundary Value Problems for Ordinary Differential Equations; Prentice-Hall: Englewood Cliffs, NJ, USA, 1988; 595p. [Google Scholar]
  12. De Santis, V.; Martynyuk, V.; Lampasi, A.; Fedula, M.; Ortigueira, M.D. Fractional-order circuit models of the human body impedance for compliance tests against contact currents. AEU-Int. J. Electron. Commun. 2017, 78, 238–244. [Google Scholar] [CrossRef]
  13. Duarte Ortigueira, M.; Tenreiro Machado, J. Fractional derivatives: The perspective of system theory. Mathematics 2019, 7, 150. [Google Scholar] [CrossRef]
  14. Ortigueira, M.D.; Batista, A.G. On the relation between the fractional Brownian motion and the fractional derivatives. Phys. Lett. A 2008, 372, 958–968. [Google Scholar] [CrossRef]
  15. Arshad, M.; Lu, D.; Wang, J. (N+ 1)-dimensional fractional reduced differential transform method for fractional order partial differential equations. Commun. Nonlinear Sci. Numer. Simul. 2017, 48, 509–519. [Google Scholar] [CrossRef]
  16. Albadarneh, R.B.; Iqbal, M.B.; Mohammad, Z. Numerical solutions for linear fractional differential equations of order 1< α< 2 using finite difference method (FFDM). Int. J. Math. Comput. Sci. 2016, 16, 103–111. [Google Scholar]
  17. El-Khazali, R.; Batiha, I.M.; Momani, S. Approximation of fractional-order operators. In International Workshop on Advanced Theory and Applications of Fractional Calculus; Springer: Singapore, 2018. [Google Scholar]
  18. Talbi, I.; Ouannas, A.; Khennaoui, A.A.; Berkane, A.; Batiha, I.M.; Grassi, G.; Pham, V.T. Different dimensional fractional-order discrete chaotic systems based on the Caputo h-difference discrete operator: Dynamics, control, and synchronization. Adv. Differ. Equ. 2020, 2020, 624. [Google Scholar] [CrossRef]
  19. Albadarneh, R.B.; Batiha, I.M.; Adwai, A.; Tahat, N.; Alomari, A.K. Numerical approach of Riemann-Liouville fractional derivative operator. Int. J. Electr. Comput. Eng. (IJECE) 2021, 11, 5367–5378. [Google Scholar] [CrossRef]
  20. Martynyuk, V.; Ortigueira, M.; Fedula, M.; Savenko, O. Methodology of electrochemical capacitor quality control with fractional order model. AEU-Int. J. Electron. Commun. 2018, 91, 118–124. [Google Scholar] [CrossRef]
  21. Axelsson, O. Iterative Solution Methods; Cambridge University Press: New York, NY, USA, 1994; 654p. [Google Scholar]
  22. Wang, Q. Homotopy perturbation method for fractional KdV equation. Appl. Math. Comput. 2007, 190, 1795–1802. [Google Scholar] [CrossRef]
  23. Joyce, D.C. Survey of extrapolation processes in numerical analysis. SIAM Rev. 1971, 13, 435–490. [Google Scholar] [CrossRef]
Figure 1. Comparison results between the analytical and fractional central formulas for Example 1.
Figure 1. Comparison results between the analytical and fractional central formulas for Example 1.
Mathematics 10 03489 g001
Figure 2. Comparison results between the analytical and fractional central formulas for Example 2.
Figure 2. Comparison results between the analytical and fractional central formulas for Example 2.
Mathematics 10 03489 g002
Figure 3. Comparison results between the analytical and fractional central formulas for Example 3.
Figure 3. Comparison results between the analytical and fractional central formulas for Example 3.
Mathematics 10 03489 g003
Table 1. The 4th order approximation of Richardson’s extrapolation.
Table 1. The 4th order approximation of Richardson’s extrapolation.
Q(h 2 )Q(h 4 )Q(h 6 )Q(h 8 )
M 1 ( h ) ---
M 1 ( h 2 ) M 2 ( h ) --
M 1 ( h 4 ) M 2 ( h 2 ) M 3 ( h ) -
M 1 ( h 8 ) M 2 ( h 4 ) M 3 ( h 2 ) M 4 ( h )
Table 2. The numerical result when α = 1 using our central formula with Richardson extrapolation.
Table 2. The numerical result when α = 1 using our central formula with Richardson extrapolation.
hQ( h 2 )Q( h 4 )Q( h 6 )Q( h 8 )Q( h 10 )Q( h 12 )Q( h 14 )Q( h 16 )
0.010014.08000000000
0.005014.040014.0267000000
0.002514.020014.013314.012400000
0.001314.010014.006714.006214.00610000
0.000614.005014.003314.003114.003114.0030000
0.000314.002514.001714.001614.001514.001514.001500
0.000214.001214.000814.000814.000814.000814.000814.00080
0.000114.0006414.000414.000414.000414.000414.000414.000414.0004
Table 3. The numerical result when α = 0.75 using our central formula with Richardson extrapolation.
Table 3. The numerical result when α = 0.75 using our central formula with Richardson extrapolation.
hQ( h 2 )Q( h 4 )Q( h 6 )Q( h 8 )Q( h 10 )Q( h 12 )Q( h 14 )Q( h 16 )
0.010014.27140000000
0.005014.220514.2036000000
0.002514.195114.186614.185500000
0.001314.182414.178214.177614.17750000
0.000614.176014.173914.173614.173614.1736000
0.000314.172914.171814.171714.171614.171614.171600
0.000214.171314.170714.170714.170714.170714.170714.17070
0.000114.170514.170214.170214.170214.1702414.170214.170214.1702
Table 4. The absolute error for Richardson extrapolation between α = 1 and α = 0.75 .
Table 4. The absolute error for Richardson extrapolation between α = 1 and α = 0.75 .
hQ ( h 2 i ) Absolute Error for α = 1 Absolute Error for α = 0.75
0.0100Q( h 2 ) 8 × 10 2 1.017 × 10 1
0.0050Q( h 4 ) 2.67 × 10 2 3.39 × 10 2
0.0025Q( h 6 ) 1.24 × 10 2 1.58 × 10 2
0.0013Q( h 8 ) 6.1 × 10 3 7.8 × 10 3
0.0006Q( h 10 ) 3 × 10 3 3.9 × 10 3
0.0003Q( h 12 ) 1.5 × 10 3 1.9 × 10 3
0.0002Q( h 14 ) 8 × 10 4 1 × 10 3
0.0001Q( h 16 ) 4 × 10 4 5 × 10 4
Table 5. The numerical result when α = 1 using modified central formula with Richardson extrapolation.
Table 5. The numerical result when α = 1 using modified central formula with Richardson extrapolation.
hQ( h 2 )Q( h 4 )Q( h 6 )Q( h 8 )Q( h 10 )Q( h 12 )Q( h 14 )Q( h 16 )
0.0100−5.33360000000
0.0050−5.3624−5.3720000000
0.0025−5.3770−5.3818−5.382500000
0.0013−5.3843−5.3868−5.3871−5.38720000
0.0006−5.3880−5.3892−5.3894−5.3894−5.3894000
0.0003−5.3898−5.3905−5.3905−3.3906−5.3906−5.390600
0.0002−5.3908−5.3911−5.3911−5.3911−5.3911−5.3911−5.39110
0.0001−5.3912−5.3914−5.3914−5.3914−5.3914−5.3914−5.3914−5.3914
Table 6. The numerical result when α = 0.98 using our central formula with Richardson extrapolation.
Table 6. The numerical result when α = 0.98 using our central formula with Richardson extrapolation.
hQ( h 2 )Q( h 4 )Q( h 6 )Q( h 8 )Q( h 10 )Q( h 12 )Q( h 14 )Q( h 16 )
0.0100−5.37900000000
0.0050−5.4069−5.4162000000
0.0025−5.4211−5.4258−5.426400000
0.0013−5.4282−5.4306−5.4309−5.43100000
0.0006−5.4318−5.4330−5.4331−5.4332−5.4332000
0.0003−5.4336−5.4342−5.4342−5.4343−5.4343−5.434300
0.0002−5.4345−5.4348−5.4348−5.4348−5.4348−5.4348−5.43480
0.0001−5.4349−5.4351−5.4351−5.4351−5.4351−5.4351−5.4351−5.4351
Table 7. The absolute error for Richardson extrapolation between α = 1 and α = 0.98 .
Table 7. The absolute error for Richardson extrapolation between α = 1 and α = 0.98 .
hQ ( h 2 i ) Absolute Error for α = 1 Absolute Error for α = 0.98
0.0100 Q ( h 2 ) 5.81 × 10 2 1.565 × 10 1
0.0050 Q ( h 4 ) 1.97 × 10 2 1.193 × 10 1
0.0025 Q ( h 6 ) 9.2 × 10 3 1.091 × 10 1
0.0013 Q ( h 8 ) 4.5 × 10 3 1.045 × 10 1
0.0006 Q ( h 10 ) 2.3 × 10 3 1.023 × 10 1
0.0003 Q ( h 12 ) 1.1 × 10 3 1.012 × 10 1
0.0002 Q ( h 14 ) 6 × 10 4 1.007 × 10 1
0.0001 Q ( h 16 ) 3 × 10 4 1.004 × 10 1
Table 8. The numerical result for α = 1 using our central formula with Richardson extrapolation.
Table 8. The numerical result for α = 1 using our central formula with Richardson extrapolation.
hQ( h 2 )Q( h 4 )Q( h 6 )Q( h 8 )Q( h 10 )Q( h 12 )Q( h 14 )Q( h 16 )
0.0100−0.50860000000
0.0050−0.5043−0.5029000000
0.0025−0.5022−0.5014−0.501300000
0.0013−0.5011−0.5007−0.5007−0.50070000
0.0006−0.5005−0.5004−0.5003−0.5003−0.5003000
0.0003−0.5003−0.5002−0.5002−0.5002−0.5002−−0.500200
0.0002−0.5001−0.5001−0.5001−0.5001−0.5001−0.5001−0.50010
0.0001−0.5001−0.5000−0.5000−0.5000−0.5000−0.5000−0.5000−0.5000
Table 9. The numerical result when α = 0.35 using our central formula with Richardson extrapolation.
Table 9. The numerical result when α = 0.35 using our central formula with Richardson extrapolation.
hQ( h 2 )Q( h 4 )Q( h 6 )Q( h 8 )Q( h 10 )Q( h 12 )Q( h 14 )Q( h 16 )
0.0100−0.24200000000
0.0050−0.2382−0.2369000000
0.0025−0.2363−0.2357−0.235600000
0.0013−0.2354−0.2351−0.2350−0.23500000
0.0006−0.2349−0.2348−0.2347−0.2347−0.2347000
0.0003−0.2347−0.2346−0.2346−0.2346−0.2346−0.234600
0.0002−0.2346−0.2345−0.2345−0.2345−0.2345−0.2345−0.23450
0.0001−0.2345−0.2345−0.2345−0.2345−0.2345−0.2345−0.2345−0.2345
Table 10. The absolute error for Richardson extrapolation between α = 1 and α = 0.35 .
Table 10. The absolute error for Richardson extrapolation between α = 1 and α = 0.35 .
hQ ( h 2 i ) Absolute Error for α = 1 Absolute Error for α = 0.35
0.0100Q(h 2 ) 8.6 × 10 2 1.7 × 10 2
0.0050Q(h 4 ) 2.9 × 10 2 1.81 × 10 2
0.0025Q(h 6 ) 1.3 × 10 2 1.94 × 10 2
0.0013Q(h 8 ) 7 × 10 3 2 × 10 2
0.0006Q(h 10 ) 3 × 10 3 2.03 × 10 2
0.0003Q(h 12 ) 2 × 10 3 2.04 × 10 2
0.0002Q(h 14 ) 1 × 10 3 2.05 × 10 2
0.0001Q(h 16 )0 2.05 × 10 2
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Batiha, I.M.; Alshorm, S.; Ouannas, A.; Momani, S.; Ababneh, O.Y.; Albdareen, M. Modified Three-Point Fractional Formulas with Richardson Extrapolation. Mathematics 2022, 10, 3489. https://0-doi-org.brum.beds.ac.uk/10.3390/math10193489

AMA Style

Batiha IM, Alshorm S, Ouannas A, Momani S, Ababneh OY, Albdareen M. Modified Three-Point Fractional Formulas with Richardson Extrapolation. Mathematics. 2022; 10(19):3489. https://0-doi-org.brum.beds.ac.uk/10.3390/math10193489

Chicago/Turabian Style

Batiha, Iqbal M., Shameseddin Alshorm, Adel Ouannas, Shaher Momani, Osama Y. Ababneh, and Meaad Albdareen. 2022. "Modified Three-Point Fractional Formulas with Richardson Extrapolation" Mathematics 10, no. 19: 3489. https://0-doi-org.brum.beds.ac.uk/10.3390/math10193489

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop