Abstract
Purpose
This study aims to use new formula derived based on the shifted Jacobi functions have been defined and some theorems of the left- and right-sided fractional derivative for them have been presented.
Design/methodology/approach
In this article, the authors apply the method of lines (MOL) together with the pseudospectral method for solving space-time partial differential equations with space left- and right-sided fractional derivative (SFPDEs). Then, using the collocation nodes to reduce the SFPDEs to the system of ordinary differential equations, which can be solved by the ode45 MATLAB toolbox.
Findings
Applying the MOL method together with the pseudospectral discretization method converts the space-dependent on fractional partial differential equations to the system of ordinary differential equations.
Originality/value
This paper contributes to gain choosing the shifted Jacobi functions basis with special parameters a, b and give the authors this opportunity to obtain the left- and right-sided fractional differentiation matrices for this basis exactly. The results of the examples are presented in this article. The authors found that the method is efficient and provides accurate results, and the authors found significant implications for success in the science, technology, engineering and mathematics domain.
Keywords
Citation
Ali, M., Almoaeet, M. and Albuohimad, B.K. (2022), "Numerical simulation method of lines together with a pseudospectral method for solving space-time partial differential equations with space left- and right-sided fractional derivative", Arab Journal of Mathematical Sciences, Vol. 28 No. 2, pp. 168-183. https://doi.org/10.1108/AJMS-02-2021-0052
Publisher
:Emerald Publishing Limited
Copyright © 2021, Mushtaq Ali, Mohammed Almoaeet and Basim Karim Albuohimad
License
Published in Arab Journal of Mathematical Sciences. Published by Emerald Publishing Limited. This article is published under the Creative Commons Attribution (CC BY 4.0) licence. Anyone may reproduce, distribute, translate and create derivative works of this article (for both commercial and non-commercial purposes), subject to full attribution to the original publication and authors. The full terms of this licence may be seen at http://creativecommons.org/licences/by/4.0/legalcode
1. Introduction
The recent development in the last few decades has shown that most of the complex system in engineering and other several phenomena can be accurately modeled using partial differential equations with fractional order. This contributed to a great development in several areas such as biotechnology, chemistry, signal and image processing, finance and many others [1–5]. The main aim of this paper is to introduce an efficient numerical method to approximate the fractional partial differential equation (FPDE) of the form
Many approximation methods in the numerical analysis have been a survey to solve space-dependent on fractional partial differential equations (SFPDEs), and the target of the main subject of these methods in terms of convergence to real solutions, the stability of methods, and order of accuracy and value of error.
One of the best types of methods for solving SFPDEs numerically is by discretization of the space variable without the time variable. These kinds of method are referred to as method of lines (MOL). In this method, the spatial dimensions of the space variable can be discretized by using diverse techniques such as mesh methods, or meshless methods [6–12]. In general, these methods convert the SFPDEs to a system of ordinary differential equations, or differential-algebraic equations based on the type of boundary conditions [13]. There are many types of partial differential problems that have been solved by the MOL, we refer to [7, 10, 14–19], and therein. Also, many different methods have been discussed for SFPDEs, we refer to [20–24], and therein.
Our target of this work is to use the advantage of the pseudospectral method based on the shifted Jacobi functions together with MOL and employed the collocation method to approximate the solution to the SFPDE (1)–(3).
The structure of this paper was arranged in the following way: In Section 2, preliminaries, the definitions of fractional derivatives and some notations of Jacobi–Gauss (JG) nodes. In Section 3, the new numerical technique for solving SFPDE (1)–(3) is presented. In Section 4, the illustrative examples were included to demonstrate the validity and applicability of the proposed method. In Section 5, a brief conclusion and some remarks.
2. Preliminaries and definitions
We introduce several important basic definitions and properties of fractional Riemann–Liouville integrals and derivatives and JG nodes.
(Left and right Riemann–Liouville fractional integral).
Let α is real number where 0 ≤ α ≤ 1 and g: I → R is a continuous function and where the bounded interval I = [a, b], then the left and right Riemann–Liouville fractional integrals of order α are defined as:
(Left and right Riemann-Liouville fractional derivative).
If n − 1 ≤ α < n such that n is a positive integer number and the continuous function g: I → R then the left and right Riemann-Liouville fractional derivatives of order α are defined by:
We can verify that the following properties hold true.
The fractional Riesz operator of the order α is defined as [29]:
2.1 Jacobi–Gauss nodes
The Jacobi polynomials
The JG quadrature formula
According to the definition of Jacobi polynomials, various types of functions with fractional order have been constructed based on them. For more information see [26].
We insert some properties of the classical Jacobi polynomials in the following:
Let α, a, b are real numbers with conditions − 1 < b − α < b and − 1 > a, b > 0. Then for all x belong to the interval [0, 1] we have:
It is clear from combined properties and theorems that have been inserted as it hold the proof of theorem in References [30–32]. And there are many applications of the above theorem that can be found in References [33–40].
3. Th presented pseudospectral discretization method
The important step of our method includes to discretize the space variable of the unknown function u(x, t) that appears in SFPDE (1)–(3). To get started, we use the pseudospectral method based on the shifted Jacobi function of the parameters a = 1, b = 1, together with the collocation JG nodes. Let the domain space of the function u(x, t) belongs to the interval [0, 1], then the JG nodes will be correspondent to the interval [0, 1] as:
Let us begin to approximate the unknown function u(x, t) by
such that ℓj(t), j = 1, 2, 3, …, n, are the Lagrange basis polynomials based on the JG nodes
From the Kronecker properties in the JG nodes, the ℓj(x) and ϕj(t) are satisfied as follows:
Let us denote the shifted Jacobi polynomials
Now, by multiplying both sides of Eqn (15) by
By using the JG quadrature rule (6), and then using the Kronecker property (14), we get
By using above Eqn (17), then we can define ϕj(t) as:
Now dependent on the fact of Eqns (19), (18), (15) and (11) the approximation of the function u(x, t) is complete. Also we can write
Similarly, we approximate the initial and boundary conditions as follows:
By substituting the approximations functions (20), (21) and (22) into the problems (1)–(3), we get:
Let
In general, Eqn (24) can be rewritten in the following matrix form:
Collocating the initial condition (21) at
3.1 On the derivation of the left and right fractional differentiation matrices
The coefficients
The left fractional differentiation matrix
and
Proof: Depending on the fact we get in Eqn (19), we have
By substituting the above equation in (27), with using the nodes
The right fractional differentiation matrix
Proof: Depending on the fact we get it in Eqn (19), and by using property (8) for the special parameter a = 2 and b = 1, we obtain:
Now, combining Theorem 1 with the above equation, we obtain:
By substituting the nodes
The inverse of matrix P in the explicit form can be found by using the next theorem.
The element of the matrix P can be written in the explicit form as follows:
Proof: Start the proof by noting the fact that:
On the other hand, we can approximate the above integral by using the JG quadrature rule with respect to the weight function t(1 − t) on [0, 1] as follows:
j, k = 0, 1, …, n to reach the mass matrix P, we can rewrite the above equation as:
j, k = 0, 1, …, n. Comparing the left sides of (3.3) and (32), yields:
Thus by rewriting the above equation in the matrix form, we have:
The above theorem shows that the matrix P is nonsingular, and we can rewrite the implicit initial value problem (26) to the following explicit initial value problem:
It should be noted that the IVP (35) can be solved by various well-known software. We solve this IVP by the ode45 MATLAB toolbox. In the next section, we provide some numerical examples to check the efficiency of the proposed method.
4. Numerical results and comparisons
Our goal to solve problems (1)–(3) and find the unknown function u(x, t), by approximate the space variables via pseudospectral method based on JG nodes, and then solving the new IVP by the ode45 MATLAB toolbox. We will begin in the first step by transforming interval (0, ℓ) to interval [0, 1], where the function u(x, t) defined on the interval x ∈ (0, ℓ), t ∈ (0, T), and the collocation points {τi, i = 0, 1, 2, …, m} belong to the interval [−1, 1], then
In order to confirm the utility of the presented method, we apply the method to solve some IVPs. The proposed method has been implemented with MathWorks MATLAB 2017a in a personal computer 3.5 GHz Core i7 PC with 8 GB of RAM.
The following two-sided FPDE has been solved in Reference [41]:
has the exact solution u(x, t) = 4e−tx2(2 − x)2, where the coefficient functions,
By applying the presented method with n = 40, the obtained function
Consider the following Riesz space fractional diffusion equation [23]:
By applying the presented method with n = 20 and α = 0.2, the obtained function
From Table 1, it can be seen that norms of errors for various values of n and α appear that the small numbers of n, with that an accurate solution.
with initial and boundary conditions:
Figure 3 shows the approximation function of
with initial and boundary conditions:
The exact solution is of the form u(x, t) = x2(L − x)2e−t The problem (42) has been solved in [43] by proposed a class of difference scheme based on the parameter spline function and improved matrix transform method. Also, the authors in [42] have solved this problem (42) by proposing a space-time spectral algorithm based on the shifted Jacobi tau technique. To demonstrate the accuracy of our proposed method, in Table 3, compare the absolute errors |u(xi, 0.1) − u(xi, 0.1)|, i = 1, …, 9 with the numerical method proposed in [42, 43] and our results for various choices of α.
5. Conclusion
In the present paper, we developed an efficient and accurate method for solving SFPDE. Applying the MOL together with the pseudospectral discretization method converts the SFPDE to the system of ordinary differential equations. Choosing the shifted Jacobi functions as a test basis with special parameters a, b gives us this opportunity to obtain the left- and right-sided fractional differentiation matrices for this basis exactly.
Four examples have been solved, and the results are reported. These results show that our method is efficient and provides accurate results, whereas a small number of JG nodes are used based on the collocation method. Obtaining some theoretical estimates for the approximation errors would be desirable.
Figures
Figure 1
The approximation function
Figure 2
The approximation function
Figure 3
The approximation function
Example 2: Norms of errors En,100(u) for various values of n and α
Α | ||||
---|---|---|---|---|
α = 1.2 | 3.4816e − 15 | 4.1010e − 15 | 5.7264e − 15 | 9.4558e − 15 |
α = 1.5 | 3.4191e − 15 | 4.1058e − 15 | 6.4447e − 15 | 9.5015e − 15 |
α = 1.8 | 2.4772e − 15 | 4.3510e − 15 | 7.4810e − 15 | 1.1811e − 14 |
Example 3: The values of
Values of n | n = 11 | n = 16 | n = 21 | n = 26 | n = 31 |
---|---|---|---|---|---|
0.099371 | 0.099576 | 0.099791 | 0.099962 | 0.100035 | |
−0.124557 | −0.124638 | −0.124584 | −0.124602 | −0.124594 | |
0.124557 | 0.124638 | 0.124584 | 0.124602 | 0.124594 | |
−0.099371 | −0.099576 | −0.099791 | −0.099962 | −0.100035 |
Example 4: Comparison of absolute errors of our scheme with scheme in [42, 43]
Method of [42] | Method of [43] | The presented method | |||||||
---|---|---|---|---|---|---|---|---|---|
x | α = 1.2 | α = 1.5 | α = 1.8 | α = 1.2 | α = 1.5 | α = 1.8 | α = 1.2 | α = 1.5 | α = 1.8 |
0.2 | 1.54 e-12 | 3.78 e-11 | 4.34 e-11 | 1.61 e-3 | 1.42 e-3 | 7.24 e-4 | 0.1055e-12 | 0.9843e-12 | 1.9413e-12 |
0.4 | 1.44 e-10 | 8.64 e-11 | 1.37 e-10 | 1.42 e-3 | 1.02 e-3 | 5.74 e-4 | 1.47905e-12 | 3.9820e-12 | 2.3070e-12 |
0.6 | 1.63 e-10 | 1.54 e-10 | 1.48 e-10 | 8.75 e-4 | 7.49 e-4 | 4.12 e-4 | 3.3255e-12 | 5.0410e-12 | 9.1279e-13 |
0.8 | 1.30 e-10 | 2.10 e-10 | 1.55 e-10 | 7.50 e-4 | 6.16 e-4 | 3.22 e-4 | 1.1055e-12 | 3.0410e-12 | 2.3986e-12 |
1.0 | 1.89 e-10 | 2.21 e-10 | 2.19 e-10 | 7.13 e-4 | 5.76 e-4 | 2.95 e-4 | 2.1152e-12 | 1.0010e-12 | 8.3765e-12 |
1.2 | 2.48 e-10 | 1.94 e-10 | 2.53 e-10 | 7.50 e-4 | 6.16 e-4 | 3.22 e-4 | 7.0055e-12 | 1.0410e-13 | 5.1819e-12 |
1.4 | 1.73 e-10 | 1.51 e-10 | 1.74 e-10 | 8.75 e-4 | 7.49 e-4 | 4.12 e-4 | 1.3498e-12 | 1.2430e-12 | 2.2781e-12 |
1.6 | 5.11 e-11 | 9.89 e-11 | 6.21 e-11 | 1.42 e-3 | 1.02 e-3 | 5.74 e-4 | 6.245e-12 | 3.0410e-12 | 5.2410e-12 |
1.8 | 3.43 e-11 | 3.72 e-11 | 3.08 e-11 | 1.61 e-3 | 1.42 e-3 | 7.24 e-4 | 1.1055e-13 | 3.0410e-12 | 1.3452e-12 |
References
1.Debnath L. Recent applications of fractional calculus to science and engineering. Int J Math Math Sci. 2003; 2003(54): 3413-42.
2.Gorenflo R, Mainardi F. Fractional oscillations and Mittag-Leffler functions: Citeseer; 1996.
3.Hilfer R. Applications of fractional calculus in physics. In: Hilfer R, editer. Applications of fractional calculus in physics: Published by World Scientific Publishing; 2000. ISBN 9789812817747.
4.Adam M. Advances in fractional calculus: theoretical developments and applications in physics and engineering; 2008.
5.George MZ. Hamiltonian chaos and fractional dynamics: Oxford University Press on Demand; 2005.
6.Bratsos AG. The solution of the two-dimensional sine-Gordon equation using the method of lines. J Comput Appl Math. 2007; 206(1): 251-77.
7.Dehghan M, Shakeri F. Method of lines solutions of the parabolic inverse problem with an overspecification at a point. Numer Algorithm. 2009; 50(4): 417-37.
8.Haq S. et al. Meshless method of lines for the numerical solution of generalized Kuramoto-Sivashinsky equation. Appl Math Comput. 2010; 217(6): 2404-13.
9.Northrop PWC, et al. A robust false transient method of lines for elliptic partial differential equations. Chem Eng Sci. 2013; 90: 32-39.
10.Shakeri F, Dehghan M. The method of lines for solution of the one-dimensional wave equation subject to an integral conservation condition. Comput Math Appl. 2008; 56(9): 2175-88.
11.Quan S. A meshless method of lines for the numerical solution of KdV equation using radial basis functions. Eng Anal Bound Elem. 2009; 33(10): 1171-80.
12.Voss DA, Abdul-Qayyum MK. Time-stepping algorithms for semidiscretized linear parabolic PDEs based on rational approximants with distinct real poles. Adv Comput Math. 1996; 6(1): 353-63.
13.Hamdi S, Schiesser WE, Griffiths GW. Method of lines. Scholarpedia. 2007; 2(7): 2859.
14.James MH. Method of lines approach to the numerical solution of conservation laws. Technical Report, NM: Los Alamos Scientific Lab: 1979.
15.Saucez P, et al. Method of lines study of nonlinear dispersive waves. J Comput Appl Math. 2004; 168(1-2): 413-23.
16.Hamdi S, et al. Method of lines solutions of the extended Boussinesq equations. J Comput Appl Math. 2005; 183(2): 327-42.
17.White RE, Subramanian VR. Method of lines for parabolic partial differential equations. Computational methods in chemical engineering with maple: Springer; 2010, 353-505.
18.Schiesser WE. Method of lines PDE analysis in biomedical science and engineering: John Wiley and Sons; 2016.
19.Causley MF, et al. Method of lines transpose: high order L-stable \mathcalO(N) schemes for parabolic equations using successive convolution. SIAM J Numer Anal. 2016; 54(3): 1635-52.
20.Yang Q, et al. A finite volume scheme with preconditioned Lanczos method for two-dimensional space-fractional reaction–diffusion equations. Appl Math Model. 2014; 38(15-6): 3755-62.
21.Liu Y et al. Time two-mesh algorithm combined with finite element method for time fractional water wave model. In: Int J Heat Mass Tran. 2018; 120: 1132-45.
22.Bu W, Tang Y, Yang J. Galerkin finite element method for two-dimensional Riesz space fractional diffusion equations. J Comput Phys. 2014; 276: 26-38.
23.Feng LB, et al. Stability and convergence of a new finite volume method for a two-sided space-fractional diffusion equation. Appl Math Comput. 2015; 257: 52-65.
24.Liu F, Anh V, Turner I. Numerical solution of the space fractional Fokker–Planck equation. J Comput Appl Math. 2004; 166(1): 209-19.
25.Meerschaert MM, Tadjeran C. Finite difference approximations for fractional advection–dispersion flow equations. J Comput Appl Math. 2004; 172(1): 65-77.
26.Shen J, Tang T, Wang LL. Spectral methods: algorithms, analysis and applications: Springer Science & Business Media; 2011, 41.
27.Schiesser WE, Griffiths GW. A compendium of partial differential equation models: method of lines analysis with Matlab: Cambridge University Press; 2009.
28.Esmaeili S, Shamsi M, Luchko Y. Numerical solution of fractional differential equations with a collocation method based on Müntz polynomials. Comput Math Appl. 2011; 62(3): 918-29.
29.Yang Q, Liu F, Turner I. Numerical methods for fractional partial differential equations with Riesz space fractional derivatives. Appl Math Model. 2010; 34(1): pp. 200-18.
30.Esmaeili S, Shamsi M. A pseudo-spectral scheme for the approximate solution of a family of fractional differential equations. Commun Nonlinear Sci Numer Simulat. 2011; 16(9): 3646-54.
31.Zayernouri M, George EK. Fractional sturm–liouville eigen-problems: theory and numerical approximation. J Comput Phys. 2013; 252: 495-517.
32.Chen S, Shen J, Wang LL. Generalized Jacobi functions and their applications to fractional differential equations. Math Comput. 2016; 85(300): 1603-38.
33.Zayernouri M, Ainsworth M, George EK. A unified Petrov–Galerkin spectral method for fractional PDEs. Comput Methods Appl Mech Eng. 2015; 283: 1545-69.
34.Zayernouri M, Ainsworth M, George EK. Tempered fractional sturm–liouville EigenProblems. SIAM J Sci Comput. 2015; 37(4): A1777–1800.
35.Zayernouri M, George EK. Discontinuous spectral element methods for time-and space-fractional advection equations. SIAM J Sci Comput. 2014; 36(4): B684-707.
36.Zayernouri M, George EK. Exponentially accurate spectral and spectral element methods for fractional ODEs. J Comput Phys. 2014; 257: 460-80.
37.Zayernouri M, George EK. Fractional spectral collocation method. SIAM J Sci Comput. 2014; 36(1): A40-62.
38.Zayernouri M, George EK. Fractional spectral collocation methods for linear and nonlinear variable order FPDEs. J Comput Phys. 2015; 293: 312-38.
39.Zayernouri M, et al. Spectral and discontinuous spectral element methods for fractional delay equations. SIAM J Sc. Comput. 2014; 36(6): B904-29.
40.Zhang Z, Zeng F, George EK. Optimal error estimates of spectral Petrov–Galerkin and collocation methods for initial value problems of fractional differential equations. SIAM J Numer Anal. 2015; 53(4): 2074-96.
41.Meerschaert MM, Tadjeran C. Finite difference approximations for two-sided space-fractional partial differential equations. Appl Numer Math. 2006; 56(1): 80-90.
42.Bhrawy AH, Zaky MA. A method based on the Jacobi tau approximation for solving multi-term time-space fractional partial differential equations. J Comput Phys. 2015; 281: 876-95.
43.Zhang Y, Ding H. Improved matrix transform method for the Riesz space fractional reaction dispersion equation. J Comput Appl Math. 2014; 260: 266-80.