Next Article in Journal
The Mittag-Leffler Function for Re-Evaluating the Chlorine Transport Model: Comparative Analysis
Next Article in Special Issue
Why Controlling the Asymptomatic Infection Is Important: A Modelling Study with Stability and Sensitivity Analysis
Previous Article in Journal
Existence Results for Coupled Nonlinear Sequential Fractional Differential Equations with Coupled Riemann–Stieltjes Integro-Multipoint Boundary Conditions
Previous Article in Special Issue
Fixed Point Results for F-Contractions in Cone Metric Spaces over Topological Modules and Applications to Integral Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Reliable Approach for Solving Delay Fractional Differential Equations

1
Department of Mathematical Sciences, Universiti Kebangsaan Malaysia, Bangi Selangor 43600, Malaysia
2
Academic Support Department, Abu Dhabi Polytechnic, Abu Dhabi P.O. Box 111499, United Arab Emirates
3
Department of Mathematical Sciences, College of Science, UAE University, Al-Ain P.O. Box 15551, United Arab Emirates
4
Department of Mathematics, Yarmouk University, Irbid 21163, Jordan
*
Author to whom correspondence should be addressed.
Fractal Fract. 2022, 6(2), 124; https://doi.org/10.3390/fractalfract6020124
Submission received: 17 January 2022 / Revised: 7 February 2022 / Accepted: 18 February 2022 / Published: 21 February 2022

Abstract

:
In this paper, we study a class of second-order delay fractional differential equations with a variable-order Caputo derivative. This type of equation is an extension to ordinary delay equations which are used in the modeling of several biological systems such as population dynamics, epidemiology, and immunology. Usually, fractional differential equations are difficult to solve analytically, and with fractional derivatives of variable-order, they become more challenging. Therefore, the need for reliable numerical techniques is worth investigating. To solve this type of equation, we derive a new approach based on the operational matrix. We use the shifted Chebyshev polynomials of the second kind as the basis for the approximate solutions. A convergence analysis is discussed and the uniform convergence of the approximate solutions is proven. Several examples are discussed to illustrate the efficiency of the presented approach. The computed errors, figures, and tables show that the approximate solutions converge to the exact ones by considering only a few terms in the expansion, and illustrate the novelty of the presented approach.

1. Introduction

Fractional differential equations (FDEs) appear in several science and engineering applications. They have been used to model several nonlocal dynamical systems [1,2] and, thus, have become a popular field of study. Fractional delay differential equations (FDDEs) are also emerging in many other disciplines, including chemistry, physics, and finance, where the inclusion of the delay term in the differential equations opens new vistas [3]. Because it is extremely difficult to obtain solutions of nonlinear FDEs and FDDEs in closed forms, several analytical and numerical methods such as the Adomian decomposition and homotopy perturbations methods have been implemented [4,5,6,7,8,9,10,11,12,13]. In [14,15], authors derived numerical approaches for the numerical integration of FDEs, which are a generalization of many known methods in the literature, such as the Adams–Bashforth approach. Adams–Bashforth methods were implemented to solve nonlinear FDDEs [16,17]. In addition, Daftardar-Gejji et al. recently introduced the predictor–corrector method for solving FDEs [18]. A new iterative method to numerically solve FDEs was derived in [19] and implemented for various functional equations. The operational matrix method (OMM) has been proven to be an efficient approach to approximate various functional equations. Gurbuz and Mehmet [20,21,22,23] implemented the OMM based on the Laguerre polynomials to solve several types of linear and nonlinear functional equations, including the mixed boundary condition. Recently, the OMM was used by several researchers to solve fractional differential equations. It was implemented to solve the fractional Riccati equations [24], the generalized Abel integral equations [25], and fractional differential equations of arbitrary order [26].
In this article, we study the following fractional delay problem:
D 2 z ( s ) = D μ ( s ) z ( s ) + a ( s ) z ( ζ s ) + r ( s ) , 0 < s < 1 ,
z ( 0 ) = z 0 , z ( 0 ) = z 1 ,
where 0 < ζ < 1 , 0 < μ ( s ) < 1 for all s [ 0 , 1 ] , a ( s ) , r ( s ) are a continuous function on [ 0 , 1 ] , and D μ ( s ) is the variable Caputo derivative. In the next section, we present some definitions and formulas which are used later. The method of solution is discussed in Section 3, and in Section 4, we present some theoretical results. Several examples are discussed in Section 5. In addition, we present conclusions in the last section.

2. Basic Definitions and Formulas

Here, we focused on basic concepts and definitions which were used in this paper. We started with the definition of the variable Caputo derivative.
Definition 1. 
Let μ : [ 0 , 1 ] ( 0 , 1 ) be a real valued function, and u A C [ 0 , 1 ] . The Caputo derivative of variable fractional order μ is defined by
D μ ( x ) u ( x ) = 1 Γ ( 1 μ ( x ) ) 0 x u ( x ) ( x s ) μ ( x ) d s .
Then, the following formulas can be obtained:
D μ ( x ) x m = Γ ( m + 1 ) Γ ( 1 + m μ ( x ) ) x m μ ( x ) , m = 1 , 2 , . . .
and
D μ ( x ) 1 = 0 .
For more details about the definition and properties of the variable Caputo derivatives, we refer the reader to [27,28,29]. Let { T k ( x ) } k = 0 be the set of Chebyshev polynomials of the second kind on [ 1 , 1 ] . Then,
1 1 ω ( x ) T k ( x ) T l ( x ) d x = π 2 , k = l 0 , k l
where ω ( x ) = 1 x 2 . The relation that generates these polynomials is given by
T k + 1 ( x ) = 2 x T k ( x ) T k 1 ( x ) , k = 1 , 2 , . . .
where
T 0 ( x ) = 1 ,
T 1 ( x ) = 2 x .
Let x = 2 s 1 . We defined the polynomials S T k ( s ) by
S T k ( s ) = T k ( 2 s 1 ) , k = 0 , 1 , .
Then, it held that
S T k + 1 ( s ) = ( 4 s 2 ) S T k ( s ) S T k 1 ( s ) , k = 1 , 2 ,
where
S T 0 ( s ) = 1 ,
S T 1 ( s ) = 4 s 2 .
Then, simple calculations indicate that S T 2 ( s ) and S T 3 ( s ) are given by
S T 2 ( s ) = ( 4 s 2 ) S T 1 ( s ) S T 0 ( s ) = 16 s 2 16 s + 3 ,
S T 3 ( s ) = ( 4 s 2 ) S T 2 ( s ) S T 1 ( s ) = 64 s 3 96 s 2 24 s 4 .
Thus, the coefficient of the leading term in S T k ( S ) is 4 k . The orthogonality relation is given as
0 1 s ω ( s ) S T k ( s ) S T l ( s ) d s = π 8 , k = l 0 , k l
where s ω ( s ) = s s 2 . One can see that if f ( s ) is a smooth function on [ 0 , 1 ] , then it can be written in terms of { S T k ( s ) , k = 0 , 1 , 2 , } as follows:
f ( s ) = k = 0 a k S T k ( s )
where
a k = 8 π 0 1 s ω ( s ) S T k ( s ) f ( s ) d s .
Now, we could find a relation between the basis { 1 , s , , s m } and the basis { S T 0 ( s ) , S T 1 ( s ) , , S T m ( s ) } . Let Y m ( s ) = S T 0 ( s ) , S T 1 ( s ) , , S T m ( s ) T and Φ m ( s ) = 1 , s , , s m T . Then,
Y m ( s ) = A m Φ m ( s )
where for m = 5
A 5 = 1 0 0 0 0 2 2 2 0 0 0 3 16 2 4 0 0 4 40 96 2 6 0 5 80 336 512 2 8 .
It is easy to see that A m is a lower triangular matrix with the following diagonal elements
( A m ) k k = 2 2 k 2 .
We had det ( A m ) = 2 m 2 m 0 , which implies that A m is a nonsingular matrix and it held that
Φ m ( s ) = A m 1 Y m ( s ) .

3. Method of Solution

This section focuses on the derivation of the proposed method. First, we found the operational matrices of D 2 z ( s ) , z ( ζ s ) , and D μ ( s ) z ( s ) . From Equation (19), we had
Y m ( s ) = d 2 d s 2 [ A m Φ m ( s ) ] = A m d 2 d s 2 Φ m ( s )
= A m 0 0 2 m ( m 1 ) s m 2 = A m F m Φ m ( s ) = A m F m A m 1 Y m ( s ) ,
where
F m = 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 6 0 0 0 0 0 0 0 m ( m 1 ) 0 0 .
Hence, A m F m A m 1 was the operational matrix of Y m ( s ) . Now,
Y m ( ζ s ) = A m Φ m ( ζ s )
= A m 1 ζ s ζ 2 s 2 ζ m s m = A m G m Φ m ( s ) ,
where
G m = 1 0 0 · 0 0 ζ 0 0 0 0 ζ m 1 0 0 0 0 ζ m .
From Equation (26), we obtained
Y m ( ζ s ) = A m G m A m 1 Y m ( s ) .
Hence, A m G m A m 1 was the operational matrix of Y m ( ζ s ) . Finally,
D μ ( s ) Y m ( s ) = D μ ( s ) ( A m Φ m ( s ) )
= A m D μ ( s ) 1 D μ ( s ) s D μ ( s ) s m = A m 0 Γ ( 2 ) Γ ( 2 μ ( s ) ) s 1 μ ( s ) Γ ( m + 1 ) Γ ( m + 1 μ ( s ) ) s m μ ( s ) = A m 0 0 0 0 Γ ( 2 ) Γ ( 2 μ ( s ) ) s μ ( s ) 0 0 0 Γ ( m + 1 ) Γ ( m + 1 μ ( s ) ) s μ ( s ) Φ m ( s ) = A m N μ ( s ) A m 1 Y m ( s )
where
N μ ( s ) = 0 0 0 0 Γ ( 2 ) Γ ( 2 μ ( s ) ) s μ ( s ) 0 0 0 Γ ( m + 1 ) Γ ( m + 1 μ ( s ) ) s μ ( s ) .
Hence, A m N μ ( s ) A m 1 was the operational matrix of D μ ( s ) Y m ( s ) . Let
Z m ( s ) = k = 0 m ν k S T k ( s ) = Θ m Y m ( s )
where
Θ m = ν 0 ν 1 ν 2 ν m .
From Equations (1), (23), (29) and (30), we obtained
Θ m ( A m F m A m 1 ) Y m ( s ) = Θ m ( A m N μ ( s ) A m 1 + a ( s ) A m G m A m 1 ) Y m ( s ) + r ( s )
or
Θ m ( A m F m A m 1 A m N μ ( s ) A m 1 a ( s ) A m G m A m 1 ) Y m ( s ) = r ( s ) .
Taking the collocation points
s k = 2 k + 2 2 m + 2 , k = 1 , 2 , , m 1 ,
we had
Θ m ( A m F m A m 1 A m N μ ( s k ) A m 1 a ( s k ) A m G m A m 1 ) Y m ( s k ) = r ( s k ) , k = 1 , 2 , , m 1 .
Now, From Equation (33), we had
z 0 = Z m ( 0 ) = Θ m Y m ( 0 ) ,
z 1 = Z m ( 0 ) = A m N μ ( 1 ) A m 1 Y m ( 0 ) ,
which, combined with the results in Equations (38)–(40), led to
( Θ m ) = Ψ ,
where
( Θ m ) = Θ m ( A m F m A m 1 A m N μ ( s 1 ) A m 1 a ( s 1 ) A m G m A m 1 ) Y m ( s 1 ) Θ m ( A m F m A m 1 A m N μ ( s 2 ) A m 1 a ( s 2 ) A m G m A m 1 ) Y m ( s 2 ) Θ m ( A m F m A m 1 A m N μ ( s m 1 ) A m 1 a ( s m 1 ) A m G m A m 1 ) Y m ( s m 1 ) Θ m Y m ( 0 ) A m N μ ( 1 ) A m 1 Y m ( 0 ) , Ψ = r ( s 1 ) r ( s 2 ) r ( s m 1 ) z 0 z 1 .
Then, we solve the nonlinear algebraic system (41) using Wolfram Research, Inc., Mathematica, Version 12.1, Champaign, IL (2021), to find Θ m .

4. Theoretical Results

Our main task in this section was to show that { Z m ( s ) : m = 1 , 2 , } converged uniformly to z ( s ) on [ 0 , 1 ] . Since the differential operator on the Chebyshev polynomials space was continuous and bounded, see [30], the solution produced by the operational matrix method was very close to the least squares approximation of z ( s ) . For simplicity in analyzing the method, we assumed that z m ( s ) was the least square approximation of z ( s ) . Let z ( s ) C m + 1 [ 0 , 1 ] , and assume that
Z m ( s ) = k = 0 m ν k S T k ( s ) = Θ m Y m ( s )
was the least square approximation of z ( s ) of degree m. Using Taylor’s series expansion, we had
z ( s ) = σ m ( s ) + z m + 1 ( α ) ( s c ) m + 1 ( m + 1 ) ! ,
where c [ 0 , 1 ] , α between s and c, and
σ m ( s ) = k = 0 m z ( k ) ( c ) ( s c ) k k ! .
Thus,
| z ( s ) σ m ( s ) | = z m + 1 ( α ) ( s c ) m + 1 ( m + 1 ) ! .
Since Z m ( s ) was the least squares approximation of z ( s ) , we had
z Z m 2 2 z σ m 2 2
= 0 1 s ω ( x ) ( z ( s ) σ ( s ) ) 2 d s
= 0 1 s ω ( s ) z m + 1 ( α ) ( s c ) m + 1 ( ( m + 1 ) ! ) 2 d s
τ 2 ( ( m + 1 ) ! ) 2 0 1 s ω ( x ) ( s c ) 2 m + 2 d s
= τ 2 ( ( m + 1 ) ! ) 2 0 1 s s 2 ( s c ) 2 m + 2 d x ,
where
τ = max { z ( m + 1 ) ( s ) : s [ 0 , 1 ] } .
Let γ = max { 1 c , c } . Then,
z Z m 2 2 τ 2 γ 2 m + 2 ( ( m + 1 ) ! ) 2 0 1 s + s 2 = τ 2 γ 2 m + 2 ( ( m + 1 ) ! ) 2 π 8 .
Therefore,
z Z m 2 τ γ m + ( m + 1 ) ! π 8 ,
which approached to zero as m approached to for all s [ 0 , 1 ] . Thus, { Z m ( s ) : m = 1 , 2 , } converged uniformly to z ( s ) on [ 0 , 1 ] . The previous discussion was proof of the following theorem:
Theorem 1. 
Suppose that z ( s ) C m + 1 [ 0 , 1 ] . Let Z m ( s ) = k = 0 m ν k S T k ( s ) = Θ m Y m ( s ) be the least squares approximation of z ( s ) . Then, { Z m ( s ) : m = 1 , 2 , } converges uniformly to z ( s ) on [ 0 , 1 ] .

5. Examples

Three numerical examples were solved to show the efficiency of the OMM.
Example 1. 
Consider the delay fractional problem
D 2 z ( s ) = D 3 s i n s + 2 c o s s 10 z ( s ) + s z ( s 2 ) + r ( s ) , 0 < s < 1
z ( 0 ) = 0 , z ( 0 ) = 1 ,
where
r ( s ) = 2 2 Γ ( 3 3 s i n s + 2 c o s s 10 ) s 2 3 s i n s + 2 c o s s 10 1 Γ ( 2 3 s i n s + 2 c o s s 10 ) s 1 3 s i n s + 2 c o s s 10 s 3 4 s 2 2 .
The exact solution was given by
z ( s ) = s 2 + s .
Let the approximate solution be given by
Z 5 ( s ) = k = 0 5 ν k S T k ( s ) .
Then, using the proposed method, we obtained
ν 0 = 0.8125000000000001 , ν 1 = 0.5 , ν 2 = 0.0625 , ν 3 = ν 4 = ν 5 = 0 .
Thus,
Z 5 ( s ) = 0.8125000000000001 S T 0 ( s ) + 0.5 S T 1 ( s ) + 0.0625 S T 2 ( s ) = 1.11022 × 10 16 + s + s 2 .
Let
ϵ 5 = max { | z ( 0 ) Z 5 ( 0 ) | , | z ( s 1 ) Z 5 ( s 1 ) | , , | z ( s 4 ) Z 5 ( s 4 ) | , | z ( 1 ) Z 5 ( 1 ) | } .
Then, ϵ 5 = 1.11022 × 10 16 . The absolute errors are reported in Table 1. The graphs of z ( s ) and Z 5 ( s ) are shown in Figure 1.
Example 2. 
Consider the delay fractional problem
D 2 z ( s ) = D s 4 z ( s ) + ( sin s ) z ( s 3 ) + r ( s ) , 0 < s < 1
z ( 0 ) = 2 , z ( 0 ) = 1 ,
where
r ( s ) = 2 2 Γ ( 3 s 4 ) s 2 s 4 1 Γ ( 2 s 4 ) s 1 s 4 ( sin s ) s 2 9 + s 3 2 .
The exact solution was given by
z ( s ) = s 2 + s 2 .
Let the approximate solution be given by
Z 5 ( s ) = k = 0 5 ν k S T k ( s ) .
Then, using the proposed method, we obtained
ν 0 = 1.1875000001 ,   ν 1 = 0.5 ,   ν 2 = 0.0625 ,   ν 3 = ν 4 = ν 5 = 0 .
Thus,
Z 5 ( s ) = 1.1875000001 S T 0 ( s ) + 0.5 S T 1 ( s ) + 0.0625 S T 2 ( s ) = 2.0000000001 + s + s 2 .
Let
ϵ 5 = max { | z ( 0 ) Z 5 ( 0 ) | , | z ( s 1 ) Z 5 ( s 1 ) | , , | z ( s 4 ) Z 5 ( s 4 ) | , | z ( 1 ) Z 5 ( 1 ) | } .
Then, ϵ 5 = 10 10 . The absolute error is reported in Table 2. The graphs of z ( s ) and Z 5 ( s ) are presented in Figure 2.
Example 3. 
Consider the delay fractional problem
D 2 z ( s ) = D s z ( s ) + z s 4 + r ( s ) , 0 < s < 1
z ( 0 ) = 0 , z ( 0 ) = 0 ,
where
r ( s ) = 15 4 s 15 π 8 Γ 7 2 s s 5 2 s 2 1 32 s s 2 .
The exact solution was given by
z ( s ) = s 5 2 .
Let the approximate solution be given by
Z 10 ( s ) = k = 0 10 ν k S T k ( s ) .
Using the proposed method, we had
ν 0 = 256 315 π , ν 1 = 512 693 π , ν 2 = 256 1001 π , ν 3 = 1024 45045 π ,
ν 4 = 256 153153 π , ν 5 = 512 1616615 π , ν 6 = 256 2909907 π , ν 7 = 2048 66927861 π ,
ν 8 = 2304 185810725 π , ν 9 = 512 91265265 π , ν 10 = 2816 1017958725 π .
Let
ϵ ( s ) = | z ( s ) Z 10 ( s ) | .
The absolute error is reported in Table 3. The graphs of z ( s ) and Z 10 ( s ) are presented in Figure 3.
Example 4. 
Consider the delay fractional problem
D 2 z ( s ) = D s z ( s ) + z s 3 + r ( s ) , 0 < s < 1
z ( 0 ) = 0 , z ( 0 ) = 0 ,
where r ( s ) was chosen so that the exact solution was given by
z ( s ) = s 5 2 c o s ( s 5 2 ) .
Let the approximate solution be given by
Z 10 ( s ) = k = 0 10 ν k S T k ( s ) .
Using the proposed method, we had
ν 0 = 0.220256 , ν 1 = 0.18058 , ν 2 = 0.035659 , ν 3 = 0.0189969 ,
ν 4 = 0.0109545 , ν 5 = 0.00258346 , ν 6 = 0.000356888 , ν 7 = 0.0000498019 ,
ν 8 = 0.0000219865 , ν 9 = 7.20851 × 10 6 , ν 10 = 2.72747 × 10 7 .
Let
ϵ ( s ) = | z ( s ) Z 10 ( s ) | .
The absolute error is reported in Table 4. The graphs of z ( s ) and Z 10 ( s ) are presented in Figure 4.

6. Conclusions

We presented an algorithm to solve a class of delay fractional initial value problems with the variable Caputo fractional derivative. We expanded the approximate solution using extended types of Chebyshev polynomials and then determined the coefficients using the operational matrix approach. We proved that the approximate solutions converged uniformly to the exact ones. We illustrated the efficiency of the presented approach through four examples. It was noticed that the computed errors were small, even if we considered a number of terms in the expansion. We chose examples where their exact solutions were available, so it was possible to compute the exact errors. The approximate solutions were very close to the exact ones, which indicated the efficiency of the presented approach in dealing with these types of problems, and, therefore, it is recommended to extend its use to other types of problems.

Author Contributions

Conceptualization, I.H. and M.I.S.; methodology, I.H., M.S. and M.I.S.; software, M.S.; validation, I.H., M.I.S. and M.A.-R.; formal analysis, M.S.; investigation, M.S. and M.I.S.; resources, M.S.; data curation, M.S.; writing—original draft preparation, M.S.; writing—review and editing, M.A.-R.; supervision, M.I.S.; project administration, I.H.; funding acquisition, I.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Acknowledgments

The first author acknowledges the financial support received from the UKM’s under Grant No. DIP-2021-018.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Alshomrani, A.; Ullah, M.; Baleanu, D. Caputo SIR model for COVID-19 under optimized fractional order. Adv. Differ. Equ. 2021, 2021, 185. [Google Scholar] [CrossRef] [PubMed]
  2. Ahmad, S.; Ullah, R.; Baleanu, D. Mathematical analysis of tuberculosis control model using nonsingular kernel type Caputo derivative. Adv. Differ. Equ. 2021, 2021, 26. [Google Scholar] [CrossRef]
  3. Omay, T.; Baleanu, D. Fractional unit-root tests allowing for a fractional frequency flexible Fourier form trend: Predictability of COVID-19. Adv. Differ. Equ. 2021, 2021, 167. [Google Scholar] [CrossRef] [PubMed]
  4. Alomari, A.K.; Syam, M.; Anakira, N.R.; Jameel, A.F. Homotopy Sumudu transform method for solving applications in physics. Results Phys. 2020, 18, 103265. [Google Scholar] [CrossRef]
  5. Chen, Y.; Moore, K.L. Analytical stability bound for a class of delayed fractional-order dynamic systems. Nonlinear Dyn. 2002, 29, 191–200. [Google Scholar] [CrossRef]
  6. Caglar, H.; Caglar, N.; Ozer, M. B-spline solution of non-linear singular boundary value problems arising in physiology. Chaos Solitons Fractals 2009, 39, 1232–1237. [Google Scholar] [CrossRef]
  7. Shahmorad, S.; Ostadzad, M.H.; Baleanu, D. A Tau-like numerical method for solving fractional delay integro-differential equations. Appl. Numer. Math. 2020, 151, 322–336. [Google Scholar] [CrossRef]
  8. Syam, M.; Al-Refai, M. First order delay equations Implicit hybrid method. Alex. Eng. J. 2020, 59, 2677–2681. [Google Scholar] [CrossRef]
  9. Tassaddiq, A.; Yaseen, M.; Yousaf, A.; Srivastava, R. A cubic B-spline collocation method with new approximation for the numerical treatment of the heat equation with classical and non-classical boundary conditions. Phys. Scr. 2021, 96, 045212. [Google Scholar] [CrossRef]
  10. Zheng, W.; Huang, R.; Luo, Y.; Chen, Y.; Wang, X.; Chen, Y. A Look-up table based fractional order composite controller synthesis method for the PMSM speed servo system. Fractal Fract. 2022, 6, 47. [Google Scholar] [CrossRef]
  11. Agarwal, R.P.; Al-Hutami, H.; Ahmad, B. A Langevin-type q-variant system of nonlinear fractional integro-difference equations with nonlocal boundary conditions. Fractal Fract. 2022, 6, 45. [Google Scholar] [CrossRef]
  12. Reyaz, R.; Mohamad, A.; Lim, Y.; Saqib, M.; Shafie, S. Analytical solution for impact of Caputo-Fabrizio fractional derivative on MHD casson fluid with thermal radiation and chemical reaction effects. Fractal Fract. 2022, 6, 38. [Google Scholar] [CrossRef]
  13. Sene, N. Analytical solutions of a class of fluids models with the Caputo fractional derivative. Fractal Fract. 2022, 6, 35. [Google Scholar] [CrossRef]
  14. Zhu, C.G.; Kang, W.S. Numerical solution of Burgers-Fisher equation by cubic B-spline quasi-interpolation. Appl. Math. Comp. 2010, 216, 2679–2686. [Google Scholar] [CrossRef]
  15. Kashkari, B.; Syam, M. A numerical approach for investigating a special class of fractional Riccati equation. Results Phys. 2000, 17, 103080. [Google Scholar] [CrossRef]
  16. Abdelhakem, M.; Mahmoud, D.; Baleanu, D.; El-kady, M. Shifted ultraspherical pseudo-Galerkin method for approximating the solutions of some types of ordinary fractional problem. Adv. Differ. Equ. 2021, 2021, 110. [Google Scholar] [CrossRef]
  17. Coronel-Escamilla, A.; Gómez-Aguilar, J. A novel predictor–corrector scheme for solving variable-order fractional delay differential equations involving operators with Mittag–Leffler kernel. Discret. Contin. Dyn. Syst. Ser. 2020, 13, 561–574. [Google Scholar] [CrossRef] [Green Version]
  18. Daftardar-Gejji, V.; Sukale, Y.; Bhalekar, S. A new predictor-corrector method for fractional differential equations. Appl. Math. Comput. 2014, 244, 158–182. [Google Scholar] [CrossRef]
  19. Daftardar-Gejji, V.; Jafari, H. An iterative method for solving non linear functional equations. J. Math. Anal. Appl. 2006, 316, 753–763. [Google Scholar] [CrossRef] [Green Version]
  20. Gülsu, M.; Gürbüz, B.; Öztürk, Y.; Sezer, M. Laguerre polynomial approach for solving linear delay difference equations. Appl. Math. Comput. 2011, 217, 6765–6776. [Google Scholar] [CrossRef]
  21. Gürbüz, B.; Sezer, M. Laguerre polynomial solutions of a class of initial and boundary value problems arising in science and engineering fields. Acta Phys. Pol. 2000, 130, 194–197. [Google Scholar] [CrossRef]
  22. Gurbuz, B.; Sezerm, M. Laguerre polynomial approach for solving nonlinear Klein-Gordon equations. Malays. J. Math. Sci. 2017, 11, 191–203. [Google Scholar]
  23. Gurbuz, B.; Sezer, M. Modified operational matrix method for second-order nonlinear ordinary differential equations with quadratic and cubic terms. Int. J. Optim. Control Theor. Appl. 2020, 10, 218–225. [Google Scholar] [CrossRef]
  24. Kashkari, B.; Syam, M. Fractional-order Legendre operational matrix of fractional integration for solving the Riccati equation with fractional order. Appl. Math. Comput. 2016, 290, 281–291. [Google Scholar] [CrossRef]
  25. Gorenflo, R.; Luchko, Y. Operational method for solving generalized Abel integral equations of second kind. Integral Transform. Spec. Funct. 1997, 5, 47–58. [Google Scholar] [CrossRef]
  26. Hadid, S.B.; Luchko, Y.F. An operational method for solving fractional differential equations of an arbitrary real order. Panamer. Math. J. 1996, 6, 57–73. [Google Scholar]
  27. Lorenzo, C.F.; Hartley, T.T. Variable order and distributed order fractional operators. Nonlinear Dyn. 2002, 29, 57–98. [Google Scholar] [CrossRef]
  28. Samko, S.G.; Ross, B. Integration and differentiation to a variable fractional order. Integral Transform. Spec. Funct. 1993, 1, 277–300. [Google Scholar] [CrossRef]
  29. Samko, S. Fractional integration and differentiation of variable order: An overview. Nonlinear Dyn. 2013, 71, 653–662. [Google Scholar] [CrossRef]
  30. Naylor, A.W.; Sell, G.R. Linear Operator Theory in Engineering and Science, 2nd ed.; Applied Mathematical Sciences; Springer: New York, NY, USA; Berlin, Germany, 1982; Volume 40. [Google Scholar]
Figure 1. The graphs of z ( s ) and Z 5 ( s ) for Example 1.
Figure 1. The graphs of z ( s ) and Z 5 ( s ) for Example 1.
Fractalfract 06 00124 g001
Figure 2. The graphs z ( s ) and Z 5 ( s ) for Example 2.
Figure 2. The graphs z ( s ) and Z 5 ( s ) for Example 2.
Fractalfract 06 00124 g002
Figure 3. The graphs of z ( s ) and Z 10 ( s ) for Example 3.
Figure 3. The graphs of z ( s ) and Z 10 ( s ) for Example 3.
Fractalfract 06 00124 g003
Figure 4. The graphs of z ( s ) and Z 10 ( s ) for Example 4.
Figure 4. The graphs of z ( s ) and Z 10 ( s ) for Example 4.
Fractalfract 06 00124 g004
Table 1. Absolute error for Example 1.
Table 1. Absolute error for Example 1.
s | z ( s ) Z 5 ( s ) |
0 1.11022 × 10 16
0.1 1.11022 × 10 16
0.2 1.11022 × 10 16
0.3 1.11022 × 10 16
0.4 1.11022 × 10 16
0.5 1.11022 × 10 16
0.6 1.11022 × 10 16
0.7 1.11022 × 10 16
0.8 1.11022 × 10 16
0.9 1.11022 × 10 16
1.0 1.11022 × 10 16
Table 2. Absolute error for Example 2.
Table 2. Absolute error for Example 2.
s | z ( s ) Z 5 ( s ) |
 0 10 10
0.1 10 10
0.2 10 10
0.3 10 10
0.4 10 10
0.5 10 10
0.6 10 10
0.7 10 10
0.8 10 10
0.9 10 10
1.0 10 10
Table 3. Absolute error for Example 3.
Table 3. Absolute error for Example 3.
s | z ( s ) Z 10 ( s ) |
 0 10 7
0.1 1.0 × 10 7
0.2 1.0 × 10 7
0.3 5.3 × 10 7
0.4 5.0 × 10 7
0.5 4.3 × 10 7
0.6 1.9 × 10 7
0.7 1.0 × 10 7
0.8 3.1 × 10 7
0.9 4.1 × 10 7
1.0 4.9 × 10 7
Table 4. Absolute error for Example 4.
Table 4. Absolute error for Example 4.
s | z ( s ) Z 10 ( s ) |
 0 10 6
0.1 1.6 × 10 6
0.2 1.5 × 10 6
0.3 7.2 × 10 7
0.4 6.7 × 10 7
0.5 5.8 × 10 7
0.6 5.1 × 10 7
0.7 4.9 × 10 7
0.8 4.5 × 10 7
0.9 4.1 × 10 7
1.0 4.0 × 10 7
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Hashim, I.; Sharadga, M.; Syam, M.I.; Al-Refai, M. A Reliable Approach for Solving Delay Fractional Differential Equations. Fractal Fract. 2022, 6, 124. https://doi.org/10.3390/fractalfract6020124

AMA Style

Hashim I, Sharadga M, Syam MI, Al-Refai M. A Reliable Approach for Solving Delay Fractional Differential Equations. Fractal and Fractional. 2022; 6(2):124. https://doi.org/10.3390/fractalfract6020124

Chicago/Turabian Style

Hashim, Ishak, Mwaffag Sharadga, Muhammed I. Syam, and Mohammed Al-Refai. 2022. "A Reliable Approach for Solving Delay Fractional Differential Equations" Fractal and Fractional 6, no. 2: 124. https://doi.org/10.3390/fractalfract6020124

APA Style

Hashim, I., Sharadga, M., Syam, M. I., & Al-Refai, M. (2022). A Reliable Approach for Solving Delay Fractional Differential Equations. Fractal and Fractional, 6(2), 124. https://doi.org/10.3390/fractalfract6020124

Article Metrics

Back to TopTop