Startseite A numerical technique for a general form of nonlinear fractional-order differential equations with the linear functional argument
Artikel Open Access

A numerical technique for a general form of nonlinear fractional-order differential equations with the linear functional argument

  • Khalid K. Ali EMAIL logo , Mohamed A. Abd El salam und Emad M. H. Mohamed
Veröffentlicht/Copyright: 17. September 2020
Veröffentlichen auch Sie bei De Gruyter Brill

Abstract

In this paper, a numerical technique for a general form of nonlinear fractional-order differential equations with a linear functional argument using Chebyshev series is presented. The proposed equation with its linear functional argument represents a general form of delay and advanced nonlinear fractional-order differential equations. The spectral collocation method is extended to study this problem as a discretization scheme, where the fractional derivatives are defined in the Caputo sense. The collocation method transforms the given equation and conditions to algebraic nonlinear systems of equations with unknown Chebyshev coefficients. Additionally, we present a general form of the operational matrix for derivatives. A general form of the operational matrix to derivatives includes the fractional-order derivatives and the operational matrix of an ordinary derivative as a special case. To the best of our knowledge, there is no other work discussed this point. Numerical examples are given, and the obtained results show that the proposed method is very effective and convenient.

1 Introduction

Fractional differential equations have been of great interest for the past three decades. This is due to the intensive development of the theory of fractional calculus itself, as well as its applications. Apart from diverse areas of pure mathematics, fractional differential equations can be used in modeling of various fields of science and engineering such as rheology, self-similar dynamical processes, porous media, fluid flows, viscoelasticity, electrochemistry, control, electromagnetic and many other branches of science [1], [2], [3], [4], [5]. Delay differential equations were initially introduced in the 18th century by Laplace and Condorect [6]. However, the rapid development of the theory and applications of those equations did not come until after the Second World War and continues till today. Additionally, the numerical solution of delay and advanced differential equations of fractional order have been reported by many researchers [7], [8], [9], [10], [11], [12], [13], [14], [15]. Differential equations of advanced argument had fewer contributions in mathematics research, compared to delay differential equations, which had a great development in the last decade [16], [17], [18], [19], [20]. The equations with functional form of argument represent mixed type equations delay, proportional delay and advanced differential equation. All reported works considered a generalization of equations with functional argument with integer-order derivative or with fractional derivative in the linear case.

In this work, we introduce a general form of nonlinear fractional-order differential equations (GNFDEs) with linear functional argument.

(1) k = 0 n 1 i = 0 n 2 Q k , i ( x ) y k ( x ) y ( ν i ) ( p i x + ξ i ) + h = 1 n 3 j = 0 n 4 P h , j ( x ) y ( h ) ( x ) y ( α j ) ( q j x + ζ j ) = f ( x ) ,

where ∈ [a, b], Q k,i (x), P h,j (x), f(x) are well-defined known functions, a , b , p i , ξ i , q j , ζ j , where p i , q j  ≠ 0,  ν i  ≥ 0, α j  ≥ 0 and i−1 < ν i  ≤ i, j−1 < α j  ≤ j, n i , under the conditions

(2) y ( i ) ( η i ) = μ i , i = 0,1,2... , m 1 ,

where η i  ∈ [a, b] and m is the greatest integer-order derivative existing or the highest integer order greater than the fractional derivative. The GNFDE (1) contains at least three different arguments, and then, the following corollary defines the interval that the independent variable x belongs. Chebyshev polynomials of the first kind are used here in this work to approximate the solution of proposed Equation (1). The Chebyshev polynomials are defined on [−1, 1].

Corollary 1.1.

The independent variable x of (1) belongs to [a, b], which is the intersection of the intervals of the different arguments and [−1, 1],

i.e. x [ a , b ] = [ 1 + ξ i p i , 1 + ξ i p i ] [ 1 + ζ j q j , 1 + ζ j q j ] [ 1,1 ]

2 General notations

In this section, some definitions and properties for the fractional derivative are listed.

2.1 The fractional derivative definition

The Caputo fractional derivative operator D υ of order υ is defined in the following form:

(3) D υ G ( x ) = 1 Γ ( n υ ) 0 x G ( n ) ( t ) ( x t ) υ n + 1 d t , υ > 0 ,

where x > 0 , n 1 < υ n , n 0 , and 0 = { 0 } .

  1. D υ i = 0 m λ i G i ( x ) = i = 0 m λ i D υ G i ( x ) , where  λ i and υ are constants.

  2. The Caputo fractional differentiation of a constant is zero.

  3. D υ x k = { 0 , for k 0 and k < υ Γ ( k + 1 ) x k υ Γ ( k + 1 υ ) ,   for k 0 and k υ ,where υ denotes to the smallest integer greater than or equal to υ .

3 Procedure solution using the collocation method

The solution y(x) of (1) may be expanded by Chebyshev polynomials series of the first kind as follows [21]:

(4) y ( x ) = n = 0 c n T n ( x ) ,

by truncate the series (4) to N, where N < ∞, and then, the approximate solution is expressed in the following form:

(5) y ( x ) n = 0 N c n T n ( x ) = T ( x ) C ,

where T(x) and C are matrices given by the following equation:

T ( x ) = [ T 0 ( x ) T 1 ( x ) T N ( x ) ] , C = [ 1 2 c 0 , c 1 , c 2 , , c N ] T .

Now, relation (5) may written in the following form:

(6) y ( x ) = X ( x ) W T C ,

where W is square lower triangle matrix with size (+ 1) × (N + 1) given by the following equation:

(7) W i j = { 1 , if i = j = 0 ( 1 ) k 2 i 2 k i i k ( i k k ) , if i + j even and j i , 0 , if j > i , i + j odd .

where

k = { i 2 , , 1,0 , for even i i 1 2 , , 1,0 , for odd i

For example, if N = 4 and N = 5,

W = ( 1 0 0 0 0 0 1 0 0 0 1 0 2 0 0 0 3 0 4 0 1 0 8 0 8 ) N = 4 , W = ( 1 0 0 0 0 0 0 1 0 0 0 0 1 0 2 0 0 0 0 3 0 4 0 0 1 0 8 0 8 0 0 5 0 20 0 16 ) N = 5 .

Then, by substituting from (5) in (1), we get the following equation:

(8) k = 0 n 1 i = 0 n 2 Q k , r ( x ) ( T ( x ) C ) k D ν i T ( p i x + ξ i ) C + k = 1 n 3 i = 0 n 4 P h , j ( x ) ( T ( h ) ( x ) C ) D α j T ( q j x + ζ j ) C = f ( x ) ,

we can write (8) as follows:

(9) [ k = 0 n 1 i = 0 n 2 Q k , r ( x ) ( T ( x ) C ) k D ν i T ( p i x + ξ i ) + h = 1 n 4 j = 0 n 4 P h , j ( x ) ( T ( h ) ( x ) C ) D α j T ( q j x + ζ j ) ] C = f ( x ) ,

the collocation points is defined in the following form:

(10) x l = l h + a ,

where

h = b a N , l = 0,1,2 , , N .

By substituting the collocation points (10) in (9), we get the following equation:

(11) [ k = 0 n 1 i = 0 n 2 Q k , i ( x l ) ( T ( x l ) C ) k D ν i T ( p i x + ξ i ) + h = 1 n 4 j = 0 n 4 P h , j ( x l ) ( T ( h ) ( x l ) C ) D α j T ( q j x + ζ j ) ] C = f ( x l ) .

In the following theorem, we introduce a general form of operational matrix of the row vector T ( x ) in the representation as (6), such that the process includes the fractional-order derivatives, and ordinary operational matrix given as a special case when α i  →⌈ α i ⌉.

Theorem 1.

Assume that, the Chebyshev row vector T(x) is represented as (6), then the order fractional derivative of the vector D α i T ( x ) is given as follows:

(12) D α i T ( x ) = X α i ( x ) B α i W T ,

where

(13) X α i ( x ) = [ x α i + i x 1 α i + i x 2 α i + i x N 1 α i + i ] , i 1 < α i i ,

where B αi is (N + 1) × (N + 1) square upper diagonal matrix, and the elements b r,s of B αi can be written as follows:

(14) { b r , r + i = Γ ( r + i + 1 ) Γ ( r + i α i ) r , s = 0,1,2 , , N 0 otherwise ,

where i 1 < α i i , N α i .

Proof.

since

(15) D α i T ( x ) = D α i [ 1 x x 2 x N ] W T , = X α i B α i W T ,

if 0 < α 1 1 , using Caputo’s fractional properties, then we get

(16) X α 1 = [ x 1 α 1 x 2 α 1 x 3 α 1 x N + 1 α 1 ] ,

(17) B α 1 = ( 0 2 Γ 2 α 1 ) 0... 0 0 0 Γ ( 3 ) Γ ( 3 α 1 ) 0 0 0 0.. Γ ( N ) Γ ( N α 1 ) 0 0 0.. 0 ) ,

as α 1 → 1, the system reduced to the ordinary case (B α1 → B), see [21].

Also 1 < α 2 2 , then

(18) X α 2 = [ x 2 α 2 x 3 α 2 x 4 α 2 x N + 2 α 2 ] ,

(19) B α 2 = ( 0 0 3 ( Γ 3 α 2 ) 0 0 0 0 0 Γ ( 4 ) Γ ( 4 α 2 ) 0 0 0 0.. 0 Γ ( N ) Γ ( N α 2 ) 0 0 0.. 0 0 0 0 0.. 0 0 ) ,

as α 2 2 , the system reduced to the ordinary case (B α2 → B 2), see [21].

By the same way, if we take 2 < α 3 3 , then

(20) X α 3 = [ x 3 α 3 x 4 α 3 x 5 α 3 x N + 3 α 3 ] ,

(21) B α 3 = ( 0 0 0 4 ( Γ 4 α 3 ) 0 0 0 0 0 0 Γ ( 5 ) Γ ( 5 α 3 ) 0 0 0 0.. 0 0 Γ ( N ) Γ ( N α 3 ) 0 0 0.. 0 0 0 0 0 0.. 0 0 0 0 0 0.. 0 0 0 ) ,

as α 3 → 3, the system reduced to the ordinary case (B α3 → B 3), see [21]. By induction, i 1 < α i i , then

(22) X α i ( x ) = [ x α i + i x 1 α i + i x 2 α i + i x N 1 α i + i ] , i 1 < α i i ,

and B αi as in (14), where the proposed operational matrix represents a kind of unification of ordinary and fractional case.

Now, we give the matrices representation for all terms in (11) as the representation (12).

*The first nonlinear term in (11) can be written as follows:

(23) k = 0 n 1 i = 0 n 2 Q k , i ( x l ) ( T ( x l ) C ) k D ν i T ( p i x l + ξ i ) = k = 0 n 1 i = 0 n 2 Q k , i ( x l ) ( X ¯ W ¯ T C ¯ ) k X ν i B ν i H p i E ξ i W T C ,

where

X ¯ = ( X ( x 0 ) 0 0... 0 0 X ( x 1 ) 0... 0 0 0 X ( x 2 ) 0 0 0 0... X ( x N ) ) , W ¯ T = ( W T 0 0... 0 0 W T 0... 0 0 0 W T 0 0 0 0... W T ) , C ¯ = ( C 0 0... 0 0 C 0... 0 0 0 C 0 0 0 0... C ) .

and H pi is the square diagonal matrix of the coefficients for the linear argument, and the elements of H pi can be written as follows:

h r s = { 0 if r s ; p i r if r = s

And E ξi is the square upper triangle matrix for the shift of the linear argument, and the form of E ξi is given as follows:

E ξ i = ( ( 0 0 ) ( ξ i ) 0 ( 1 0 ) ( ξ i ) 1 0 ( 2 0 ) ( ξ i ) 2 0 ( N 0 ) ( ξ i ) N 0 0 ( 1 1 ) ( ξ i ) 1 1 ( 2 1 ) ( ξ i ) 2 1 ( N 1 ) ( ξ i ) N 1 0 0 ( 2 2 ) ( ξ i ) 2 2 ( N 2 ) ( ξ i ) N 2 0 0 0 ( N N ) ( ξ i ) N N ) .

*The second nonlinear term in (11) can be written as follows:

(24) h = 1 n 3 j = 0 n 4 P h , j ( x l ) ( T ( h ) ( x l ) C ) D α j T ( q j x l + ζ j ) = h = 1 n 3 j = 0 n 4 P h , j ( x l ) ( X ¯ B ¯ h W ¯ T C ¯ ) X α j B α j H P i E ζ j W T C ,

where

B ¯ h = ( 0 B h 0... 0 0 0 B h 0 0 0 0.. B h 0 0 0.. 0 ) ,

and B h is the same as B αi when h = ⌈α i ⌉.

The matrix representation for the variable coefficients takes the following form:

Q i , j = ( Q i , j ( x 1 ) 0 0 0 0 Q i , j ( x 2 ) 0 0 0 0 0 Q i , j ( x N ) ) .

Now, by substituting from (23), (24) into (11) and then, we have the following fundamental matrix equation:

(25) [ k = 0 n 1 i = 0 n 2 Q k , i ( x ) ( X ¯ W ¯ T C ¯ ) k X ν i B ν i H P i D ξ i W T + h = 1 n 3 j = 0 n 4 P h , j ( x ) ( X ¯ B ¯ h W ¯ T C ¯ ) X α j B α j H q j E ζ j W T ] C = F.

We can write (25) in the following form:

(26) U C = F , or [ U ; F ] ,

where

(27) U = k = 0 n 1 i = 0 n 2 Q k , i ( x ) ( X ¯ W ¯ T C ¯ ) k X ν i B ν i H P i E ξ i W T + h = 1 n 3 j = 0 n 4 P h , j ( x ) ( X ¯ B ¯ h W ¯ T C ¯ ) X α j B α j H q j E ζ j W T ,

F = ( f ( x 0 ) f ( x 1 ) f ( x N ) ) .

Corollary 3.1.

Suppose k 2 , then the matrix representation for the terms free of derivatives in (1), by using (5), we obtain the following term:

(28) y k ( x ) = y k 1 ( x ) y ( x ) = ( X ( x ) W T C ) k 1 X ( x ) W T C .

we can obtain the matrix form for (28) by using the collocation points as follows:

(29) y k ( x ) = ( X ¯ W ¯ T C ¯ ) k 1 X W T C .

*we can obtain the matrix form for the conditions (2) by using (5) on the form:

(30) X ( η i ) B i W T C = μ i , i = 0,1,2... , m 1 ,

or

(31) M i C = [ μ i ] ,

where

M i = X ( η i ) B i W T .

Consequently, replacing m rows of the augmented matrix [U;F] by rows of the matrix [M i ;μ i ], we have [ U ¯ ; F ¯ ] or

U ¯ C = F ¯ .

The system (25), together with conditions, give (N + 1) nonlinear algebraic equations which can be solved, for the unknown c n , n = 0, 1, 2, …, N. Consequently y(x) given as Equation (5) can be calculated.

4 Numerical results

In this section, five examples are given to demonstrate the applicability and the accuracy of the present method. All results are obtained by using Mathematica 7 programming.

Example 1.

Consider the following nonlinear fractional differential equation (NFDE) with linear functional argument:

(32) y 2 ( x ) D ν 2 y ( x ) + y 2 ( x ) y ( 2 x + 1 ) + y 4 ( x ) + y ( x ) D α 2 y ( x ) = f ( x ) , x [ 0 , 1 ] .

The initial conditions are y(0) = 0, y′(0) = 1, and the exact solution is y(x) = x 2+x at ν 2 = 1.7, α 2 = 1.5 where f(x) = 2.25676x 0.5 (1 + 2x) + 2.22849x 0.3 (x 2)2 + (x 2)4 + (x 2)2 (2 + 4 (1 + 2x)). We apply the suggested method with N = 3, and by the fundamental matrix equation of the problem defined in (25), we have the following equation:

(33) [ Q 2,2 ( X ¯ W ¯ T C ¯ ) 2 X ν 2 B ν 2 W T + Q 2,0 ( X ¯ W ¯ T C ¯ ) 2 X H 2 E 1 ( W ) T + Q 3,0 ( X ¯ W ¯ T C ¯ ) 3 X W T + P 1,2 ( X ¯ W ¯ T B ¯ 1 C ¯ ) X α 2 B α 2 W T ] C = F.

Equation (33) and the initial conditions present nonlinear system of (N + 1) algebraic equations in the coefficients c i . By solving it by using the Newton iteration method with suitable initial solution we obtain the following equation:

c 0 = 1 2 , c 1 = 1 , c 2 = 1 2 , c 3 = 0 .

Therefore, the approximate solution of this example using (5) is given as follows:

(34) y 3 ( x ) = 1 2 T 0 ( x ) + T 1 ( x ) + 1 2 T 2 ( x ) = x 2 + x ,

which is the exact solution of the problem (32)

where

X = ( 1 0 0 0 1 1 3 1 9 1 27 1 2 3 4 9 8 27 1 1 1 1 ) , B 1 = ( 0 1 0 0 0 0 2 0 0 0 0 3 0 0 0 0 ) , W = ( 1 0 0 0 0 1 0 0 1 0 2 0 0 3 0 4 ) ,

F = ( 0 4.23912 22.2515 87.6842 ) , X α 2 = ( 0 0 0 0 0.57735 0.19245 0.06415 0.0213833 0.816497 0.544331 0.362887 0.241925 1 1 1 1 ) .

H 2 = ( 2 0 0 0 0 4 0 0 0 0 8 0 0 0 0 16 ) , B α 2 = ( 0 0 2.25676 0 0 0 0 4.51352 0 0 0 0 0 0 0 0 ) ,

E 1 = ( 1 1 1 1 0 1 2 3 0 0 1 3 0 0 0 1 ) , B ν 2 = ( 0 0 2.22849 0 0 0 0 5.14266 0 0 0 0 0 0 0 0 ) ,

X ¯ = ( 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 3 1 9 1 27 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 2 3 4 9 8 27 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 ) ,

X ν 2 = ( 0 0 0 0 0.719223 0.239741 0.0799137 0.0266379 0.885467 0.590312 0.393541 0.262361 1 1 1 1 ) ,

W ¯ T = ( 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 4 )

Example 2.

Consider the following nonlinear fractional delay differential equation [22], [23]:

(35) D ν y ( x ) y ( x 0.5 ) + y 3 ( x ) = 2 Γ ( 1.5 ) x 0.5 ( x 0.5 ) 2 x 6 , x [ 0,0.5 ] .

The initial conditions are y(0) = 0, y′(0) = 0, and the exact solution is y(x) = x 2, at ν = 1.5 and f ( x ) = 2 Γ ( 1.5 ) x 0.5 ( x 0.5 ) 2 x 6 . We apply the suggested method with N = 9, and by the fundamental matrix equation of the problem defined in (25), we have the following equation:

(36) [ Q 0,2 X ν 2 B ν 2 W T + Q 0,0 X E 0.5 W T + Q 2,0 ( X ¯ W ¯ T C ¯ ) 2 . X W T ] C = F .

Equation (36) and the subjected conditions present non-linear system of (N + 1) algebraic equations in the coefficients c i . By solving it by using the Newton iteration method with suitable initial solution, we obtain the following equation:

(37) c 0 = 1 2 , c 1 = 2.9399 × 10 12 , c 2 = 1 2 , c 3 = 2.24153 × 10 12 c 4 = 1.61475 × 10 12 , c 5 = 9.54298 × 10 13 , c 6 = 4.35992 × 10 13 , c 7 = 1.45438 × 10 13 , c 8 = 3.1698 × 10 14 , c 9 = 3.47446 × 10 15 .

therefore, the approximate solution of this example using (5) is given as follows:

(38) y 9 ( x ) = 1 2 T 0 ( x ) 2.9399 × 10 12 T 1 ( x ) + 1 2 T 2 ( x ) + 3.47446 × 10 15 T 9 ( x ) .

The comparison between maximum absolute errors for the proposed method and the results obtained by Haar wavelet [23] listed in Table 1.

Table 1:

Comparison between maximum absolute errors for our proposed method and the results obtained by Haar wavelet [23].

N Maximum absolute errors of the proposed method Maximum absolute errors (Haar wavelet [23])
2 1.585 × 10−12 1.6 × 10−1
4 1.000 × 10−12 1.5 × 10−1
8 5.000 × 10−13 1.2 × 10−1

Example 3.

Consider the following linear initial value problem [24], [25]:

(39) D ν y ( x ) + 2 y 2 ( x 2 ) = 1.

The subjected initial conditions are y(0) = 1, y′(0) = 0, and the exact solution is given by: y(x) = cos(x) at ν = 2. The fundamental matrix equation of the problem is defined as follows:

(40) [ Q 0,2 ( x ) X ν 2 B ν 2 W T + Q 2,0 ( X ¯ H ¯ 0.5 W ¯ T C ¯ ) X W T ] C = F .

The approximate solution y N (x) introduced by the present method with = 10 is given as follows:

(41) C = [ 0.76519 1.71389 × 10 7 0.22980 1.034 × 10 7 0.00495 3.602 × 10 8 0.000041 6.439 × 10 9 1.9040 × 10 7 4.315 × 10 10 4.707 × 10 10 ] .

Then, the solution of the problem (39) is given as follows:

(42) y 10 ( x ) = 0.76519 T 0 ( x ) 1.71389 × 10 7 T 1 ( x ) 0.22980 T 2 ( x ) 1.034 × 10 7 T 3 ( x ) + 0.00495 T 4 ( x ) 3.602 × 10 8 T 5 ( x ) 0.000041 T 6 ( x ) 6.439 × 10 9 T 7 ( x ) + 1.9040 × 10 7 T 8 ( x ) 4.315 × 10 10 T 9 ( x ) 4.707 × 10 10 T 10 ( x ) .

Table 2 displays the comparison of the absolute errors of the present method for N = 10 and ν = 2 with the modified Laguerre wavelets method of Iqbal et al [25] for N = 20 and the Muntz–Legendre wavelet method of Rahimkhani et al [24] for N = 5. We see that the present method is more accurate than the modified Laguerre wavelets and Muntz–Legendre wavelet methods. The computational results for N = 10 and different values of ν are given in Figure 1.

Table 2:

Comparison of the absolute errors for example 3 at ν = 2.

x Present method N = 10 Reference [24] N = 5 Reference [25] N = 20
0.1 9.52 × 10−13 7.41 × 10−6 2.11 × 10−8
0.2 2.16 × 10−12 1.14 × 10−5 2.08 × 10−8
0.3 3.33 × 10−12 1.34 × 10−5 2.09 × 10−8
0.4 4.43 × 10−12 1.65 × 10−5 2.08 × 10−8
0.5 5.45 × 10−12 2.07 × 10−5 2.06 × 10−8
Figure 1: 
The numerical results of y

N
(x) for N = 10 and ν = 2, 1.8, 1.7 and 1.6 for example 3.
Figure 1:

The numerical results of y N (x) for N = 10 and ν = 2, 1.8, 1.7 and 1.6 for example 3.

Example 4.

Consider the following nonlinear fractional differential equation with argument:

(43) y ( x ) D α 2 y ( x ) + y 2 ( x ) D ν 2 y ( 2 x 1 ) + y ( x ) = f ( x ) , x [ 0,1 ] .

The initial conditions are y(0) = 1, y′(0) = 1, and the exact solution is y(x) = x 3+1 at α 2 = 1.5, ν 2 = 2 where f(x) = 27.0811x 2.5 + 6 (−1 + 2x)2 + 24 (−1 + 2x) (1 + x 3)2. We apply the suggested method with N = 3, and approximating the solution as in (5) and by the same procedure in the previous section and by using (25), we have the following equation:

(44) [ P 2,2 ( X ¯ W ¯ T C ¯ ) 2 X α 2 B α 2 W T + Q 2,2 ( X ¯ W ¯ T C ¯ ) 2 X ν 2 B ν 2 H 2 E 1 W T + P 1,0 ( X ¯ B ¯ W ¯ T C ¯ ) X 1 B 1 H 3 W T ] C = F.

Equation (44) and the subjected initial conditions present non-linear system of (+ 1) algebraic equations in the coefficients c i . By solving it by using the Newton iteration method with suitable initial solution, we obtain the following equation:

c 0 = 3 4 , c 1 = 0 , c 2 = 1 4 , c 3 = 0 .

Therefore, the approximate solution of this example using (5) is given as follows:

(45) y 4 ( x ) = 3 4 T 0 ( x ) + 1 4 T 2 ( x ) = x 3 + 1 ,

which is the exact solution of the problem (43)

Example 5.

Consider the fractional nonlinear neutral delay differential equation [26]:

(46) y ν ( x ) 1 2 y ( x ) 1 2 y ( x 2 ) y ν ( x 2 ) = f ( x ) , 0 < ν 1 , 0.5 x 0.5 ,

the initial conditions are y(0) = 1, and the exact solution is y(x) = e x at ν=1, where f ( x ) = 1 4 e x . We apply the suggested method with N = 10, and by approximating the solution as in (5) and by the same procedure in the previous section and by using (25), we have the following equation:

(47) [ Q 0,1 X ν B ν W T + Q 1,0 X W T + Q 1,1 ( X ¯ H 0.5 ¯ W ¯ T C ¯ ) . X ν B ν H 0.5 W T ] C = F .

Equation (47) and the initial condition present non-linear system of (+ 1) algebraic equations in the coefficients c i . By solving it by using the Newton iteration method with suitable initial solution, we obtain the following equation:

(48) c 0 = 1.26606 , c 1 = 1.13032 , c 2 = 0.271493 , c 3 = 0.0443388 , c 4 = 0.00547301 , c 5 = 0.000543584 , c 6 = 0.0000446812 , c 7 = 3.30673 × 10 6 , c 8 = 1.68806 × 10 7 , c 9 = 1.68675 × 10 8 .

Therefore, the approximate solution of this example using (5) is given as follows:

(49) y 9 ( x ) = 1.26606 T 0 ( x ) + 1.13032 T 1 ( x ) + 0.271493 T 2 ( x ) + 1.68675 × 10 8 T 9 ( x ) .

Table 3 shows the comparison of the absolute errors between the exact and approximate solutions of our method for N = 9, ν = 1 by the Hermite wavelets method (HWM) and the method proposed in [26].

Table 3:

Comparison of the absolute errors for example 5 at N=9.

x Our method HWM Reference [26]
0 2.22 × 10−16 0 0
0.1 6.06 × 10−12 1.33 × 10−11 5.38 × 10−12
0.2 7.06 × 10−12 3.93 × 10−12 1.15 × 10−11
0.3 7.74 × 10−12 2.84 × 10−11 2.14 × 10−11
0.4 8.69 × 10−12 1.27 × 10−11 6.30 × 10−12

Figure 2: 
Comparison of y(x) for N = 9 with ν = 1, 0.97, 0.95, 0.93 for example 5 and the exact solution.
Figure 2:

Comparison of y(x) for = 9 with ν = 1, 0.97, 0.95, 0.93 for example 5 and the exact solution.

The comparison of the approximate values of y(x) for N = 9 with different values of v and the exact solution given in Figure 2.

5 Conclusion

In the end, we introduced a numerical study for a general form of nonlinear fractional-order differential equations with linear functional argument using Chebyshev series. In this work, we have presented a general form of the operational matrix for derivatives. The fractional-order derivatives and the ordinary operational matrix had been obtained from the proposed general form of the operational matrix for derivatives. There are no authors who have discussed this point previously in their works. We have presented many numerical examples that greatly illustrate the accuracy of the study presented to the proposed equation and also show how that the proposed method is very effective and convenient.


Corresponding author: Khalid K. Ali, Department of Mathematics, Faculty of Science, Al-Azhar University, Cairo, Egypt, E-mail: ,

  1. Author contribution: All the authors have accepted responsibility for the entire content of this submitted manuscript and approved submission.

  2. Research funding: None declared.

  3. Conflict of interest statement: The authors declare no conflicts of interest regarding this article.

References

[1] L. Gaul, P. Klein, and S. Kempfle, “Damping description involving fractional operators,” Mech. Systems Signal Process., vol. 5, pp. 81–88, 1991, https://doi.org/10.1016/0888-3270(91)90016-x.Suche in Google Scholar

[2] W. G. Glockle and T. F. Nonnenmacher, “A fractional calculus approach to self-similar protein dynamics,” Biophys. J., vol. 68, pp. 46–53, 1995, https://doi.org/10.1016/s0006-3495(95)80157-8.Suche in Google Scholar

[3] J. H. He, “Approximate analytical solution for seepage flow with fractional derivatives in porous media, Comput,” Methods Appl. Mech. Engrg., vol. 167, pp. 57–68, 1998, https://doi.org/10.1016/s0045-7825(98)00108-x.Suche in Google Scholar

[4] J. H. He, “Some applications of nonlinear fractional differential equations and their approximation,” Bull. Sci. Technol., vol. 15, no. 2, pp. 86–90, 1999.Suche in Google Scholar

[5] R. Metzler, W. Schick, H.-G. Kilian, and T. F. Nonnenmacher, “Relaxation in filled polymers: a fractional calculus approach,” J. Chem. Phys., vol. 103, pp. 7180–7186, 1995, https://doi.org/10.1063/1.470346.Suche in Google Scholar

[6] A. G. Ulsoy and F. M. Asl, Analysis of a System of Linear Delay Differential Equations, vol. 125, Ann Arbor MI, Mechanical Engineering Department, University of Michigan, 2003, pp. 48019–2125.Suche in Google Scholar

[7] C Oğuz and M Sezer, “Chelyshkov collocation method for a class of mixed functional integro-differential equations,” Appl. Math. Comput., vol. 259, pp. 943–954, 2015, https://doi.org/10.1016/j.amc.2015.03.024.Suche in Google Scholar

[8] A. M. S. Mahdy, “Numerical studies for solving fractional integro-differential equations,” J. Ocean Eng. Sci., vol. 3, no. 2, pp. 127–132, 2018, https://doi.org/10.1016/j.joes.2018.05.004.Suche in Google Scholar

[9] Y. A. Amer, A. M. S. Mahdy, and E. S. M. Youssef, “Solving fractional integro-differential equations by using Sumudu transform method and Hermite Spectral Collocation Method,” Comput. Mater. Con., vol. 54, no. 2, pp. 161–180, 2018, https://doi.org/10.3970/cmc.2018.054.161.Suche in Google Scholar

[10] A. M. S. Mahdy, N. H. Sweilam, and M. Higazy, “Approximate solutions for solving nonlinear fractional-order smoking model,” Alex. Eng. J., vol. 59, no. 2, pp. 739–752, 2020, https://doi.org/10.1016/j.aej.2020.01.049.Suche in Google Scholar

[11] A. Saadatmandi and M. Dehghan, “Numerical solution of the higher-order linear Fredholm integro-differential-difference equation with variable coefficients,” Comput. Math. Appl., vol. 59, no. 8, pp. 2996–3004, 2010, https://doi.org/10.1016/j.camwa.2010.02.018.Suche in Google Scholar

[12] O. K. Kürkcü, E. Aslan, and M. Sezer, “A numerical approach with error estimation to solve general integro-differential-difference equations using Dickson polynomials,” Appl. Math. Comput., vol. 276, pp. 324–339, 2016, https://doi.org/10.1016/j.amc.2015.12.025.Suche in Google Scholar

[13] M. Gülsu, Y. Öztürk, and M. Sezer, “A new collocation method for solution of mixed linear integro-differential-difference equations,” Appl. Math. Comput., vol. 216, no. 7, pp. 2183–2198, 2010, https://doi.org/10.1016/j.amc.2010.03.054.Suche in Google Scholar

[14] Ş Yüzbaşı, “Laguerre approach for solving pantograph-type Volterra integro-differential equations,” Appl. Math. Comput., vol. 232, pp. 1183–1199, 2014, https://doi.org/10.1016/j.amc.2014.01.075.Suche in Google Scholar

[15] Ş Yüzbaşı and N. Ismailov, “A Taylor operation method for solutions of generalized pantograph type delay differential equations,” Turk. J. Math., vol. 42, no. 2, pp. 395–406, 2018, https://doi.org/10.3906/mat-1506-71.Suche in Google Scholar

[16] V. Iakovleva and C. J. Vanegas, “On the solution of differential equations with delayed and advanced arguments,” Electron. J. Differ. Equ., vol. 13, pp. 57–63, 2005.Suche in Google Scholar

[17] I. A. Rus and V. A. Darzu-Ilea, “First order functional-differential equations with both advanced and retarded arguments,” Fixed Point Theory, vol. 5, no. 1, pp. 103–115, 2004.Suche in Google Scholar

[18] Z. Liu, J. Sun and I. Szanto, “Monotone iterative technique for Riemann Liouville fractional integro-differential equations with advanced arguments,” Results Math., vol. 63, no. 3–4, pp. 1277–1287, 2013, https://doi.org/10.1007/s00025-012-0268-4.Suche in Google Scholar

[19] N. şahin, ş. Yüzbaşi, and M. Sezer, “A Bessel polynomial approach for solving general linear Fredholm integro-differential-difference equations,” Int. J. Comput. Math., vol. 88, no. 14, pp. 3093–3111, 2011, https://doi.org/10.1080/00207160.2011.584973.Suche in Google Scholar

[20] K. R. Raslan, K. K. Ali, M. A. Abd El salam, and E. M. H. Mohamed, “Spectral Tau method for solving general fractional order differential equations with linear functional argument,” J. Egypt. Math. Soc., vol. 27, no. 1, p. 33, 2019, https://doi.org/10.1186/s42787-019-0039-4.Suche in Google Scholar

[21] K. K. Ali, M. A. Abd El Salam, and E. M. Mohamed, “Chebyshev operational matrix for solving fractional order delay-differential equations using spectral collocation method,” Arab. J. Basic Appl. Sci., vol. 26, no. 1, pp. 342–353, 2019, https://doi.org/10.1080/25765299.2019.1629543.Suche in Google Scholar

[22] M. M. Khader and A. S. Hendy, “The approximate and exact solutions of the fractional-order delay differential equations using Legendre seudospectral method,” Int. J. Pure Appl. Math., vol. 74, no. 3, pp. 287–297, 2012.Suche in Google Scholar

[23] I Aziz, R Amin, and J Majak, “Numerical solution of A class of fractional delay definition equation via Haar wavelet,” Appl. Math. Model., vol. 40, no. 23, 2016, https://doi.org/10.1016/j.apm.2016.07.018.Suche in Google Scholar

[24] P. Rahimkhani, Y. Ordokhani, and E. Babolian, “Müntz-Legendre wavelet operational matrix of fractional-order integration and its applications for solving the fractional pantograph differential equations,” Numer. Algorithms, vol. 77, no. 4, pp. 1283–1305, 2017, https://doi.org/10.1007/s11075-017-0363-4.Suche in Google Scholar

[25] M.A. Iqbal, U. Saeed, and S.T. Mohyud-Din, “Modified Laguerre wavelets method for delay differential equations of fractional-order,” Egy. J. Basic Appl. Sci., vol. 2, pp. 50–54, 2015, https://doi.org/10.1016/j.ejbas.2014.10.004.Suche in Google Scholar

[26] U Saeed, “Hermite wavelet method for fractional delay differential equations,” J. Differ. Equ., 2014, https://doi.org/10.1155/2014/359093.Suche in Google Scholar

Received: 2019-11-12
Accepted: 2020-07-23
Published Online: 2020-09-17
Published in Print: 2021-02-23

© 2020 Khalid K. Ali et al., published by De Gruyter, Berlin/Boston

This work is licensed under the Creative Commons Attribution 4.0 International License.

Heruntergeladen am 23.9.2025 von https://www.degruyterbrill.com/document/doi/10.1515/ijnsns-2019-0281/html
Button zum nach oben scrollen