Next Article in Journal
New Fractional Integral Inequalities for Convex Functions Pertaining to Caputo–Fabrizio Operator
Next Article in Special Issue
New Solutions of Nonlinear Dispersive Equation in Higher-Dimensional Space with Three Types of Local Derivatives
Previous Article in Journal
Synchronization in a Multiplex Network of Nonidentical Fractional-Order Neurons
Previous Article in Special Issue
Fractional Order Mathematical Model of Serial Killing with Different Choices of Control Strategy
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Numerical Approximations for the Solutions of Fourth Order Time Fractional Evolution Problems Using a Novel Spline Technique

1
Department of Mathematics, University of the Punjab, Lahore 54590, Pakistan
2
Department of Mathematics, University of Sargodha, Sargodha 40100, Pakistan
3
Department of Mathematics, Government College Women University, Sialkot 51310, Pakistan
4
Department of Mathematics and Sciences, Prince Sultan University, P.O. Box 66833, Riyadh 11586, Saudi Arabia
5
Department of Medical Research, China Medical University, Taichung 40402, Taiwan
6
Department of Mathematical Sciences, Faculty of Sciences, Princess Nourah Bint Abdulrahman University, P.O. Box 84428, Riyadh 11671, Saudi Arabia
*
Authors to whom correspondence should be addressed.
Fractal Fract. 2022, 6(3), 170; https://doi.org/10.3390/fractalfract6030170
Submission received: 23 January 2022 / Revised: 12 March 2022 / Accepted: 14 March 2022 / Published: 19 March 2022

Abstract

:
Developing mathematical models of fractional order for physical phenomena and constructing numerical solutions for these models are crucial issues in mathematics, physics, and engineering. Higher order temporal fractional evolution problems (EPs) with Caputo’s derivative (CD) are numerically solved using a sextic polynomial spline technique (SPST). These equations are frequently applied in a wide variety of real-world applications, such as strain gradient elasticity, phase separation in binary mixtures, and modelling of thin beams and plates, all of which are key parts of mechanical engineering. The SPST can be used for space discretization, whereas the backward Euler formula can be used for time discretization. For the temporal discretization, the method’s convergence and stability are assessed. To show the accuracy and applicability of the proposed technique, numerical simulations are employed.

1. Introduction

Fractional derivatives (FD) and Fractional integrals (FI) are no longer a novel concept. FDs gain considerable attention, because of its non-local property, in few decades. FDs are the leading tool for description of problems in biology, physics, chemistry and in many other areas. FDs may also be used to describe the memory and heredity features of different materials and processes. Non-integer order derivatives and integrals are demonstrably more effective than classical models for expressing some electrochemical difficulties. Extensions of the wave and diffusion equations are also done with the FD and FI operators. The brief history and detailed analysis of this area are provided by Podlubny [1] and Oldham and Spanier [2].
At the same time, applications of the fourth order differential equations are reported in various real life problems. Floor systems, bridge slabs, aeroplane wings, and window panes, for example, may be modelled as plates with various types of boundary supports which can be governed by 4th-order PDEs.
A higher-order EP with time-fractional CD is examined in this study, as follows:
γ χ t γ + η 4 χ s 4 = g ( s , t ) , s Λ = [ 0 , b ] , t ( 0 , T ] ,
subject to the initial condition (IC)
χ ( s , 0 ) = v 0 ( s ) , 0 s b ,
and boundary conditions (BCs)
χ ( 0 , t ) = χ ( b , t ) = 0 , χ s s ( 0 , t ) = χ s s ( b , t ) = 0 , t ( 0 , T ] .
where γ   ( 0 < γ < 1 ) denotes the order of the FDs in the Caputo sense, η denotes the ratio of the beam’s flexural stiffness to its mass per unit length, and χ denotes the beam’s transverse displacement. The g ( s , t ) represents dynamic driving force per unit mass, and v 0 ( s ) is a continuous function. Berdyshev et al. [3] discussed the existence and uniqueness of the solution of suggested problem as a special case where the authors applied the separation-variables method to prove the unique solvability of direct and inverse problems for a fourth-order mixed type equation, which coincides with suggested problem for t > 0 . As hereditary properties and memory of various materials can be depicted more precisely using the time-fractional derivatives, thus they are useful tool for modeling of different processes.
Several descriptions for the notion of fractional operators, e.g., Caputo, Riemann–Liouville and He’s are presented in the last few years. For any discontinuous problems, it is appropriate to use He’s fractal derivative [4,5,6]. Also, with the help of two-scale transform, the differential equations of fractional order can be converted into classical differential ones, which can be solved easily [7,8]. In this work, the Caputo’s fractional derivative will be used because of its suitability to describe physical systems in the real-world as it guarantees to allow the classical IC and BCs in the mathematical modeling of the system. In this work, for description of fractional derivative, the Caputo derivative is used. The time-fractional CD of order γ is defined as:
γ χ ( s , t ) t γ = 1 Γ ( 1 γ ) 0 t χ ( s , p ) p d p ( t p ) γ , 0 < γ < 1 , χ ( s , t ) t , γ = 1 .
When γ = 1 , Equation (1) provides 4th-order PDE
χ t + η 4 χ s 4 = g ( s , t ) , s Λ = [ 0 , b ] , t ( 0 , T ] .
The analytical results of many FDEs cannot be obtained using the existing solutions techniques. Therefore, various numerical techniques have been proposed for the approximate solutions of fractional order differential equations.
A numerical technique for solving 4th-order integro PDE with a weakly singular kernel developed by Yang et al. [9]. Liu et al. [10] constructed a computational scheme using the mixed finite element scheme to obtain numerical solution of fractional order fourth-order differential equation. Khan et al. [11] utilized variational iteration technique to obtain the numerical solution of FDEs of order four. Moghaddam et al. [12] presented a integro quadratic spline scheme to obtain the approximate solution for the class of fractional order problems. Roul et al. [13] constructed a collocation approach for fractional order diffusion equation. They used L 1 scheme for the time-discretization, whereas the space discretization was observed using sextic B-spline. Abdeljawad et al. [14] proposed some fixed point results to determine the numerical solutions of fractional differential equations. El-Sayed et al. [15] introduced a new numerical approach based on Jacobi polynomials for multi term variable order FDEs.
Fractional Bagely-Torvik equation solved numerically using a non-polynomial spline technique [16]. Pedas and Vikerpuur [17] discussed the spline collocation method for multi-term fractional integro-differential equations with weakly singular kernels. Youssri [18] constructed orthonormal ultraspherical operational matrix algorithm for fractal-fractional Riccati equation via generalized Caputo fractional derivative. Cardone et al. [19] discussed the Nordsieck GLM collocation methods for ordinary differential equations, and on two-step spline collocation methods for fractional differential equations. A predictor-corrector method introduced for the approximate solutions of uncertain FDEs [20]. The fractional Drinfeld-Sokolov-Wilson equation was investigated using a novel numerical computational method [21]. Approximate solution of the fractional stochastic Tricomi-type equation was investigated using a finite difference scheme with Caputo’s derivative [22]. Legendre wavelet method was implemented successfully for the numerical computations of the solution of a system of fractional order Volterra integral-differential equations [23]. It is well-known that there is a wide range of effective and robust tools for the solutions of fractional differential equations, namely, the Chun-Hui He’s iteration method [24], the Fourier spectral method [25], reproducing kernel method [26], the variational method [27], spline method [28], the He-Laplace method [29], Integral balance methods [30], lower and upper solutions method [31], and Li-He method [32]. Although existing tools are useful for solving these problems, the expansion of applications and the introduction of new-found and generalized forms for existing equations can be considered the best reason to explore new, useful, and more effective tools.
The main goal of this work to achieve the numerical solution of 4th-order time-fractional boundary value problem using a spline technique based on sextic polynomials. In order to solve PDEs, a sextic spline is broadly applied. If the numerical solutions of FPDE are required at several knots within a particular region, spline solutions ensure that the information about spline interpolation between mesh points is provided. The proposed method uses the piecewise defined spline functions over the spatial domain and it offers a continuous differentiable approximation to the solution with great accuracy but despite any insight into generalizations are not guaranteed. Also, its straightforward applicability provides a reliable base for utilizing it in the framework of numerical solutions for partial differential equations.
The following is how the paper is structured: Section 2 presents materials and methods including some preliminary, a brief overview of SPST, the consistency relations (CR) between the values of the spline and its derivatives at knots are derived using derivative continuities at knots, temporal discretization of the given problem, the first order backward Euler technique, the topic of temporal discretization’s stability and error analysis and the SPST for spatial discretization. In Section 3, numerical results are presented to demonstrate the method’s efficacy. The closing remarks are noted in Section 4.

2. Materials and Methods

2.1. Preliminary Results

Definition 1.
The inner product and norm of L 2 Λ can be defined as follows:
ϕ , ψ = Λ v w d s , ψ 0 = ψ , ψ 1 2 ,
where the L 2 Λ is the space of measurable functions whose square is Lebesgue integrable in Λ.
In order to verify the accuracy of the proposed method, the maximum norm errors and L 2 norm errors between numerical and exact solutions are given by the following definitions:
Definition 2.
The maximum norm error is defined as follows:
e K = max 0 i N | χ ( s i , t K ) Ø i K | .
Definition 3.
The L 2 norm error is defined as follows:
e K 2 = 1 N i = 0 N | χ ( s i , t K ) Ø i K | 2 1 2 .

2.2. Sextic Polynomial Spline Functions

The interval [ 0 , b ] is uniformly partitioned into the subintervals [ s j 1 , s j ] defined on the grid points s j = j ρ ( j = 0 , 1 , , k , ρ = b k , k > 0 ) . It is assumed that the function u ( s ) is a differentiable function on given domain [ 0 , b ] which is to be approximated by a SPS, P ( s ) . Each SPS segment T j ( s ) is considered, as:
T j ( s ) = a j ( s s j ) 6 + b j ( s s j ) 5 + c j ( s s j ) 4 + d j ( s s j ) 3 + e j ( s s j ) 2 + g j ( s s j ) + v j ,
j = 0 , 1 , , k , along with the requirement that
  • T j ( s ) C 5 [ 0 , b ] ,
  • P ( s ) = T j ( s ) ,     s [ s j , s j + 1 ] , j = 0 , 1 , , k 1 .
To determine the CR between the values of a spline and its derivatives at knots, the following relations must exist
T j ( s j ) = P j , T j ( s j + 1 ) = P j + 1 , T j ( 1 ) ( s j ) = Z j , T j ( 2 ) ( s j ) = S j , T j ( 2 ) ( s j + 1 ) = S j + 1 , T j ( 4 ) ( s j ) = G j , T j ( 4 ) ( s j + 1 ) = G j + 1 .
It should be noted that the spline P can be stated in terms of P j ’s and any three derivatives at the subinterval precincts. The coefficients introduced in Equation (5) to express the spline in positions of P j ’s, S j ’s, Z j ’s, and G j ’s are determined as follows:
a j = 1 3 ρ 6 ( P j + 1 P j ) 1 3 ρ 5 Z j 1 18 ρ 4 ( S j + 1 + 2 S j ) + 1 1080 ρ 2 ( 7 G j + 1 + 8 G j ) , b j = 1 ρ 5 ( P j + 1 P j ) + 1 ρ 4 Z j + 1 6 ρ 3 ( S j + 1 + 2 S j ) 1 360 ρ ( 4 G j + 1 + 11 G j ) , c j = 1 24 G j , d j = 5 3 ρ 3 ( P j + 1 P j ) 5 3 ρ 2 Z j 1 18 ρ ( 2 S j + 1 + 13 S j ) + ρ 216 ( G j + 1 4 G j ) , e j = 1 2 S j , g j = Z j , v j = P j .
At the knots, the 1st, 3rd, and 5th derivative continuities are applied, i.e., T j ( ξ ) ( s j ) = T j 1 ( ξ ) ( s j ) , ξ = 1 , 3 and 5, yield the following relations:
Z j + Z j 1 = 2 ρ ( P j P j 1 ) + ρ 6 ( S j S j 1 ) ρ 3 360 ( G j G j 1 ) ,
Z j + Z j 1 = 1 ρ ( P j + 1 P j 1 ) ρ 30 ( 2 S j + 1 + 21 S j + 7 S j 1 ) + ρ 3 360 ( G j + 1 9 G j + 2 G j 1 ) ,
Z j + Z j 1 = 1 ρ ( P j + 1 P j 1 ) ρ 6 ( S j + 1 + 3 S j + 2 S j 1 ) + ρ 3 360 ( 4 G j + 1 + 21 G j + 5 G j 1 ) ,
From Equations (6) and (7), we get
P j + 1 2 P j + P j 1 = ρ 2 15 ( S j + 1 + 13 S j + S j 1 ) ρ 4 360 ( G j + 1 8 G j + G j 1 ) .
Equations (6) and (8) yield
P j + 1 2 P j + P j 1 = ρ 2 6 ( S j + 1 + 4 S j + S j 1 ) ρ 4 180 ( 2 G j + 1 + 11 G j + 2 G j 1 ) .
Using Equations (9) and (10), the following relations are obtained
ρ 2 S j = P j + 1 2 P j + P j 1 ρ 4 360 ( G j + 1 + 28 G j + G j 1 ) ,
ρ 4 G j = 20 ( P j + 1 2 P j + P j 1 ) 2 ρ 2 3 ( S j + 1 + 28 S j + S j 1 ) .
Eliminating S i , i = j 1 , j , j + 1 , from Equation (9) using Equation (11) to obtain the following CR in positions of the 4th-order derivative of G j and P j , as:
P j + 2 4 P j + 1 + 6 P j 4 P j 1 + P j 2 = ρ 4 360 ( G j + 2 + 56 G j + 1 + 246 G j + 56 G j 1 + G j 2 ) , j = 2 , 3 , , k 2 .
In the ( k 1 ) unknowns, the system (13) generates ( k 3 ) linear algebraic equations. Two further equations (end conditions) are required for ( P j , j = 1 , 2 , , k 1 ) . Taylor series and the technique of undetermined coefficients can be used to derive the two end conditions. Following two end equations are used for unique solution
2 P 0 + 5 P 1 4 P 2 + P 3 = ρ 2 S 0 + ρ 4 360 ( 28 G 0 + 245 G 1 + 56 G 2 + G 3 ) ,
and
P k 3 4 P k 2 + 5 P k 1 2 P k = ρ 2 S k + ρ 4 360 ( G k 3 + 56 G k 2 + 245 G k 1 + 28 G k ) .
An alternative derivation of Equation (13) is given in Appendix A.

2.3. Temporal Discretization

In this section, we discretize the Caputo time-fractional derivative using the Backward Euler scheme. Let us consider t n = n Δ t , n = 0 , 1 , , K , where Δ t = T K is called the time step size. The Caputo FD at time t = t n + 1 , can be taken as:   
0 t n + 1 χ ( s , ψ ) ψ ( t n + 1 ψ ) γ d ψ = i = 0 n t i t i + 1 χ ( s , ψ ) ψ ( t n + 1 ψ ) γ d ψ = i = 0 n χ ( s , t i + 1 ) χ ( s , t i ) Δ t t i t i + 1 ( t n + 1 ψ ) γ d ψ + l Δ t n + 1 = i = 0 n χ ( s , t i + 1 ) χ ( s , t i ) Δ t t n i t n + 1 i σ γ d σ + l Δ t n + 1 = i = 0 n χ ( s , t n i + 1 ) χ ( s , t n i ) Δ t t i t 1 + i σ γ d σ + l Δ t n + 1 = 1 1 γ i = 0 n χ ( s , t n i + 1 ) χ ( s , t n i ) Δ t γ ( ( i + 1 ) 1 γ i 1 γ ) + l Δ t n + 1 = 1 1 γ i = 0 n q i χ ( s , t n i + 1 ) χ ( s , t n i ) Δ t γ + l Δ t n + 1 ,
where q i = ( i + 1 ) 1 γ i 1 γ and σ = ( t n + 1 ψ ) . From definition of CTFD, we have
γ χ ( s , t n + 1 ) t γ = 1 Γ ( 2 γ ) i = 0 n q i χ ( s , t n i + 1 ) χ ( s , t n i ) Δ t γ + l Δ t n + 1 .
Define the semi-discrete FD operator V t γ as:
V t γ χ ( s , t n + 1 ) : = 1 Γ ( 2 γ ) i = 0 n q i χ ( s , t n i + 1 ) χ ( s , t n i ) Δ t γ .
Then, Equation (17) can be taken as:
γ χ ( s , t n + 1 ) t γ = V t γ χ ( s , t n + 1 ) + l Δ t n + 1 ,
where l Δ t n + 1 is the truncation error (TE) between γ χ ( s , t n + 1 ) t γ and V t γ χ ( s , t n + 1 ) in [20]. The scheme (1) using V t γ χ ( s , t n + 1 ) may be expressed below as an approximation of time-fractional CD at time point t = t n + 1 ,
V t γ χ ( s , t n + 1 ) + η 4 χ ( s , t n + 1 ) s 4 = g ( s , t n + 1 ) .
The given equation yields the following form when using Equation (17)
c h i n + 1 ( s ) + μ η χ s s s s n + 1 = ( 1 q 1 ) χ n ( s ) + i = 1 n 1 ( q i q i + 1 ) χ n i ( s ) + q n χ 0 ( s ) + μ g n + 1 ( s ) , n = 1 ( 1 ) K 1 ,
where χ n + 1 ( s ) = χ ( s , t n + 1 ) and μ = Δ t γ Γ ( 2 γ ) , with BCs and the following IC
χ 0 = v 0 ( s ) , 0 s b .
Remark 1.
These are the characteristics of the coefficients q i in Equation (16)
  • q i ’s are non-negative when i = 0 , 1 , , n
  • 1 = q 0 > q 1 > q 2 > q 3 > > q n , q n 0 as n
  • i = 0 n ( q i q i + 1 ) + q n + 1 = ( 1 q 1 ) + i = 1 n 1 ( q i q i + 1 ) + q n = 1
Also the term l Δ t n + 1 is bounded. i.e.,
l Δ t n + 1 c Δ t 2 γ ,
where c is a constant that is determined by χ.
To apply this three time level approach, the χ 0 and χ 1 time levels are required. The scheme (19) can be stated in the following way for n = 1 as:
χ 2 ( s ) + μ η χ s s s s 2 = ( 1 q 1 ) χ 1 ( s ) + q 1 χ 0 ( s ) + μ g 2 ( s ) .
For n = 0 , the scheme can be written as:
χ 1 ( s ) + μ η χ s s s s 1 = v 0 ( s ) + μ g 1 ( s ) .
Also, the Equations (19) and (22), as well as BCs and IC, make up the entire semi-discrete issue of Equation (1). The term l n + 1 is defined as follows [20]:
l n + 1 : = μ γ χ ( s , t n + 1 ) t γ V t γ χ ( s , t n + 1 ) .
The error term l n + 1 derives from Equations (18) and (20) and has the following form:
l n + 1 = ϖ l Δ t n + 1 c χ Δ t 2 ,
where ϖ = Γ ( 2 γ ) Δ t γ .
In order to bring the weak representation of the problem, several functional spaces, along with their established norms and inner product (IP), are defined as follows:
P 2 ( Λ ) = ψ L 2 ( Λ ) , ψ s , ψ s s L 2 ( Λ ) ,
P 0 2 ( Λ ) = ψ P 2 ( Λ ) , ψ | Λ = 0 , ψ s | Λ = 0 ,
P k ( Λ ) = ψ L 2 ( Λ ) , d r ψ d s r L 2 ( Λ ) , for all positive integer r k ,
where ψ s = d ψ d s and ψ s s = d 2 ψ d s 2 . The IP and norm of P 2 ( Λ ) can be determined by
ϕ , ψ 2 = ϕ , ψ + ϕ s , ψ s + ϕ s s , ψ s s , ψ 2 = ψ , ψ 2 1 2 .
The norm . of the space P k Λ is defined as:
ψ k = r = 0 k d r ψ d s r 0 2 1 2 .
It is preferable to define . 2 by instead of using the above usual P 2 -norm
ψ 2 = ψ 0 2 + μ η ψ s s 0 2 1 / 2 .
The following required variational weak version of Equations (19) and (22) is used to investigate the stability and convergence, i.e., finding χ k + 1 P 0 2 ( Λ ) , such that ψ P 0 2 ( Λ ) ,   
χ n + 1 , ψ + μ η 4 χ n + 1 s 4 , ψ = 1 q 1 χ n , ψ + i = 1 n 1 q i q i + 1 χ n i , ψ + q n χ 0 , ψ + μ g n + 1 , ψ ,
and
χ 1 , ψ + μ η 4 χ 1 s 4 , ψ = χ 0 , ψ + μ g 1 , ψ .

2.4. The Stability Analysis

The following theorem discusses the semi-discrete problem’s stability analysis.
Theorem 1.
In the sense that it holds for every Δ t > 0 , the semi-discrete issue is unconditionally stable
χ n + 1 2 χ 0 0 + μ i = 1 n + 1 g i 0 , n = 0 , 1 , , K 1 ,
where . 2 is defined in Equation (25).
Proof. 
To establish the result, mathematical induction is utilized. When n = 0 and ψ = χ 1 are used in Equation (27), it may be expressed as follows:
χ 1 , χ 1 + μ η 4 χ 1 s 4 , χ 1 = χ 0 , χ 1 + μ g 1 , χ 1 .
The preceding equation becomes the following when by parts integration is used
χ 1 , χ 1 + μ η 2 χ 1 s 2 , 2 χ 1 s 2 = χ 0 , χ 1 + μ g 1 , χ 1 ,
Because of BCs on ψ , all boundary-related contributions have vanished. Using ψ 0 ψ 2 and Schwarz inequality, Equation (30) yields
χ 1 2 2 χ 0 0 χ 1 0 + μ g 1 0 χ 1 0 χ 0 0 χ 1 2 + μ g 1 0 χ 1 2 χ 1 2 χ 0 0 + μ g 1 0 .
Next, suppose that the result holds for ψ = χ i . i.e.,
χ i 2 χ 0 0 + μ j = 1 i g j 0 , i = 2 , 3 , , n .
Let ψ = χ n + 1 in Equation (26), it can be written as:
χ n + 1 , χ n + 1 + μ η 4 χ n + 1 s 4 , χ n + 1 = 1 q 1 χ n , χ n + 1 + i = 1 n 1 q i q i + 1 χ n i , χ n + 1 + q n χ 0 , χ n + 1 + μ g n + 1 , χ n + 1 .
The preceding equation becomes the following when by parts integration is used
χ n + 1 , χ n + 1 + μ η 2 χ n + 1 s 2 , 2 χ n + 1 s 2 = 1 q 1 χ n , χ n + 1 + i = 1 n 1 q i q i + 1 χ n i , χ n + 1 + q n χ 0 , χ n + 1 + μ g n + 1 , χ n + 1 ,
Because of BCs on ψ , all boundary-related contributions have vanished. Using Schwarz inequality and ψ 0 ψ 2 , the above equation yields
χ n + 1 2 2 1 q 1 χ n 0 χ n + 1 0 + i = 1 n 1 q i q i + 1 χ n i 0 χ n + 1 0 + q n χ 0 0 χ n + 1 0 + μ g n + 1 0 χ n + 1 0 ,
or
χ n + 1 2 2 1 q 1 χ n 0 χ n + 1 2 + i = 1 n 1 q i q i + 1 χ n i 0 χ n + 1 2 + q n χ 0 0 χ n + 1 2 + μ g n + 1 0 χ n + 1 2 ,
or
χ n + 1 2 1 q 1 χ k 0 + i = 1 n 1 q i q i + 1 χ n i 0 + q n χ 0 0 + μ g n + 1 0 .
Using Equation (32), the above equation becomes
χ n + 1 2 χ 0 0 + μ i = 1 n g i 0 1 q 1 + i = 1 n 1 q i q i + 1 + q n + μ g n + 1 0 .
Using properties of q i , it can be rewritten as:
χ n + 1 2 χ 0 0 + μ i = 1 n + 1 g i 0 .
   □
Lemma 1.
Consider χ ( s , t ) be the exact solution of problem (1) and { χ n } n = 0 K be the time-discrete solution of Equations (26) and (27) with IC. Then it holds
χ ( t n ) χ n 2 c χ q n 1 1 Δ t 2 , n = 1 , 2 , , K .
Proof. 
Let e n = χ ( s , t n ) χ n ( s ) , for n = 1 , by coalescing Equations (1), (25) and (27), the error equation can be expressed in following form as:
e 1 , ψ + μ η 2 e 1 s 2 , 2 ψ s 2 = e 0 , ψ + l 1 , ψ , ψ P 0 2 ( Λ ) .
Let ψ = e 1 , noting e 0 = 0 gives
e 1 2 l 1 0 .
From above equation and Equation (24),
χ ( t 1 ) χ 1 2 c χ q 0 1 Δ t 2 .
Thus, the Equation (39) is completed for n = 1 .
The Equation (39) satisfies for n = 1 ( 1 ) r , i.e.,
χ ( t n ) χ n 2 c χ q n 1 1 Δ t 2 .
The Equations (1), (25) and (26) can be used for n = r + 1 , the error equation for all ψ P 0 2 ( Λ ) can be written as:
e n + 1 , ψ + μ η 2 e n + 1 s 2 , 2 ψ s 2 = 1 q 1 e n , ψ + i = 1 n 1 q i q i + 1 e n i , ψ + q n e 0 , ψ + l n + 1 , ψ .
Take ψ = e n + 1 , use the induction assumption and the relation q i 1 q i + 1 1 < 1 for all non negative integer i, then above equation becomes
e n + 1 2 c χ q n 1 Δ t 2 .
   □
Using the definition of q n , the following equation may be derived as:
lim n q n 1 1 n γ = lim n n γ n 1 γ ( n 1 ) 1 γ = lim n n 1 1 ( 1 1 n ) 1 γ = 1 ( 1 γ ) .
The function Θ ( y ) can be defined as: Θ ( y ) : = y γ y 1 γ ( y 1 ) 1 γ . This function is increasing on y for all y > 1 since Θ ( y ) 0 , y > 1 . It can be concluded that 1 < n , q n 1 1 n γ is increasingly tends to 1 ( 1 γ ) . As, n γ q n 1 1 = 1 for n = 1 , hence it can written in following form
n γ q n 1 1 1 ( 1 γ ) , n = 1 , 2 , , K .
Consequently, for all n such that n Δ t T ,
χ ( t n ) χ n 2 c χ q n 1 1 Δ t 2 = c χ n γ q n 1 1 n γ Δ t 2 γ + γ c χ 1 1 γ ( n Δ t ) γ Δ t 2 γ c χ , γ T γ Δ t 2 γ .
The above results can be summarized in the following theorem as:
Theorem 2.
Let χ be the exact solution of Equation (1) and { χ n } n = 0 K be the time-discrete solution of Equations (26) and (27) with IC χ 0 = v 0 ( s ) , 0 s b , then it holds
χ ( t n ) χ n 2 c χ , γ T γ Δ t 2 γ , n = 1 , 2 , , K .

2.5. Space Discretization

Consider the grid points ( s j , t n ) of a uniform mesh with, to discretize the region [ 0 , b ] × [ 0 , T ] , where s j = j h , j = 0 , 1 , , k , and t n = n Δ t , n = 0 , 1 , , K , T = K Δ t . The Δ t and ρ are the step sizes in the time and space, respectively.
The space discretization of Equation (19) using SPS is carried out as:
P j n + 1 + μ η G j n + 1 = ( 1 q 1 ) P j n + i = 1 n 1 ( q i q i + 1 ) P j n i + q n v j + μ g j n + 1 .
The operator Ω is defined as follows:
Ω p i = 246 p i + 56 ( p i 1 + p i + 1 ) + ( p i 2 + p i + 2 ) .
Now, Equation (13) can be written as:
Ω G j = 360 ρ 4 ( P j 2 4 P j 1 + 6 P j 4 P j + 1 + P j + 2 ) .
Using operator Ω , the Equation (43) yields,
P j 2 n + 1 + 56 P j 1 n + 1 + 246 P j n + 1 + 56 P j + 1 n + 1 + P j + 2 n + 1 + μ η 360 ρ 4 P j 2 n + 1 4 P j 1 n + 1 + 6 P j n + 1 4 P j + 1 n + 1 + P j + 2 n + 1 = 1 q 1 P j 2 n + 56 P j 1 n + 246 P j n + 56 P j + 1 n + P j + 2 n + i = 1 n 1 q i q i + 1 P j 2 n i + 56 P j 1 n i + 246 P j n i + 56 P j + 1 n i + P j + 2 n i + q n v j 2 + 56 v j 1 + 246 v j + 56 v j + 1 + v j + 2 + μ ( g j 2 n + 1 + 56 g j 1 n + 1 + 246 g j n + 1 + 56 g j + 1 n + 1 + g j + 2 n + 1 ) ,
n = 1 , 2 , , K 1 .
The system gets simpler once, it has been simplified
1 + μ η 360 ρ 4 P j 2 n + 1 + 56 4 μ η 360 ρ 4 P j 1 n + 1 + 246 + 6 μ η 360 ρ 4 P j n + 1 + 56 4 μ η 360 ρ 4 P j + 1 n + 1 + 1 + μ η 360 ρ 4 P j + 2 n + 1 = Q j , n = 1 , 2 , , K 1 , j = 2 , 3 , , k 2 ,
where,
Q j = 1 q 1 P j 2 n + 56 P j 1 n + 246 P j n + 56 P j + 1 n + P j + 2 n + i = 1 n 1 q i q i + 1 P j 2 n i + 56 P j 1 n i + 246 P j n i + 56 P j + 1 n i + q j + 2 n i + q n v j 2 + 56 v j 1 + 246 q j + 56 v j + 1 + v j + 2 + μ ( g j 2 n + 1 + 56 g j 1 n + 1 + 246 g j n + 1 + 56 g j + 1 n + 1 + g j + 2 n + 1 ) .
In the ( k 1 ) unknowns ( P j n + 1 , j = 1 , 2 , , k 1 ) , the system (48) gives ( k 3 ) equations, hence two additional equations are required to obtain a full solution for P j n + 1 to be derived.

2.6. Initial State

A five-point approach has been proposed. To use this approach, there is need to find the values of P 2 = [ P 1 2 , P 2 2 , , P k 1 2 ] T and P 1 = [ P 1 1 , P 2 1 , , P k 1 1 ] T . To obtain the value of P 2 , there is need to find P 1 . The value of P 1 can be obtained, solving Equation (18) using SPST, as:
1 + μ η 360 ρ 4 P j 2 1 + 56 4 μ η 360 ρ 4 P j 1 1 + 246 + 6 μ η 360 ρ 4 P j 1 + 56 4 μ η 360 ρ 4 P j + 1 1 + 1 + μ η 360 ρ 4 P j + 2 1 = J j , j = 2 , 3 , , k 2 ,
where,
J j = v j 2 + 56 v j 1 + 246 v j + 56 v j + 1 + v j + 2 + μ ( g j 2 1 + 56 g j 1 1 + 246 g j 1 + 56 g j + 1 1 + g j + 2 1 ) .
The Equation (49) provides a system of linear equations ( k 3 ) × ( k 1 ) with unknown ( P j 1 , j = 1 , 2 , , k 1 ) . For a unique solution of this system, we have added two end equations which are given by:
28 2 μ η 360 ρ 4 P 0 1 + 245 + 5 μ η 360 ρ 4 P 1 1 + 56 4 μ η 360 ρ 4 P 2 1 + 1 + μ η 360 ρ 4 P 3 1 = 28 v 0 + 245 v 1 + 56 v 2 + v 3 + μ ( 28 g 0 1 + 245 g 1 1 + 56 g 2 1 + g 3 1 ) ,
and
1 + μ η 360 ρ 4 P k 3 1 + 56 4 μ η 360 ρ 4 P k 2 1 + 245 + 5 μ η 360 ρ 4 P k 1 1 + 28 2 μ η 360 ρ 4 P k 1 = v k 3 + 56 v k 2 + 245 v k 1 + 28 v k + μ ( g k 3 1 + 56 g k 2 1 + 245 g k 1 1 + 28 g k 1 ) .
Let v = [ v 1 , v 2 , , v k 1 ] T , g = [ g 1 1 , g 2 1 , , g k 1 1 ] T , v ˜ = [ v 0 , 0 , , 0 , v k ] T and g ˜ = [ g 0 1 , 0 , , 0 , g k 1 ] T be the ( k 1 ) dimensional column vectors. The system given by (49)–(51) can be written in matrix form as follows:
A P 1 = B ( v + g ) + C ( v ˜ + g ˜ ) ,
where,
A = 245 + 5 μ η 360 ρ 4 56 4 μ η 360 ρ 4 1 + μ η 360 ρ 4 56 4 μ η 360 ρ 4 246 + 6 μ η 360 ρ 4 56 4 μ η 360 ρ 4 1 + μ η 360 ρ 4 1 + μ η 360 ρ 4 56 4 μ η 360 ρ 4 246 + 6 μ η 360 ρ 4 56 4 μ η 360 ρ 4 1 + μ η 360 ρ 4 1 + μ η 360 ρ 4 56 4 μ η 360 ρ 4 246 + 6 μ η 360 ρ 4 56 4 μ η 360 ρ 4 1 + μ η 360 ρ 4 1 + μ η 360 ρ 4 246 + 6 μ η 360 ρ 4 56 4 μ η 360 ρ 4 56 4 μ η 360 ρ 4 1 + μ η 360 ρ 4 56 4 μ η 360 ρ 4 245 + 5 μ η 360 ρ 4 ,
B = 245 56 1 56 246 56 1 1 56 246 56 1 1 56 256 56 1 1 56 246 56 1 56 245 ,
and
C = 28 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 28 .
are ( k 1 ) × ( k 1 ) matrices.

2.7. Truncation Error for the Spatial Direction

The Equation (46) can be written in the following form, as:
ρ 4 ( 360 + 60 δ s 2 + δ s 4 ) P j n + 1 + 360 μ η δ s 4 P j n + 1 = Q j ,
where,
Q j = ρ 4 ( 1 q 1 360 + 60 δ s 2 + δ s 4 P j n + 1 + i = 1 n 1 q i q i + 1 360 + 60 δ s 2 + δ s 4 P j n i + q n 360 + 60 δ s 2 + δ s 4 v j + μ ( 360 + 60 δ s 2 + δ s 4 ) g j n + 1 ) .
Expanding Equation (52) with Taylor series in terms of P ( s j , t n ) and its spatial derivatives, the following relations are obtained
δ s 4 P ( s j , t n ) = ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + P ( s j , t n ) , δ s 2 P ( s j , t n ) = ρ 2 D s 2 + 2 ρ 4 4 ! D s 4 + 2 ρ 6 6 ! D s 6 + 2 ρ 8 8 ! D s 8 + P ( s j , t n ) .
Using Equations (52) and (53), the truncation error is obtained as:
T j = ρ 4 ( 360 + 60 δ s 2 + δ s 4 ) P j n + 1 + 360 μ η δ s 4 P j n + 1 ρ 4 ( 1 q 1 ( 360 + 60 δ s 2 + δ s 4 ) P j n + 1 + i = 1 n 1 q i q i + 1 360 + 60 δ s 2 + δ s 4 P j n i + q n 360 + 60 δ s 2 + δ s 4 v j + μ ( 360 + 60 δ s 2 + δ s 4 ) ( D t 2 γ + η D s 4 ) P j n + 1 ) ,
T j = ρ 4 ( 360 + 60 ρ 2 D s 2 + 2 ρ 4 4 ! D s 4 + 2 ρ 6 6 ! D s 6 + 2 ρ 8 8 ! D s 8 + + ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) ) P j n + 1 + 360 μ η ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) P j n + 1 ρ 4 ( ( 1 q 1 ) ( 360 + 60 ( ρ 2 D s 2 + 2 ρ 4 4 ! D s 4 + 2 ρ 6 6 ! D s 6 + 2 ρ 8 8 ! D s 8 + ) + ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) ) P j n + 1 + i = 1 n 1 ( q i q i + 1 ) ( 360 + 60 ( ρ 2 D s 2 + 2 ρ 4 4 ! D s 4 + 2 ρ 6 6 ! D s 6 + 2 ρ 8 8 ! D s 8 + ) + ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) ) P j n i + q n ( 360 + 60 ( ρ 2 D s 2 + 2 ρ 4 4 ! D s 4 + 2 ρ 6 6 ! D s 6 + 2 ρ 8 8 ! D s 8 + ) + ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) ) v j + μ ( 360 + 60 ( ρ 2 D s 2 + 2 ρ 4 4 ! D s 4 + 2 ρ 6 6 ! D s 6 + 2 ρ 8 8 ! D s 8 + ) + ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) ) ( D t 2 γ + η D s 4 ) P j n + 1 )
= ( 360 ρ 4 + 60 ρ 6 D s 2 + 2 ρ 8 4 ! D s 4 + 2 ρ 10 6 ! D s 6 + 2 ρ 12 8 ! D s 8 + + ( ρ 8 D s 4 + ρ 10 6 D s 6 + ρ 12 80 D s 8 + 17 ρ 14 3024 D s 10 + 62 ρ 16 10 ! D s 12 + ) ) P j n + 1 + 360 μ η ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) P j n + 1 ρ 4 ( ( 1 q 1 ) ( 360 + 60 ( ρ 2 D s 2 + 2 ρ 4 4 ! D s 4 + 2 ρ 6 6 ! D s 6 + 2 ρ 8 8 ! D s 8 + ) + ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) ) P j n + 1 + i = 1 n 1 ( q i q i + 1 ) ( 360 + 60 ( ρ 2 D s 2 + 2 ρ 4 4 ! D s 4 + 2 ρ 6 6 ! D s 6 + 2 ρ 8 8 ! D s 8 + ) + ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) ) P j n i + q n ( 360 + 60 ( ρ 2 D s 2 + 2 ρ 4 4 ! D s 4 + 2 ρ 6 6 ! D s 6 + 2 ρ 8 8 ! D s 8 + ) + ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) ) v j + μ ( 360 + 60 ( ρ 2 D s 2 + 2 ρ 4 4 ! D s 4 + 2 ρ 6 6 ! D s 6 + 2 ρ 8 8 ! D s 8 + ) + ( ρ 4 D s 4 + ρ 6 6 D s 6 + ρ 8 80 D s 8 + 17 ρ 10 3024 D s 10 + 62 ρ 12 10 ! D s 12 + ) ) ( D t 2 γ + η D s 4 ) P j n + 1 )
With the help of above discussion and Theorem 2, the scheme obtained is of O ( ρ 4 + t 2 γ ) .

3. Results and Discussion

In this section, two numerical examples of proposed method are presented to check the accuracy, effectiveness, and correctness of the proposed approach by adding 3D graphs and some results in tabular form. 3D Graph technology is such a technique to be used for projecting multidimensional data/arrays into a visual form that is easier to understand, analyze and interpret, thus authors showed an accuracy of approximate solutions to the true solution by 3D plots. Mathematica and Matlab are used to do the computations using the steps given in Algorithm 1.
Algorithm 1:  Coding algorithm for the proposed scheme
 Input b, N, k, K, and γ .
 Step 1. Define each sextic spline segment T j ( s ) .
 Step 2. Construct consistency relation Equation (13) and two end Equations (14) and (15).
 Step 3. Approximate Caputo FD at time t = t n + 1 as in Equation (17).
 Step 4. Using the semi-discrete FD operator V t γ , the Equation (17) is converted to Equation (19).
 Step 5. Using SPS for space discretization to convert Equations (19) to (43).
 Step 6. Compute the elements of the vectors v , g , v ˜ and g ˜ .
 Step 7. Compute the elements of the matrices A, B and C.
 Step 8. Compute the elements of the matrice P 1 = A 1 B ( v + g ) + A 1 C ( v ˜ + g ˜ ) .
Output χ n K
Example 1.
Consider a higher-order PDE
γ χ t γ + η 4 χ s 4 = g ( s , t ) , s [ 0 , 1 ] , t ( 0 , T ] ,
with the IC
χ ( s , 0 ) = s i n ( π s ) , s [ 0 , 1 ]
and BCs
χ ( s , t ) | s = 0 = χ ( s , t ) | s = 1 = 0 , χ s s ( s , t ) | s = 0 = χ s s ( s , t ) | s = 1 = 0 , t [ 0 , T ] ,
where g ( s , t ) = sin ( π s ) t 1 γ E 1 , 2 γ ( t ) + η π 4 exp ( t ) sin ( π s ) and E γ , μ ( s ) is the two parameter function of M i t t a g -Leffler type. The analytical solution of the proposed problem is
χ ( s , t ) = sin π s exp ( t ) .
The above equation yields the following equation when γ is one,
χ t + η 4 χ s 4 = g ( s , t ) , s [ 0 , 1 ] , t [ 0 , T ] .
The γ = 0.75 and η = 0.01 are used to solve this problem. The greatest absolute L and L 2 error norms for k = 40 and k = 80 with Δ t = 0.000001 are reported in Table 1. To prevent contaminating spatial and temporal-discretization errors, Δ t is set to a relatively modest value in this problem. The Kth time level is modified to assess the correctness of the presented approach, which demonstrates its efficiency. The suggested technique accurately approximates the analytical solution, as shown in Table 1. As illustrated in Figure 1, the numerical and precise solutions are displayed using k = 40 , K = 500 , and Δ t = 0.000001.
Example 2.
Consider another higher-order PDE
γ χ t γ + η 4 χ s 4 = g ( s , t ) , s [ 0 , 1 ] , 0 < t T ,
with the IC
χ ( s , t ) | t = 0 = 0 , s [ 0 , 1 ]
and BCs
χ ( s , t ) | s = 0 = χ ( s , t ) | s = 1 = 0 , χ s s ( s , t ) | s = 0 = χ s s ( s , t ) | s = 1 = 0 , 0 t T ,
The true solution of the problem is
χ ( s , t ) = t sin π s .
The above equation yields the following equation when γ is one,
χ t + η 4 χ s 4 = g ( s , t ) , s [ 0 , 1 ] , t [ 0 , T ] .
Here g ( s , t ) = sin ( π s ) 1 Γ ( 2 γ ) t 1 γ + η π 4 t sin ( π s ) . The γ = 0.5 and η = 0.05 are used to solve this problem. The greatest absolute L and L 2 error norms for k = 40 and k = 80 with Δ t = 0.000001 are reported in Table 2. To prevent contaminating spatial and temporal-discretization errors, Δ t is set to a relatively modest value in this problem. The Kth time level is modified to assess the correctness of the presented approach, which demonstrates its efficiency. The suggested technique accurately approximates the analytical solution, as shown in Table 2. As illustrated in Figure 2, the numerical and precise solutions are displayed using k = 40 , K = 500 , and Δ t = 0.000001.

4. Conclusions

The fourth-order problems play a significant role in modern science and engineering and their solutions are need to be examined in order to understand the dynamical framework of plate-models of bridge slabs, floor systems, window glasses and airplane wings. The approximate solution of 4th-order EP with time-fractional CD has been accomplished using an SPST in this study. The time discretization has been done using the backward Euler formula. Sextic spline approach has been utilized for spatial derivative discretization. The approximate solution converges to the analytical solution with order O ( ρ 4 + Δ t 2 γ ) . Numerical test applications have been presented to show the accuracy of the sextic spline technique. The presented scheme has been found to provide highly accurate results. The efficacy of the proposed techniques has been established by calculating the error norms for the obtained results.

Author Contributions

Conceptualization, G.A., M.A., H.T., M.S., T.A. and M.A.A.; Formal analysis, G.A., M.A., H.T., M.S., T.A. and M.A.A.; Investigation, G.A., M.A., H.T., M.S., T.A. and M.A.A.; Methodology, G.A., M.A., H.T., M.S., T.A. and M.A.A.; Software, G.A., M.A., H.T., M.S., T.A. and M.A.A.; Visualization, G.A., M.A., H.T., M.S., T.A. and M.A.A.; Writing—original draft, G.A., M.A., H.T., M.S., T.A. and M.A.A.; writing—review and editing, G.A., M.A., H.T., M.S., T.A. and M.A.A.; supervision, G.A.; Funding acquisition, M.A., T.A. and M.A.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.

Acknowledgments

The author T.A. would like to thank Prince Sultan University for paying APC and for the support through the TAS research lab and the research of author M.A. Alqudah was supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number (PNURSP2022R14), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. An Alternative Derivation

In this appendix, we explain how the expression of the Equation (13) is symmetric with respect to j ± 2 , j ± 1 ? This can be given systematically as follows:
T j ( s ) = a j ( s s j ) 6 + b j ( s s j ) 5 + c j ( s s j ) 4 + d j ( s s j ) 3 + e j ( s s j ) 2 + g j ( s s j ) + v j , s [ s j , s j + 1 ] ,
T j ( s ) = a ˜ j ( s s j ) 6 + b ˜ j ( s s j ) 5 + c ˜ j ( s s j ) 4 + d ˜ j ( s s j ) 3 + e ˜ j ( s s j ) 2 + g ˜ j ( s s j ) + v ˜ j , s [ s j 1 , s j ] .
Since T j C 5 at s = s j , we have,
b ˜ j = b j , c ˜ j = c j , d ˜ j = d j , e ˜ j = e j , g ˜ j = g j , v ˜ j = v j .
We denote,
T j ( s j ) = P j , T j ( 2 ) ( s j ) = S j , T j ( 4 ) ( s j ) = G j ,
T j ( s j + 1 ) = P j + 1 , T j ( 2 ) ( s j + 1 ) = S j + 1 , T j ( 4 ) ( s j + 1 ) = G j + 1 ,
T j ( s j 1 ) = P j 1 , T j ( 2 ) ( s j 1 ) = S j 1 , T j ( 4 ) ( s j 1 ) = G j 1 .
By Equation (A4), we have
P j = T j ( s j ) = v j , S j = T j ( 2 ) ( s j ) = 2 e j , G j = T j ( 4 ) ( s j ) = 24 c j .
The sum of (A5) and (A15) implies
P j + 1 + P j 1 = T j ( s j + 1 ) + T j ( s j 1 ) = ( a j + a ˜ j ) ρ 6 + 2 c j ρ 4 + 2 e j ρ 2 + 2 v j = A j ρ 6 + 1 12 G j ρ 4 + S j ρ 2 + 2 P j ,
S j + 1 + S j 1 = T j ( 2 ) ( s j + 1 ) + T j ( 2 ) ( s j 1 ) = 30 ( a j + a ˜ j ) ρ 4 + 24 c j ρ 2 + 4 e j = 30 A j ρ 4 + G j ρ 2 + 2 S j ,
G j + 1 + G j 1 = T j ( 4 ) ( s j + 1 ) + T j ( 4 ) ( s j 1 ) = 360 ( a j + a ˜ j ) ρ 2 + 48 c j = 360 A j ρ 4 + 2 G j ,
where, A j = ( a j + a ˜ j ) .
We employ the notation of Ω defined in Equation (44) and introduce the discrete Laplacian L and its square L 2 by
L p i = p i + 1 2 p i + p i 1 , L 2 p i = p i + 2 4 p i + 1 + 6 p i 4 p i 1 + p i 2 , Ω p i = p i + 2 + 56 p i + 1 + 246 p i + 56 p i 1 + p i 2 = ( L 2 p + 60 L p + 360 p ) i .
Using these notation, we write (A8)–(A10) as:
L P = ρ 6 A + 1 12 ρ 4 G + ρ 2 S ,
L S = 30 ρ 4 A + ρ 2 G ,
L G = 360 ρ 2 A .
Then, L ( A 12 ) + ρ 2 ( A 13 ) ρ 4 1 360 L + 1 12 ( A 14 ) provides
L 2 P = ρ 4 G + 1 6 L G + 1 360 L 2 G = ρ 4 360 Ω G .
In this case, it is noted that Z j does not contribute to the computation and the results. References

References

  1. Podlubny, I. Fractional Differential Equations; Academic Press: New York, NY, USA, 1999. [Google Scholar]
  2. Oldham, K.B.; Spanier, J. The Fractional Calculus; Academic Press: New York, NY, USA, 1974. [Google Scholar]
  3. Berdyshev, A.S.; Eshmatov, B.E.; Kadirkulov, B.J. Boundary value problems for fourth-order mixed type equation with fractional derivative. Electron. J. Differ. Equ. 2016, 36, 1–11. [Google Scholar]
  4. He, J.H. A new fractal derivation. Therm. Sci. 2011, 15, 145–147. [Google Scholar] [CrossRef]
  5. Wang, K.L.; Wang, H. A novel variational approach for fractal Ginzburg-Landau equation. Fractals 2021, 29, 2150205-131. [Google Scholar] [CrossRef]
  6. Wang, K.L. Exact solitary wave solution for fractal shallow water wave model by He’s variational method. Mod. Phys. Lett. B 2021, 22, 2150602. [Google Scholar] [CrossRef]
  7. He, J.H.; Ji, F.Y. Two-scale mathematics and fractional calculus for thermodynamics. Therm. Sci. 2019, 23, 2131–2133. [Google Scholar] [CrossRef]
  8. Wang, K.L. A study of the fractal foam drainage model in a microgravity space. Math. Methods Appl. Sci. 2021, 44, 10530–10540. [Google Scholar] [CrossRef]
  9. Yang, X.H.; Xu, D.; Zhang, H.X. Crank-Nicolson/quasi-wavelets method for solving fourth order partial integro-differential equation with a weakly singular kernel. J. Comput. Phys. 2013, 234, 317–329. [Google Scholar] [CrossRef]
  10. Liu, Y.; Fang, Z.; Li, H.; He, S. A mixed finite element method for a time-fractional fourth-order partial differential equation. Appl. Math. Comput. 2014, 243, 703–717. [Google Scholar] [CrossRef]
  11. Khan, N.A.; Khan, N.U.; Ayaz, M.; Mahmood, A.; Fatima, N. Numerical study of timefractional fourth-order differential equations with variable coefficients. J. King Saud Univ. Sci. 2011, 23, 91–98. [Google Scholar] [CrossRef] [Green Version]
  12. Moghaddam, B.P.; Machado, J.A.T.; Behforooz, H. An integro quadratic spline approach for a class of variable-order fractional initial value problems. Chaos Solitons Fractals 2017, 102, 354–360. [Google Scholar] [CrossRef]
  13. Roul, P.; Goura, V.M.K.P.; Cavoretto, R. A numerical technique based on B-spline for a classof time-fractional diffusion equation. Numer. Methods Partial Differ. Equ. 2021, 1–20. [Google Scholar] [CrossRef]
  14. Abdeljawad, T.; Agarwal, R.P.; Karapinar, E.; Kumari, P.S. Solutions of the nonlinear integral equation and fractional differential equation using the technique of a fixed point with a numerical experiment in extended b-metric space. Symmetry 2019, 11, 686. [Google Scholar] [CrossRef] [Green Version]
  15. El-Sayed, A.A.; Baleanu, D.; Agarwal, P. A novel Jacobi operational matrix for numerical solution of multi-term variable-order fractional differential equations. J. Taibah Univ. Sci. 2020, 14, 963–974. [Google Scholar] [CrossRef]
  16. Hamasalh, F.K.; Muhammed, P.O. Computational non-polynomial spline function for solving fractional Bagely-Torvik equation. Math. Sci. Lett. 2017, 6, 83–87. [Google Scholar] [CrossRef]
  17. Pedas, A.; Vikerpuur, M. Spline Collocation for Multi-Term Fractional Integro-Differential Equations with Weakly Singular Kernels. Fractal Fract. 2021, 5, 90. [Google Scholar] [CrossRef]
  18. Youssri, Y.H. Orthonormal Ultraspherical Operational Matrix Algorithm for Fractal-Fractional Riccati Equation with Generalized Caputo Derivative. Fractal Fract. 2021, 5, 100. [Google Scholar] [CrossRef]
  19. Cardone, A.; Conte, D.; D’Ambrosio, R.; Paternoster, B. Multivalue Collocation Methods for Ordinary and Fractional Differential Equations. Mathematics 2022, 10, 185. [Google Scholar] [CrossRef]
  20. Lu, Z.; Zhu, Y. Numerical approach for solution to an uncertain fractional differential equation. Appl. Math. Comput. 2019, 343, 137–148. [Google Scholar] [CrossRef]
  21. Gao, W.; Veeresha, P.; Prakasha, D.G.; Baskonus, H.M.; Yel, G. A powerful approach for fractional Drinfeld-Sokolov-Wilson equation with Mittag-Leffler law. Alex. Eng. J. 2019, 58, 1301–1311. [Google Scholar] [CrossRef]
  22. Mirzaee, F.; Samadyar, N. Implicit meshless method to solve 2D fractionalstochastic Tricomi-type equation defined onirregular domain occurring in fractal transonic flow. Numer. Methods Partial Differ. Equ. 2021, 37, 1781–1799. [Google Scholar] [CrossRef]
  23. Shen, L.; Zhu, S.; Liu, B.; Zhang, Z.; Cui, Y. Numerical implementation of nonlinear system offractional Volterra integral-differential equations by Legendre wavelet method and error estimation. Numer. Methods Partial Differ. Equ. 2021, 37, 1344–1360. [Google Scholar] [CrossRef]
  24. Khan, W.A. Numerical simulation of Chun–Hui He’s iteration method with applications in engineering. Int. J. Numer. Methods Heat Fluid Flow 2022, 32, 944–955. [Google Scholar] [CrossRef]
  25. Bueno-Orovio, A.; Kay, D.; Burrage, K. Fourier spectral methods for fractional-in-space reaction-diffusion equations. BIT Numer. Math. 2014, 54, 937–954. [Google Scholar] [CrossRef]
  26. Arqub, O.A.; Shawagfeh, N. Application of reproducing kernel algorithm for solving Dirichlet time-fractional diffusion-Gordon types equations in porous media. J. Porous Media 2019, 22, 411–434. [Google Scholar] [CrossRef]
  27. Prakash, A.; Goyal, M.; Gupta, S. Fractional variational iteration method for solving time-fractional Newell-Whitehead-Segel equation. Nonlinear Eng. 2019, 8, 164–171. [Google Scholar] [CrossRef]
  28. Yaseen, M.; Abbas, M. An efficient computational technique based on cubic trigonometric B-splines for time fractional Burgers’ equation. Int. J. Comput. Math. 2020, 97, 725–738. [Google Scholar] [CrossRef] [Green Version]
  29. Mishra, H.K.; Nagar, A.K. He-Laplace method for linear and nonlinear partial differential equations. J. Appl. Math. 2012, 2012, 180315. [Google Scholar]
  30. Sene, N. Fractional diffusion equation described by the Atangana-Baleanu fractional derivative and its approximate solution. J. Fract. Calc. Nonlinear Syst. 2021, 2, 60–75. [Google Scholar] [CrossRef]
  31. Wahash, H.A.; Panchal, S.K. Positive solutions for generalized Caputo fractional differential equations using lower and upper solutions method. J. Fract. Calc. Nonlinear Syst. 2020, 1, 1–12. [Google Scholar] [CrossRef]
  32. Ji, P.Q.; Wang, J.; Lu, L.X.; Ge, C.F. Li-He’s modified homotopy perturbation method coupled with the energy method for the dropping shock response of a tangent nonlinear packaging system, Journal of Low Frequency Noise. Vib. Act. Control 2021, 40, 675–682. [Google Scholar]
Figure 1. Numerical & analytical solutions when k = 40, K = 500 and γ = 0.75 for Example 1.
Figure 1. Numerical & analytical solutions when k = 40, K = 500 and γ = 0.75 for Example 1.
Fractalfract 06 00170 g001
Figure 2. Numerical and analytical solutions for Example 2 when k = 40, K = 500 and γ = 0.5 .
Figure 2. Numerical and analytical solutions for Example 2 when k = 40, K = 500 and γ = 0.5 .
Fractalfract 06 00170 g002
Table 1. The error norms for various k when Δ t = 0.000001.
Table 1. The error norms for various k when Δ t = 0.000001.
γ = 0.75 kK e K e K 2
40100 1.1389 × 10 3 1.2733 × 10 4
500 4.0224 × 10 3 4.4972 × 10 4
1000 6.9266 × 10 3 7.7442 × 10 4
80100 1.1389 × 10 3 9.0036 × 10 5
500 4.0224 × 10 3 3.18 × 10 4
1000 6.9266 × 10 3 5.476 × 10 4
γ = 1
40100 1.9246 × 10 4 2.1518 × 10 5
500 9.8211 × 10 4 1.098 × 10 4
1000 1.9692 × 10 3 2.2016 × 10 4
80100 1.9246 × 10 4 1.5215 × 10 5
500 9.8211 × 10 4 7.7642 × 10 5
1000 1.9692 × 10 3 1.5568 × 10 4
Table 2. The error norms for various k when Δ t = 0.000001.
Table 2. The error norms for various k when Δ t = 0.000001.
γ = 0.5 kK e K e K 2
40100 9.9755 × 10 5 1.1153 × 10 5
500 4.999 × 10 4 5.5891 × 10 5
1000 9.9994 × 10 4 1.118 × 10 4
80100 9.9755 × 10 5 7.8863 × 10 6
500 4.999 × 10 4 3.9521 × 10 5
1000 9.9994 × 10 4 7.9052 × 10 5
γ = 1
40100 9.7001 × 10 5 1.0845 × 10 5
500 4.9701 × 10 4 5.5567 × 10 5
1000 9.9701 × 10 4 1.1147 × 10 4
80100 9.7001 × 10 5 7.6686 × 10 6
500 4.9701 × 10 4 3.9292 × 10 5
1000 9.9701 × 10 4 7.8821 × 10 5
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Akram, G.; Abbas, M.; Tariq, H.; Sadaf, M.; Abdeljawad, T.; Alqudah, M.A. Numerical Approximations for the Solutions of Fourth Order Time Fractional Evolution Problems Using a Novel Spline Technique. Fractal Fract. 2022, 6, 170. https://doi.org/10.3390/fractalfract6030170

AMA Style

Akram G, Abbas M, Tariq H, Sadaf M, Abdeljawad T, Alqudah MA. Numerical Approximations for the Solutions of Fourth Order Time Fractional Evolution Problems Using a Novel Spline Technique. Fractal and Fractional. 2022; 6(3):170. https://doi.org/10.3390/fractalfract6030170

Chicago/Turabian Style

Akram, Ghazala, Muhammad Abbas, Hira Tariq, Maasoomah Sadaf, Thabet Abdeljawad, and Manar A. Alqudah. 2022. "Numerical Approximations for the Solutions of Fourth Order Time Fractional Evolution Problems Using a Novel Spline Technique" Fractal and Fractional 6, no. 3: 170. https://doi.org/10.3390/fractalfract6030170

APA Style

Akram, G., Abbas, M., Tariq, H., Sadaf, M., Abdeljawad, T., & Alqudah, M. A. (2022). Numerical Approximations for the Solutions of Fourth Order Time Fractional Evolution Problems Using a Novel Spline Technique. Fractal and Fractional, 6(3), 170. https://doi.org/10.3390/fractalfract6030170

Article Metrics

Back to TopTop