Next Article in Journal
Finite-Time Projective Synchronization in Fractional-Order Inertial Memristive Neural Networks: A Novel Approach to Image Encryption
Previous Article in Journal
Application of an Optimal Fractional-Order Controller for a Standalone (Wind/Photovoltaic) Microgrid Utilizing Hybrid Storage (Battery/Ultracapacitor) System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Error Analysis Study for the Distributed-Order Time-Fraction Model Using an Efficient Numerical Method

1
Institute of Computing Science and Technology, Guangzhou University, Guangzhou 510006, China
2
School of Computer Science of Information Technology, Qiannan Normal University for Nationalities, Duyun 558000, China
3
Department of Industrial Engineering, Apadana Institute of Higher Education, Shiraz 7187985443, Iran
*
Author to whom correspondence should be addressed.
Fractal Fract. 2024, 8(11), 630; https://doi.org/10.3390/fractalfract8110630
Submission received: 15 September 2024 / Revised: 18 October 2024 / Accepted: 24 October 2024 / Published: 25 October 2024

Abstract

In this paper, we propose a numerical scheme based on the shifted Legendre polynomials for solving the forced Korteweg–de Vries (fKdV) equation including a Caputo fractional operator of a distributed order. To obtain numerical solutions of these types of equations, we derive an operational matrix based on the shifted Legendre polynomials, and using this operational matrix, their equations change to a set of nonlinear algebraic systems. Then, by calculating these systems in the collocation points, we solve systems. Also, convergence and error are investigated in this paper. Finally, several numerical examples to show the applicability of our scheme are displayed.

1. Introduction

This manuscript studies a numerical method based on an efficient numerical method to solve the following model:
D t ϱ μ C u ( x , t ) + 1 2 ( u 2 ( x , t ) ) x + β u x x x ( x , t ) = α f x ( x , t ) , u ( x , 0 ) = u 0 ( x ) ,
in which D t ϱ μ C u ( x , t ) is the distributed-order fractional operator and is defined by
D t ϱ μ C u ( x , t ) = ν 1 ν 2 ϱ μ D t μ u ( x , t ) d μ , ν 1 , ν 2 > 0 ,
where ϱ μ is the weight function. Also, in Formula (2), D t μ u ( x , t ) is the Caputo fractional operator which is defined by [1,2,3,4,5]:
D t μ u ( x , t ) = 1 Γ ( 1 μ ) 0 t 1 ( t τ ) μ u τ ( x , τ ) d τ .
The overall shape of a Tsunami propagation equation is given in [6] by
η t η ( x , t ) + c η x c ( g h ) 1 2 + α η η x α = 3 c 2 h 0 + β η x x x β = c 6 h 0 2 = f x f = c 2 z ( x , t ) ,
where η , z , h , c and g are known functions. In this article, we consider the two case for the function f x ( x , t ) , as follows:
  • When in Equation (4), f x ( x , t ) = 0 , then the Tsunami propagation Equation (4) changes to a Korteweg–de Vries equation.
  • When in Equation (4), f x ( x , t ) 0 , then the Tsunami propagation Equation (4) changes to a forced KdV equation where f x ( x , t ) 0 is the force part.
By inserting the variable u ( x , t ) with the value c + α η ( x , t ) in the relation (4), we have
u ( x , t ) t + 1 2 ( u 2 ( x , t ) ) x + β u x x x ( x , t ) = α f x ( x , t ) ,
in which Equation (5) is a hydrodynamic form of the Tsunami generation used to demonstrate the governing equations [7,8]. We can also find different forms of this type of equation in [9,10]. In [8], the authors were able to obtain an analytical solution for this type of equation by considering diverse values of the known function f ( x , t ) . The forced Korteweg–de Vries shows a large multiplicity of nonlinear equations in various fields of physics, chemistry, and engineering. A physical interpretation for this type of model can be considered for the case where the time-fractional operators act on multiple time scales. One of the important applications of the time-fractional model can be considered in a medium in which there is no fixed scaling exponent. For example, we can introduce multi-fractal medium in which there are memory effects on multiple time scales [11]. In this study, we apply a numerical approach based on the shifted Legendre polynomials for solving Equation (2). Also, the obtained numerical approach involves a matrix operator of the distributed-order fractional derivative. One of the important and basic points in this article is that we use the numerical scheme to obtain the solutions of these types of equations using the best approximation. The important applications of these equations can be seen in engineering and physics sciences. For instance, we can refer to the progressive waves that contain nonlinear models [12], oscillations models [13], magnetohydrodynamic [14], transcritical models [15], geostrophic turbulence [16], super thermal plasmas [17], and unmagnetized collisional dusty plasma [18]. Many papers were studied and checked regarding the solutions of fKdV equations by applying the analytical and numerical techniques, for instance, the homotopy approach [19], the differential transform approach [20], the analysis technique based on variational iteration method [21], the analysis technique based on reduced differential transform method [22], the numerical method based on the finite-difference technique [23], the numerical method based on the semi-implicit finite-difference method [24], the spectral collocation method [25,26,27,28].
This paper is organized into the following parts. In Section 2, we describe the lemmas and main preliminaries. Also, this part studies the main property of the Legendre function and shifted Legendre function. In Section 3, we check and obtain an approximation function for solving Equation (1). In Section 4, by applying the approximation function, which is calculated in Section 3, we obtain the approximate solutions of Equation (1). Finally, in Section 5, we display the three numerical examples to show the effectiveness of our method.

2. Preliminaries

This part explains the significant definitions and main lemmas which will applied in the next section.
Definition 1.
For n N , the Legendre functions L n ( z ) over the interval z [ 1 , 1 ] are shown by a recurrence formula [29], as follows:
L n + 1 ( z ) = ( 2 n + 1 ) z L n ( z ) n L n 1 ( z ) n + 1 , L 0 ( z ) = 1 , L 1 ( z ) = z .
The analytical form of L n ( z ) can be displayed by
L n ( z ) = 2 n k = 0 n n ! n + k 1 2 n z k k ! ( n k ) ! .
Definition 2.
The shifted Legendre functions over interval [ 0 , 1 ] are displayed [29] as follows:
P n + 1 ( x ) = ( 2 n + 1 ) ( 2 x 1 ) P n ( x ) n P n 1 ( x ) n + 1 , n = 1 , 2 , , P 0 ( x ) = P 1 ( 1 ) , P 1 ( x ) = 2 x 1 ,
in which P n ( x ) = L n ( 2 x 1 ) . The analytical form of the above functions can be displayed by the following finite series:
P n ( x ) = k = 0 n ( 1 ) k + n ( k + n ) ! ( n k ) ! ( k ! ) 2 x k .
Also, the orthogonal properties of P n ( x ) are displayed by
0 1 P m ( y ) P n ( y ) d y = 1 2 n + 1 , n = m , 0 n m .
Lemma 1.
Suppose that k μ , k N . Then, D t μ t ξ is calculated as follows [5]:
D t μ t k = 0 , k < μ , Γ ( k + 1 ) Γ ( k + 1 μ ) , t k μ k μ , 0 , k = 0 .
Lemma 2.
Suppose that H ( t ) , t ( ν 1 , ν 2 ) is a integrable function, then the following relation holds [30]:
ν 1 ν 2 F ( t ) d t p = 0 s W p F ( δ p ) ,
in which δ p and W p for p = 1 , 2 , , s are defined by
δ p = ν 2 ν 1 2 ς p + ν 2 + ν 1 2 , W p = ν 2 ν 1 1 ς p 2 L s ( ς p ) 2 ,
in which ς p are the roots of L s ( x ) .

3. Construction of the Approximate Function

To approximate the function u ( x , t ) over the interval L 2 [ 0 , 1 ] × [ 0 , 1 ] , we consider the infinite series, as follows:
u ( x , t ) = l 1 = 0 l 2 = 0 P l 1 ( x ) u l 1 l 2 P l 2 ( t ) ,
in which
u i j = ( 2 i + 1 ) ( 2 j + 1 ) 0 1 0 1 P j ( t ) u ( x , t ) P i ( x ) d x d t .
Considering n + 1 -sentence of the above series, we obtain
u ( x , t ) u n n = l 1 = 0 n l 2 = 0 n u l 1 l 2 P l 1 ( x ) P l 2 ( t ) = Φ T ( x ) Υ Φ ( t ) ,
in which
Φ ( x ) = P 0 ( x ) P 1 ( x ) P n ( x ) , Φ ( t ) = P 0 ( t ) P 1 ( t ) P n ( t ) ,
and Υ = u l 1 l 2 ( n + 1 ) × ( n + 1 ) .
Theorem 1.
For μ ( 0 , 1 ] , we obtain
D t μ Φ ( t ) = P Q ( μ , t ) Ψ n ( t ) ,
where
Q ( μ , t ) = 0 0 0 0 0 1 Γ ( 2 μ ) 0 0 0 0 2 Γ ( 3 μ ) 0 0 0 n ! Γ ( n μ + 1 ) t μ ,
P = 1 0 0 0 1 2 0 0 1 6 6 0 ( 1 ) n n ! n ! ( 1 ) n + 1 ( n + 1 ) ! ( n 1 ) ! ( 1 ) n + 2 ( n + 2 ) ! ( n 2 ) ! ( 2 ! ) 2 ( 1 ) 2 n 2 n ! ( 2 n ! ) 2   a n d   Ψ n ( t ) = 1 t t 2 t n .
Proof. 
Using the relations (3) and (11), we obtain
D t μ Φ ( t ) = D t μ P 0 ( t ) , P 1 ( t ) , , P n ( x ) T = D t μ ( 1 0 0 0 1 2 0 0 1 6 6 0 ( 1 ) n n ! n ! ( 1 ) n + 1 ( n + 1 ) ! ( n 1 ) ! ( 1 ) n + 2 ( n + 2 ) ! ( n 2 ) ! ( 2 ! ) 2 ( 1 ) 2 n 2 n ! ( 2 n ! ) 2 × 1 t t 2 t n ) = 1 0 0 0 1 2 0 0 1 6 6 0 ( 1 ) n n ! n ! ( 1 ) n + 1 ( n + 1 ) ! ( n 1 ) ! ( 1 ) n + 2 ( n + 2 ) ! ( n 2 ) ! ( 2 ! ) 2 ( 1 ) 2 n 2 n ! ( 2 n ! ) 2 × D t μ 1 D t μ t D t μ t 2 D t μ t n .
We put P = 1 0 0 0 1 2 0 0 1 6 6 0 ( 1 ) n n ! n ! ( 1 ) n + 1 ( n + 1 ) ! ( n 1 ) ! ( 1 ) n + 2 ( n + 2 ) ! ( n 2 ) ! ( 2 ! ) 2 ( 1 ) 2 n 2 n ! ( 2 n ! ) 2 , so:
D t μ Φ ( t ) = P × 0 t 1 μ Γ ( 2 μ ) 2 t 2 μ Γ ( 3 μ ) n ! t n μ Γ ( n μ + 1 ) = P × 0 0 0 0 0 1 Γ ( 2 μ ) 0 0 0 0 2 Γ ( 3 μ ) 0 0 0 n ! Γ ( n μ + 1 ) t μ × 1 t t 2 t n = P Q ( μ , t ) Ψ n ( t ) ,
where Q ( μ , t ) = 0 0 0 0 0 1 Γ ( 2 μ ) 0 0 0 0 2 Γ ( 3 μ ) 0 0 0 n ! Γ ( n μ + 1 ) t μ and Ψ n ( t ) = 1 t t 2 t n . The result is achieved. According to the above theorem, we have D t μ ( P Ψ n ( t ) ) = P Q ( μ , t ) Ψ n ( t ) . □
Theorem 2.
Suppose that Φ ( t ) = P Ψ n ( t ) . Then, for μ ( 0 , 1 ] , we obtain
D t ϱ μ C Φ ( t ) = P p = 0 s W p Q ( δ p , t ) P 1 Φ ( t ) ,
D t ϱ μ C u ( x , t ) ( P Ψ n ( x ) ) T Υ P ] p = 0 s W p Q ( δ p , t ) ] P 1 Φ ( t ) .
Proof. 
Using Equation (2), we have
D t ϱ μ C Φ ( t ) = ν 1 ν 2 ϱ μ D t μ Φ ( t ) d μ = ν 1 ν 2 ϱ μ D t μ P Ψ n ( t ) d μ ,
and by applying Lemma 2 on the relation (22), we obtain
D t ϱ μ C Φ ( t ) = ν 1 ν 2 ϱ μ D t μ P Ψ n ( t ) d μ p = 0 s W p D t δ p P Ψ n ( t ) = p = 0 s W p P Q ( δ p , t ) Ψ n ( t ) = P p = 0 s W p Q ( δ p , t ) Ψ n ( t ) .
Here, ν 1 = 0 , ν 2 = 1 . Since the matrix P is reversible, then we obtain
D t ϱ μ C Φ ( t ) = P p = 0 s W p Q ( δ p , t ) Ψ n ( t ) = P p = 0 s W p Q ( δ p , t ) P 1 Φ ( t ) .
To prove Equation (21), we use Equations (16) and (24); thus, we obtain
D t ϱ μ C u ( x , t ) Φ T ( x ) Υ C D t ϱ μ Φ ( t ) = ( P Φ ( x ) ) T Υ P p = 0 s W p Q ( δ p , t ) P 1 Φ ( t ) .
The proof is completed. □
Theorem 3.
Assume that Φ ( x ) = P Ψ n ( x ) . Thus,
d Φ ( x ) d x = P V P * P 1 Φ ( x ) ,
d 3 Φ ( x ) d x 3 = P V * P * P 1 Φ ( x ) .
where
V = 0 0 0 1 0 0 0 2 0 0 0 n   and   V * = 0 0 0 0 0 0 0 0 0 0 0 n ( n 1 ) ( n 2 ) , P * = P 1 1 P 2 1 P 3 1 P n 1
Proof. 
We consider Φ ( x ) = P Ψ n ( x ) , yielding the following:
d Φ ( x ) d x = d ( P Ψ n ( x ) ) d x = P d Ψ n ( x ) d x = P 0 1 2 x n x n 1 = P 0 0 0 1 0 0 0 2 0 0 0 n × 0 1 2 x n x n 1 = P 0 0 0 1 0 0 0 2 0 0 0 n × P * Ψ n ( x ) = P V P * Ψ n ( x ) = P V P * P 1 Φ ( x ) ,
where
V = 0 0 0 1 0 0 0 2 0 0 0 n , P * = P 1 1 P 2 1 P 3 1 P n 1
and P n 1 is n -th row of P n 1 . With a similar process as Equation (28) for d 3 Φ ( x ) d x 3 , we obtain
d 3 Φ ( x ) d x 3 = d 3 ( P Ψ n ( x ) ) d x 3 = P d 3 Ψ n ( x ) d x 3 = P 0 0 0 n ( n 1 ) ( n 2 ) x n 2 = P 0 0 0 0 0 0 0 0 0 0 0 n ( n 1 ) ( n 2 ) × 0 0 0 n ( n 1 ) ( n 2 ) x n 2 = P V * P * P 1 Φ ( x ) ,
where,
V * = 0 0 0 0 0 0 0 0 0 0 0 n ( n 1 ) ( n 2 ) . □
Theorem 4.
Suppose that u n n represents the numerical solutions of u ( x , t ) . Then, the sequence { u n n } 0 to u converges.
Proof. 
We show that the sequence { u n n } 0 are Cauchy sequences in L 2 [ 0 , 1 ] × [ 0 , 1 ] ; then, for any m , n , n > m , we obtain
u m m u n n L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 = l 1 = 0 m l 2 = 0 m u l 1 l 2 P l 1 ( x ) P l 2 ( t ) l 1 = 0 n l 2 = 0 n u l 1 l 2 P l 1 ( x ) P l 2 ( t ) L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 = l 1 = n + 1 l 2 = n + 1 u l 1 l 2 P l 1 ( x ) P l 2 ( t ) L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 .
From Schwarz’s inequality using for Equation (30), we obtain
u m m u n n L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 l 1 = n + 1 l 2 = n + 1 | u l 1 l 2 | 2 l 1 = n + 1 l 2 = n + 1 | P l 1 ( x ) | 2 | P l 2 ( t ) | 2 = l 1 = n + 1 l 2 = n + 1 | u l 1 l 2 | 2 P l 1 ( x ) L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 P l 2 ( t ) L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 .
Due to the results derived in [5], we have
| u l 1 l 2 | 3 K 8 ( 2 l 1 3 ) 3 2 ( 2 l 2 3 ) 3 2 , K > 0 .
By applying Equation (10), we achieved
u m m u n n L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 l 1 = n + 1 l 2 = n + 1 3 K 8 ( 2 l 1 3 ) 3 2 ( 2 l 2 3 ) 3 2 2 × l 1 = n + 1 1 2 l 1 + 1 l 2 = n + 1 1 2 l 2 + 1 l 1 = n + 1 l 2 = n + 1 9 K 2 8 ( 2 l 1 3 ) 3 2 ( 2 l 2 3 ) 3 2 l 1 = n + 1 1 2 l 1 + 1 × l 2 = n + 1 1 2 l 2 + 1 ,
Due to results derived in [5], we have 3 K l 1 = n + 1 l 2 = n + 1 3 K 8 ( 2 l 1 3 ) 3 2 ( 2 l 2 3 ) 3 2 9 K 2 8 ( 2 n 3 ) ; therefore,
u m m u n n L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 9 K 2 8 ( 2 n 3 ) l 1 = n + 1 1 2 l 1 + 1 l 2 = n + 1 1 2 l 2 + 1 , u m m u n n L 2 [ 0 , 1 ] × [ 0 , 1 ] 9 K 2 8 ( 2 n 3 ) l 1 = n + 1 1 2 l 1 + 1 l 2 = n + 1 1 2 l 2 + 1 1 2 .
As m , n + , we obtain u m m u n n L 2 [ 0 , 1 ] × [ 0 , 1 ] 0 . Thus, the sequence { u n n } 0 is a Cauchy sequence in L 2 [ 0 , 1 ] × [ 0 , 1 ] because L 2 [ 0 , 1 ] × [ 0 , 1 ] is a complete space. Therefore, sequence u n n is convergent. □
Theorem 5.
Assume that u is the exact solution and P k , M is the best numerical solution of u. Then, we have [31]
u ( x , t ) P k , M L 2 ( 0 , 1 ) c M σ 2 k σ u ( σ ) L 2 ( 0 , 1 ) , u ( x , t ) P k , M H q ( 0 , 1 ) c M 2 q 1 2 σ 2 k ( q σ ) u ( σ ) L 2 ( 0 , 1 ) , q 1 ,
in which u ( x , t ) H σ ( 0 , 1 ) , σ 0 , and H σ ( 0 , 1 ) , σ 0 is presented in [31].
Theorem 6.
Assume that ( u ) n is the numerical solutions of u. Then,
u ( u ) n L 2 [ 0 , 1 ] × [ 0 , 1 ] c M σ 2 k σ u ( σ ) L 2 ( 0 , 1 ) + F ˜ F L 2 [ 0 , 1 ] × [ 0 , 1 ] × l 1 = 0 n l 2 = 0 n 1 ( 2 l 1 + 1 ) ( 2 l 2 + 1 ) 1 2 , u ( u ) n L 2 [ 0 , 1 ] × [ 0 , 1 ] c M 2 q 1 2 σ 2 k ( q σ ) u ( σ ) L 2 ( 0 , 1 ) + F ˜ F L 2 [ 0 , 1 ] × [ 0 , 1 ] × l 1 = 0 n l 2 = 0 n 1 ( 2 l 1 + 1 ) ( 2 l 2 + 1 ) 1 2 ,
where F = u l 1 l 2 ( n + 1 ) × ( n + 1 ) , F ˜ = u ˜ l 1 l 2 ( n + 1 ) × ( n + 1 ) and q 1 .
Proof. 
Let P k , M = l 1 = 0 n l 2 = 0 n u ˜ l 1 l 2 P l 1 ( x ) P l 2 ( t ) be the best numerical solution of (1); then,
u ( u ) n L 2 [ 0 , 1 ] × [ 0 , 1 ] = u P k , M + P k , M ( u ) n L 2 [ 0 , 1 ] × [ 0 , 1 ] u P k , M L 2 [ 0 , 1 ] × [ 0 , 1 ] + P k , M ( u ) n L 2 [ 0 , 1 ] × [ 0 , 1 ] = u P k , M L 2 [ 0 , 1 ] × [ 0 , 1 ] + l 1 = 0 n l 2 = 0 n u ˜ l 1 l 2 P l 1 ( x ) P l 2 ( t ) l 1 = 0 n l 2 = 0 n u l 1 l 2 P l 1 ( x ) P l 2 ( t ) L 2 [ 0 , 1 ] × [ 0 , 1 ] .
In Equation (37), l 1 = 0 n l 2 = 0 n u ˜ l 1 l 2 P l 1 ( x ) P l 2 ( t ) l 1 = 0 n l 2 = 0 n u l 1 l 2 P l 1 ( x ) P l 2 ( t ) L 2 [ 0 , 1 ] × [ 0 , 1 ] is obtained as follows:
l 1 = 0 n l 2 = 0 n u ˜ l 1 l 2 P l 1 ( x ) P l 2 ( t ) l 1 = 0 n l 2 = 0 n u l 1 l 2 P l 1 ( x ) P l 2 ( t ) L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 l 1 = 0 n l 2 = 0 n | u ˜ l 1 l 2 u l 1 l 2 | 2 l 1 = 0 n l 2 = 0 n P l 1 ( x ) L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 P l 2 ( t ) L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 = F ˜ F L 2 [ 0 , 1 ] × [ 0 , 1 ] 2 l 1 = 0 n l 2 = 0 n 1 ( 2 l 1 + 1 ) ( 2 l 2 + 1 ) ,
where F = u l 1 l 2 ( n + 1 ) × ( n + 1 ) , F ˜ = u ˜ l 1 l 2 ( n + 1 ) × ( n + 1 ) . By substituting Equation (38) into Equation (37) and then by applying Equation (35) on Equation (37), we obtain two cases. Thus,
u ( u ) n L 2 [ 0 , 1 ] × [ 0 , 1 ] c M σ 2 k σ u ( σ ) L 2 ( 0 , 1 ) + F ˜ F L 2 [ 0 , 1 ] × [ 0 , 1 ] × l 1 = 0 n l 2 = 0 n 1 ( 2 l 1 + 1 ) ( 2 l 2 + 1 ) 1 2 , u ( u ) n L 2 [ 0 , 1 ] × [ 0 , 1 ] c M 2 q 1 2 σ 2 k ( q σ ) u ( σ ) L 2 ( 0 , 1 ) + F ˜ F L 2 [ 0 , 1 ] × [ 0 , 1 ] × l 1 = 0 n l 2 = 0 n 1 ( 2 l 1 + 1 ) ( 2 l 2 + 1 ) 1 2 ,
where q 1 . Hence, the proof is completed. □

4. Explain Approximation Solution for fKdV Using the Proposed Method

In this part, we describe the proposed method in Section 3 for solving the system considered in Equation (1). By replacing relations (16), (21), (26), and (27) into Equation (1), we obtain
( Φ ( x ) ) T Υ P ( p = 0 s W p Q ( δ p , t ) ) P 1 Φ ( t ) Φ T ( x ) Υ Φ ( t ) ( P V P * P 1 Φ ( x ) ) T Υ Φ ( t ) + β ( P V * P * P 1 Φ ( x ) ) T Υ Φ ( t ) = α f x ( x , t ) , ( Φ ( x ) ) T [ Υ P p = 0 s W p Q ( δ p , t ) P 1 + Υ Φ ( t ) ( P V P * P 1 Φ ( x ) ) T Υ + β ( P V * P * P 1 ) T Υ ] Φ ( t ) = α f x ( x , t ) , u ( x , 0 ) = u 0 ( x ) Φ T ( x ) Υ Φ ( 0 ) = Φ T ( x ) u 0 .
Considering the residual function R ( x , t , δ p ) for Equation (40), we have
( Φ ( x ) ) T [ Υ P p = 0 s W p Q ( δ p , t ) P 1 + Υ Φ ( t ) ( P V P * P 1 Φ ( x ) ) T Υ + β ( P V * P * P 1 ) T Υ ] Φ ( t ) α f x ( x , t ) R ( x , t , δ p ) 0 , Φ T ( x ) Υ Φ ( 0 ) Φ T ( x ) u 0 0 .
By substituting the collocation points in R ( x l 1 , t l 2 , δ p ) , l 1 = 0 , 1 , 2 , , n 1 , l 2 = 0 , 1 , 2 , , n 1 , s = 0 , 1 , 2 , , m 2 , the indeterminate matrix Υ is found.

5. Numerical Simulation

To draw and present the proposed numerical method, we present some numerical examples. Here, the absolute error formula is given by
E = | u u n | ,
in which the function u shows the exact solution and u n shows the approximate solution.
Example 1.
Consider the following Korteweg–de Vries model:
0 1 Γ ( 8 μ ) 6 D t μ u d μ + 3 ( u 2 ) x + 3 u x 3 = g ,
in which
g ( x , t ) = ( t 7 t 6 ) x ( 1 x ) 2 + 6 ( 1 t 6 ) 2 ( 3 x 5 10 x 4 + 12 x 3 6 x 2 + x ) + 6 ( 1 t 6 ) .
The exact solution is u = ( 1 t 6 ) x ( 1 x ) 2 . We solved this problem by using the studied method for various values of n = 20 , 30 , 40 with s = 40 . Table 1 represents the absolute error for the proposed numerical method for various values of n with s = 40 . Figure 1 represent the graphs of the numerical solutions for different values of n with s = 40 .
Example 2.
Consider
0 1 ϱ μ D t μ u ( x , t ) d μ + u ( x , t ) u x ( x , t ) + 1 6 u x x x ( x , t ) = 2 f x ( x , t ) + ( t 2 t ) x ( 2 x ) ln t + t 4 ( 2 x ) ( 2 2 x ) + 2 2 3 + ( 2 t 2 ) e t 2 + 2 t 1 s e c h 2 ( x e t 2 + 2 t 1 ) t a n h ( x e t 2 + 2 t 1 ) , u ( x , 0 ) = 0 ,
in which
f ( x , t ) = 2 3 + ( 2 t 2 ) e t 2 + 2 t 1 s e c h 2 ( x e t 2 + 2 t 1 )
and ϱ μ = Γ ( 3 μ ) . For this problem, the analytical solution is u = t 2 x ( 2 x ) . Graphs of the approximate solutions for the problem are shown in Figure 2, and graphs of the absolute error function are displayed in Figure 3 for the values of n and s = 25 . From this figure, we see that when the value of n is increased, the absolute error is decreased.
Example 3.
Consider
0 1 ϱ μ D t μ u ( x , t ) d μ + u u x ( x , t ) + 1 6 u x x x = 2 f x + t ( t 2 t ) x ( x 1 ) ln t + t 5 ( 2 x 1 ) x ( x 1 ) + 2 2 3 + ( 2 t 2 ) e t 2 + 2 t 1 s e c h ( x e t 2 + 2 t 1 ) t a n h ( x e t 2 + 2 t 1 ) , u ( x , 0 ) = 0 ,
in which
f ( x , t ) = 2 3 + ( 2 t 2 ) e t 2 + 2 t 1 s e c h ( x e t 2 + 2 t 1 )
and ϱ μ = 8 15 π Γ ( 7 2 μ ) . For this problem, the analytical solution is u ( x , t ) = t 5 2 x ( x 1 ) . We solved this problem for different values of n using the numerical method. Graphs of the numerical results for different values of n are depicted in Figure 4. Figure 5 shows graphs of the absolute error function for the values of n and s = 25 . From this figure, we see that when the value of n is increased, the absolute error is decreased.

6. Conclusions

This study presents a numerical technique based on the shifted Legendre polynomials for obtaining the approximate solutions of Equation (1) under the stated conditions. Using this numerical method, an operational matrix is derived to solve the projected model. Also, convergence and error are investigated in this study. Some examples are displayed for the effectiveness of the numerical approach. Numerical results for all numerical examples are demonstrated in the form of graphs. From these graphs, we understand that the given numerical method is an efficient method with a high accuracy. The present research may help researchers to investigate nonlinear models with efficient tools and derive some simulating results, which may help capture more essential properties of the corresponding results.

Author Contributions

The authors equally contributed to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Guangzhou Basic and Applied Basic Research (No. SL2023A04J01430) and the National Natural Science Foundation of China (No. 62407011).

Data Availability Statement

No data were used to support this study.

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. Chen, Z.; Kosari, S.; Shafi, J.; Derakhshan, M.H. Stability Analysis Study of Time-Fractional Nonlinear Modified Kawahara Equation Based on the Homotopy Perturbation Sadik Transform. Fractal Fract. 2024, 8, 512. [Google Scholar] [CrossRef]
  2. Hashemi, M.S.; Abbasbandy, S. A geometric approach for solving Troesch’s problem. Bull. Malays. Math. Sci. Soc. 2017, 40, 97–116. [Google Scholar] [CrossRef]
  3. Inc, M.; Parto-Haghighi, M.; Akinlar, M.A.; Chu, Y.M. New numerical solutions of fractional-order Korteweg-de Vries equation. Results Phys. 2020, 19, 103326. [Google Scholar] [CrossRef]
  4. Kosari, S.; Xu, P.; Shafi, J.; Derakhshan, M.H. An efficient hybrid numerical approach for solving two-dimensional fractional cable model involving time-fractional operator of distributed order with error analysis. Numer. Algorithms 2024, 17, 1–20. [Google Scholar] [CrossRef]
  5. Pourbabaee, M.; Saadatmandi, A. A novel Legendre operational matrix for distributed order fractional differential equations. Appl. Math. Comput. 2019, 361, 215–231. [Google Scholar] [CrossRef]
  6. David, V.D.; Nazari, M.; Barati, V.; Salah, F.; Abdul Aziz, Z. Approximate analytical solution for the forced Korteweg-de Vries equation. J. Appl. Math. 2013, 2013, 795818. [Google Scholar] [CrossRef]
  7. Akylas, T.R. On the excitation of long nonlinear water waves by a moving pressure distribution. J. Fluid Mech. 1984, 141, 455–466. [Google Scholar] [CrossRef]
  8. Jun-Xiao, Z.; Bo-Ling, G. Analytic solutions to forced KdV equation. Commun. Theor. Phys. 2009, 52, 279. [Google Scholar] [CrossRef]
  9. Grimshaw, R.; Pelinovsky, E.; Tian, X. Interaction of a solitary wave with an external force. Phys. D Nonlinear Phenom. 1994, 77, 405–433. [Google Scholar] [CrossRef]
  10. Pelinovsky, E.; Talipova, T.; Kurkin, A.; Kharif, C. Nonlinear mechanism of tsunami wave generation by atmospheric disturbances. Nat. Hazards Earth Syst. Sci. 2001, 1, 243–250. [Google Scholar] [CrossRef]
  11. Derakhshan, M.H.; Rezaei, H.; Marasi, H.R. An efficient numerical method for the distributed-order time-fractional diffusion equation with the error analysis and stability properties. Math. Methods Appl. Sci. 2023, 214, 315–333. [Google Scholar] [CrossRef]
  12. Liao, S.J.; Cheung, K.F. Homotopy analysis of nonlinear progressive waves in deep water. J. Eng. Math. 2003, 45, 105–116. [Google Scholar] [CrossRef]
  13. Liao, S.J. An analytic approximate approach for free oscillations of self-excited systems. Int. J. -Non-Linear Mech. 2004, 39, 271–280. [Google Scholar] [CrossRef]
  14. Liao, S.J. On the analytic solution of magnetohydrodynamic flows of non-Newtonian fluids over a stretching sheet. J. Fluid Mech. 2003, 488, 189–212. [Google Scholar] [CrossRef]
  15. Grimshaw, R.H.; Maleewong, M. Transcritical flow over obstacles and holes: Forced Korteweg—De Vries framework. J. Fluid Mech. 2019, 881, 660–768. [Google Scholar] [CrossRef]
  16. Hereman, W. Shallow water waves and solitary waves. arXiv 2013, arXiv:1308.5383. [Google Scholar]
  17. Ali, R.; Saha, A.; Chatterjee, P. Analytical electron acoustic solitary wave solution for the forced KdV equation in superthermal plasmas. Phys. Plasmas 2017, 24, 122106. [Google Scholar] [CrossRef]
  18. Mandi, L.; Mondal, K.K.; Chatterjee, P. Analytical solitary wave solution of the dust ion acoustic waves for the damped forced modified Korteweg-de Vries equation in q-nonextensive plasmas. Eur. Phys. J. Spec. Top. 2019, 228, 2753–2768. [Google Scholar] [CrossRef]
  19. Ji, J.; Zhang, L.; Wang, L.; Wu, S.; Zhang, L. Variable coefficient KdV equation with time-dependent variable coefficient topographic forcing term and atmospheric blocking. Adv. Differ. Equ. 2019, 2019, 320. [Google Scholar] [CrossRef]
  20. Kurulay, M.; Bayram, M. Approximate analytical solution for the fractional modified KdV by differential transform method. Commun. Nonlinear Sci. Numer. Simul. 2010, 15, 1777–1782. [Google Scholar] [CrossRef]
  21. Ganji, D.D.; Nourollahi, M.; Rostamian, M. A comparison of variational iteration method with Adomian’s decomposition method in some highly nonlinear equations. Int. J. Sci. Technol. 2007, 2, 179–188. [Google Scholar]
  22. Rawashdeh, M. Improved approximate solutions for nonlinear evolutions equations in mathematical physics using the reduced differential transform method. J. Appl. Math. Bioinform. 2013, 3, 1. [Google Scholar]
  23. Yazid, N.M.; Tay, K.G.; Choy, Y.Y.; Sudin, A.M.; Tiong, W.K.; Ong, C.T. Numerical Solution of the Forced Korteweg-de Vries (fKDV) Equation. ARPN J. Eng. Appl. Sci. 2006, 11, 10757–10760. [Google Scholar]
  24. Lee, S. Dynamics of trapped solitary waves for the forced KdV equation. Symmetry 2018, 10, 129. [Google Scholar] [CrossRef]
  25. Taghipour, M.; Aminikhah, H. Numerical solution of distributed-order fractional Korteweg-de Vries equation via fractional Zigzag rising diagonal functions. Numer. Algorithms 2024, 96, 739–776. [Google Scholar] [CrossRef]
  26. Balamurugan, S.; Vigneshwaran, S. Exact Solutions for a Compound KDV-Burgers Equation with Forcing Term. Int. J. Math. Trends Technol. 2018, 56, 320–330. [Google Scholar]
  27. Hattam, L.L.; Clarke, S.R. Modulation theory for the steady forced KdV-Burgers equation and the construction of periodic solutions. Wave Motion 2015, 56, 67–84. [Google Scholar] [CrossRef]
  28. Zergania, S.; Leec, J.H.; Aziza, Z.A.; Viswanathan, K.K. KDV and FKDV Model for the Run-up of Tsunamis via Lattice Boltzmann Method. Int. J. Appl. Eng. Res. 2017, 12, 14338–14347. [Google Scholar]
  29. Saadatmi, A.; Khani, A.; Azizi, M.R. Numerical Calculation of Fractional Derivatives for the Sinc Functions via Legendre Polynomials. Math. Interdiscip. Res. 2019, 1, 71–86. [Google Scholar]
  30. Hildebr, F.B. Introduction to Numerical Analysis; Courier Corporation: North Chelmsford, MA, USA, 1987. [Google Scholar]
  31. Mashayekhi, S.; Ordokhani, Y.; Razzaghi, M. A hybrid functions approach for the Duffing equation. Phys. Scr. 2013, 88, 025002. [Google Scholar] [CrossRef]
Figure 1. Graph of numerical results for Example 1 with different kinds of n with s = 25 .
Figure 1. Graph of numerical results for Example 1 with different kinds of n with s = 25 .
Fractalfract 08 00630 g001
Figure 2. Graph of numerical solutions when s = 25 for Example 2 with different kinds of n.
Figure 2. Graph of numerical solutions when s = 25 for Example 2 with different kinds of n.
Fractalfract 08 00630 g002
Figure 3. A diagram of the absolute errors when s = 40 for Example 2 with different values of n.
Figure 3. A diagram of the absolute errors when s = 40 for Example 2 with different values of n.
Fractalfract 08 00630 g003
Figure 4. Graph of numerical results for Example 3 with different kinds of n with s = 25 .
Figure 4. Graph of numerical results for Example 3 with different kinds of n with s = 25 .
Fractalfract 08 00630 g004
Figure 5. Absolute errors of Example 3 for different values of n with s = 40 .
Figure 5. Absolute errors of Example 3 for different values of n with s = 40 .
Fractalfract 08 00630 g005
Table 1. The absolute error for different values of n and s = 40 for Example 1.
Table 1. The absolute error for different values of n and s = 40 for Example 1.
( x , t ) | u u n |
n = 20 n = 30 n = 40
( 0.2 , 0.2 ) 1.3566 × 10 12 9.6722 × 10 13 4.5479 × 10 14
( 0.4 , 0.4 ) 1.0849 × 10 12 1.0125 × 10 12 7.1512 × 10 14
( 0.6 , 0.6 ) 3.5372 × 10 12 6.5661 × 10 14 4.2923 × 10 14
( 0.8 , 0.8 ) 8.5690 × 10 12 1.6179 × 10 13 4.3111 × 10 14
( 0.9 , 0.9 ) 1.0115 × 10 11 2.5824 × 10 13 4.5204 × 10 14
C P U 24.3 32.8 38.5
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Kosari, S.; Guan, H.; Derakhshan, M. An Error Analysis Study for the Distributed-Order Time-Fraction Model Using an Efficient Numerical Method. Fractal Fract. 2024, 8, 630. https://doi.org/10.3390/fractalfract8110630

AMA Style

Kosari S, Guan H, Derakhshan M. An Error Analysis Study for the Distributed-Order Time-Fraction Model Using an Efficient Numerical Method. Fractal and Fractional. 2024; 8(11):630. https://doi.org/10.3390/fractalfract8110630

Chicago/Turabian Style

Kosari, Saeed, Hao Guan, and MohammadHossein Derakhshan. 2024. "An Error Analysis Study for the Distributed-Order Time-Fraction Model Using an Efficient Numerical Method" Fractal and Fractional 8, no. 11: 630. https://doi.org/10.3390/fractalfract8110630

APA Style

Kosari, S., Guan, H., & Derakhshan, M. (2024). An Error Analysis Study for the Distributed-Order Time-Fraction Model Using an Efficient Numerical Method. Fractal and Fractional, 8(11), 630. https://doi.org/10.3390/fractalfract8110630

Article Metrics

Back to TopTop