Space Discretization of Time-Fractional Telegraph Equation with Mamadu-Njoseh Basis Functions ()
1. Introduction
The popularity of fractional partial differential equations (FPDEs) gained momentum in science and engineering due to its involvement in many areas of applications ( [1]). Many researchers have developed numerical techniques for solving FPDEs. Some of the methods include finite difference method ( [2] [3] [4] [5]), spectral method ( [6] [7] [8] [9]), spline function method ( [10]), finite element method ( [11] [12] [13] [14] [15]) variational method ( [16]), etc. However, the development of these enormous numerical procedures for FPDEs still poses meaningful challenges such as the use of orthogonal polynomials as basis functions.
A time fractional telegraph equation (TFTE) has the form ( [17])
(1.1)
with the initial conditions
(1.2)
and boundary conditions
(1.3)
where
,
is the source term and
is Caputo fractional derivative of
.
The TFTE is a hyperbolic partial differential equation responsible for modeling many physical phenomena, such as wave propagation, signal processing, random walk theory and so on. Consequently, TFTE has been studied by many authors. Riemann-Liouville’s method was adopted by Cascaval et al. ( [18]) for analyzing the solution of TFTE. Orsingher and Beghin ( [19]) studied the TFTE governed by a Brownian time. The method of separable variable was used by Chen et al. ( [20]) for solving TFTE constrained to three nonhomogeneous boundary conditions. Momani ( [21]) solved the approximate and analytic solution of space and time fractional telegraph equations via Adomian decomposition method (ADM).
In this paper, we solve (1.1)-(1.3) with Mamadu-Njoseh orthogonal basis functions in a space discretization approach. Here, the process of discretization is quite different from the classical numerical method—finite difference method. In FEM, the given differential equation has to be reformulated as a variational problem leading to the solution via the following steps:
1) Finite dimensional space construction,
. This is the discretization process;
2) Seeking solution to the resultant discrete problem; and
3) Implementation through a computer programming.
This paper is organized as follows. Section 2 constitutes preliminaries. Finite element method for time fractional telegraph equation is given in Section 3. Error analysis is given in Section 4. Numerical illustrations, tables of results and graphical simulations are given in Section 5 and Section 6. Discussion of results and conclusions are presented in Sections 7 and Section 8, respectively.
2. Preliminaries
Let’s use the notation
and
,
where τ and Q are constants free of α and A, and are discretization parameters.
Let R and γ be two given Hilbert spaces,
is defined as
.
2.1. Weak Derivative
Suppose
represent a multi-index and
. For a well defined smooth function
, Dβ, being the differential operator is given by ( [22] [23])
.
Now, an integrable function V is said to possess a weak derivative U, if U satisfies
,
,
where,
denotes the space of infinity differentiable functions supported compactly in Ω. We assume Dβ to be weak derivative throughout this research.
2.2. Sobolev Spaces
Let
be a lebesque measurable function and
. The norm
be defined by ( [24])
where
denotes the set of all U such that
is finite. Given an integer
, we have the Sobolev space
given as
.
Also,
,
are the corresponding Sobolev and Semi norms of
respectively.
Now for
,
is defined by
,
called the fractional Sobolev Semi norm with
.
For
, we write
,
,
.
Thus, the Sobolev space becomes
,
and
,
is the full norm. For
, Sobolev space
is a Banach space ( [25]).
Similarly,
when
, the sobolev space
is a Hilbert space, that is,
.
In particular, to solve our model equation we define the Sobolev space as
.
To establish the equivalences of certain norms in the subspaces of
, we shall rely in the famous Poincaré inequalities.
Lemma 2.1. ( [26]): For
, then
Lemma 2.2. ( [26]): For
, then
Lemma 2.3( [26]): For
, then
which is generalized poincare inequality.
Thus,
over the space
is equivalent to
.
2.3. Caputo Fractional Derivatives
Let
,
, and
be the Reimann-Liouville (R-L) fractional derivatives of order β. The fractional derivatives of order
and
of order β on
, are as ( [27])
(2.1)
(2.2)
respectively, where
for
,
for
.
The above Equations (2.1) and (2.2) are called left- and right-sided Caputo fractional derivatives of order β.
Lemma 2.4 ( [27]):
Let
,
. Then the caputo fractional derivative of
is given as
, satisfying the following properties:
(a)
(b)
(c)
, (2.3)
where
and
.
2.4. Mamadu-Njoseh Polynomials
These are orthoponal polynomials generated with reference to the properties ( [28] [29] [30])
,
, (2.4)
,
, (2.5)
subject to the initial conditions
and
, (2.6)
where
denotes a unit step increment,
is weight function.
Lemma 2.5: For any
value of j,
a partition
with a unit step size.
Theorem 2.1. For m = j, there exists n system of linear algebraic Equations generated from using (2.4)-(2.6) at the
, respectively.
Proof:Let
be given by lemma (2.5), we have
. Thus, for
, the grid points of the partition by refinement would
. Hence, we have
at
.
The first Mamadu-Njoseh polynomials are general via MAPLE 18 via theorem 2.1, and are presented in Figure 1 and Table 1, respectively.
![]()
Figure 1. Graphical view Mamadu-Njoseh Polynomials
.
![]()
Table 1. First seven Mamadu-Njoseh Polynomials.
3. Finite Element Method for Time Fractional Telegraph Equation
We consider the space discretization time functional telegraph Equations (1.1)-(1.3) with Mamadu-Njoseh basis function using the finite element method.
Let a piecewise finite element space that is linear and continuous be given as
. Let [0, 1] be partitioned as
,
called the space partitioning of
.
Let
.
The variational formulation for the time – fractional telegraph Equation (1.1) is to compute
such that
(3.1)
The essence of FEM is to compute
, such that
(3.2)
Let
satisfies
,
. (3.3)
Suppose
defined a
operator given by
,
,
.
Thus, Equation (3.2) can be written in the abstract sense as
,
, (3.4)
where
,
, (3.5)
called the Riemann-Liouville fractional derivative, and Γ is the Gamma function.
Using quadrative formula (( [31])] on (3.4), we obtain
, (3.6)
where
, (3.6a)
and
satisfies
,
.
Now, let
, be an approximation of
, where
,
, are Mamadu-Njoseh Basis function of
.
Also, let
defines the time discretization such that
(3.7)
Now, we consider the following steps for
.
Step 1: Suppose
, then
.
Step 2: Set
, we get,
(3.8)
Since
, we have that,
(3.9)
Let
,
, we have,
(3.10)
Thus,
(3.11)
where,
,
,
,
,
.
Step 3: To compute
we repeat the above steps as 1 and 2. Thus, with the above idea, the finite element method can be formulated and solve the resulting system via MAPLE 18 Software.
4. Error Analysis
We consider the lemma below
Lemma 4.1: Let
be the approximate solution of
(4.1)
Then we have
.
Theorem 4.1: Let
and
be the solutions (3.4) and (4.1), then we have
,
where h is the space step size. Let
defines an elliptic or Ritz propectim given by
,
.
Let
,
where,
,
.
Now, the error equation obtained from (4.1),
where,
,
where,
,
.
Thus, we have,
.
By Lemma 4.1, we have
.
Here
,
and
,
where
is Sobolev norm.
Let denote
, then,
,
obtained via Hamamard d integral formulation ( [32]), and
.
Let
into
, to obtain,
.
Thus,
,
.
Thus, we have that,
Hence,
.
Therefore,
.
Obtained via elliptic projection of error estimation. Thus, we finally obtain
.
5. Numerical Illustration
In this section, we carry out numerical simulations to verify the accuracy of the proposed method.
Let in (1.1) be given
(5.1)
with initial conditions
(5.2)
and boundary conditions
(5.3)
The exact solution is given as
.
Using (3.11) on (5.1) at
with
,
, estimated using (3.6a),
and
at
, results are presented below with the aid of MAPLE 18.
6. Numerical Illustrations
The proposed method has been successively implemented for the time fractional telegraph equation. Maximum errors in
and
were obtained as shown in Table 2. The
and
errors and the numerical order are in agreement in space for
and 1.8. It can be seen that the order of convergence of the proposed method is in total agreement with the theoretical analysis as shown in Figure 2 and Figure 3, respectively.
![]()
Figure 2. Comparison of computed solutions and Exact solutions at
at
.
![]()
Figure 3. Comparison of computed solutions and exact solutions at
at
.
7. Conclusion
The space discretization scheme was developed and implemented with the aid of Mamadu-Njoseh orthogonal basis functions. Satisfactory numerical evidence was obtained as the order of convergence of the proposed method is in total agreement with the theoretical analysis. Also, The
and
errors and the numerical order are in agreement in space for
and 1.8.