Abstract
This paper presents a novel approach to numerical solution of a class of fourth-order time fractional partial differential equations (PDEs). The finite difference formulation has been used for temporal discretization, whereas the space discretization is achieved by means of non-polynomial quintic spline method. The proposed algorithm is proved to be stable and convergent. In order to corroborate this work, some test problems have been considered, and the computational outcomes are compared with those found in the exiting literature. It is revealed that the presented scheme is more accurate as compared to current variants on the topic.
Similar content being viewed by others
1 Introduction
In the modern era, fractional order differential equations have gained a significant amount of research work due to their wide range of applications in various branches of science and engineering such as physics, electrical networks, fluid mechanics, control theory, theory of viscoelasticity, neurology, and theory of electromagnetic acoustics [1, 2]. Wang [3] introduced the very first approximate solution of nonlinear fractional Korteweg–de Vries (KdV) Burger equation involving space and time fractional derivatives using Adomian decomposition method. Zurigat et al. [4] examined the approximate solution of fractional order algebraic differential equations using homotopy analysis method. Turut and Guzel [5] implemented Adomian decomposition method and multivariate Pade approximation method for solving fractional order nonlinear partial differential equations (PDEs). In [6], Liu and Hou applied the generalized differential transform method to solve the coupled Burger equation with space and time fractional derivatives. Khan et al. [7] used Adomian decomposition method and variational iteration method for numerical solution of fourth-order time fractional PDEs with variable coefficients.
Later on, Abbas et al. [8] employed a finite difference approach based on third degree trigonometric B-spline functions for approximate solution of one-dimensional wave equation. Javidi and Ahmad [9] developed a computational technique based on homotopy perturbation method Laplace transform and Stehfest’s numerical inversion algorithm for solving fourth-order time fractional PDEs with variable coefficients. The fractional differential transform method and modified fractional differential transform method were proposed by Kanth and Aruna [10] for series solution to higher dimensional third-order dispersive fractional PDEs. Pandey and Mishra [11] applied Sumudu transforms and homotopy analysis approach for solving time fractional third-order dispersive type of PDEs. The fractional variational iteration method was put into action by Prakash and Kumar in [12] for series solution to third-order fractional dispersive PDEs in a higher dimensional space.
The spline approximation techniques have been applied extensively for numerical solution of ODEs and PDEs. The spline functions have a variety of significant gains over finite difference schemes. These functions provide a continuous differentiable estimation to solution over the whole spatial domain with great accuracy. The straightforward employment of spline functions provides a solid ground for applying them in the context of numerical approximations for initial/boundary problems. Bashan et al. [13] used a new differential quadrature method based on quintic B-spline functions for numerical solution of Korteweg–de Vries–Burgers (KdVB) equation. Khan and Aziz [14] solved third-order boundary value problems (BVPs) using a numerical method based on quintic spline functions. In [15], a non-polynomial quintic spline method was employed for numerical solution of fourth-order two-point BVPs. Khan and Sultana [16] proposed non-polynomial quintic spline functions for numerical solution of third-order BVPs associated with odd-order obstacle problems. Karakoc et al. [17] employed quintic B-spline collocation technique to obtain numerical solution of modified regularized long wave (MRLW) equation. In [18], Srivastava discussed numerical solution of differential equations using polynomial spline functions of different orders. Siddiqi and Arshed [19] brought the fifth degree basis spline collocation functions into use for approximate solution of fourth-order time fractional PDEs.
Rashidinia and Mohsenyzadeh [20] used non-polynomial quintic spline technique for one-dimensional heat and wave equations. Recently, in [21], fifth degree spline approximation technique has been utilized for approximate solution of fourth-order time fractional PDEs. In [22], the new fractional order spline functions were considered to obtain the approximate solution for fractional Bagely–Torvik equation. Arshed [23] employed quintic B-spline collocation scheme for solving fourth-order time fractional super diffusion equation. More recently, parametric quintic spline approach and Grunwald–Letnikov approximation have been proposed in [24] for a fractional sub-diffusion problem.
In the field of modern science and engineering the fourth-order initial/boundary value problems are of great importance. For example, airplane wings, bridge slabs, floor systems, and window glasses are being modeled as plates subject to different types of end supports which are successfully described in terms of fourth-order PDEs [21]. In this work, we consider the following class of fourth-order time fractional PDEs:
with the following initial and boundary conditions:
where \(\gamma \in (0,1)\) is the order of fractional time derivative, α represents the ratio of flexural-rigidity of beam to its mass per unit length, \(y(x,t)\) is the beam transverse displacement, \(u(x,t)\) describes the dynamic driving force per unit mass, and the function \(v_{0}(x)\) is known to be continuous on \([0,L]\). There are many descriptions to the concept of fractional differentiation, but Caputo and Riemann–Liouville have been the most common definitions. Here, we shall use the Caputo approach because it is more appropriate for real world problems and it permits initial and boundary conditions in terms of ordinary derivatives. The Caputo definition of fractional derivative of order γ is given by
This paper has been composed with the aim to develop a spline collocation method for approximate solution of fourth-order time fractional PDEs. The backward Euler scheme has been utilized for temporal discretization, whereas non-polynomial quintic spline function, comprised of a trigonometric part and a polynomial part, has been used to interpolate the unknown function in spatial direction. The presented technique has also been proved to be stable and convergent.
This work is arranged as follows. In Sect. 2, a brief explanation of quintic spline scheme is presented and the consistency relations between the values of spline approximation and its derivatives at the nodal points are derived. Section 3 describes the use of L1 approximation in time direction to achieve a backward Euler technique. Non-polynomial quintic spline scheme for the spatial discretization is discussed in Sect. 4. The computational results and discussions are given in Sect. 5.
2 Description of non-polynomial quintic spline function
Consider \(x_{i}=ih\) to be the mesh points of uniform partition of \([0,L]\) into sub-intervals \([x_{i},x_{i-1}]\), where \(h=\frac{L}{n}\) and \(i=0,1,2,\ldots ,n\). Let \(y(x)\) be a sufficiently smooth function defined on \([0,L]\). We denote the non-polynomial quintic spline approximation to \(y(x)\) by \(S(x)\). Each non-polynomial spline segment \(R_{i}(x)\) has the following form:
where \(a_{i}\), \(b_{i}\), \(c_{i}\), \(d_{i}\), \(e_{i}\), and \(f_{i}\) are the constants, and the parameter ξ, the frequency of the trigonometric functions, will be used to enhance the accuracy of the technique. When ξ approaches zero, Eq. (2) reduces to a quintic polynomial spline function in \([a,b]\). The non-polynomial quintic spline can be defined as
First of all, we establish the consistency relations for all the coefficients involved in (2) in terms of \(S_{i}\)s, \(M_{i}\)s, and \(F_{i}\)s, where
The values of coefficients introduced in (2) can be calculated as
where \(\theta =\xi h\) and \(i=0,1,\ldots ,n-1\).
Now, using the first and third derivative continuity conditions at the knots, i.e., \(R^{(\tau )}_{i-1}(x_{i})= R^{(\tau )}_{i}(x_{i})\) for \(\tau =1,3\), we can derive the following important relations:
and
Using (6)–(7), we get the following consistency relation involving \(F_{i}\) and \(S_{i}\) for \(i=2,3,\ldots ,n-2\):
where
Relation (8) provides \((n-3)\) linear equations with \((n-1)\) unknowns \(S_{i}\), \(i=1(1)n-1\). Hence, we require two more equations for direct calculation of \(S_{i}\), one at each end of the range of integration, which can be formulated as follows:
Setting \(i=1,2\) in (5) we have
and
Similarly, for \(i=1,2\), expression (6) returns the following two equations:
and
where
Similarly, subtracting (12) from (10), we get
Now, the first end condition is obtained by substituting (13), (14) into (9) for \(i=1\).
Similarly, the second end condition for \(i=n\) is given by
where
Lemma 2.1
The local truncation error \(t_{i}, i=1(1)n-1\) associated with Eqs. (8), (15), and (16) is given by
Proof
We have to find local truncation error \(t_{i}\), \(i=1,2,\ldots,n-1 \), for the present scheme. First of all, we write Eqs. (8), (15), and (16) as follows:
The expressions for \(t_{i}\), \(i=1,2,\ldots,n-1 \), can be obtained by expanding the terms \(y_{0}\), \(y_{1}\), \(y_{1}^{(4)}\), \(y_{2}\), \(y_{2}^{(4)}\), \(y _{3}\), \(y_{3}^{(4)}\), etc. about the points \(x_{i}\), \(i=1,2,\ldots,n-1\), using Taylor’s series respectively. □
Equating the coefficients of \(y_{i}^{(\tau )}\) for \(\tau =4,5,6,7\), we get
The local truncation error given in Eq. (17) takes the following form:
3 Temporal discretization
In order to discretize the time fractional derivative, the backward Euler scheme is employed. We consider \(t_{p}=p\Delta t\) for \(p=0(1)K\) with \(\Delta t=\frac{T}{K}\) as the step size in time direction. The computation of Caputo time fractional derivative at \(t=t_{p+1}\) can be made as
where \(b_{j}=(j+1)^{1-\gamma }-j^{1-\gamma }\) and \(\upsilon =(t_{p+1}-w)\). The above equation along with the definition of Caputo fractional derivative gives the following relation:
Now, we define a semi-discrete fractional differential operator \(G_{t}^{\gamma }\) as
Then Eq. (19) can be written as
Here, \(l_{\Delta t}^{p+1}\) denotes the truncation error between \(\frac{\partial ^{\gamma }}{\partial t^{\gamma }}y(x,t_{p+1})\) and \(G_{t}^{\gamma }y(x,t_{p+1})\). Let \(G_{t}^{\gamma }y(x, t_{p+1})\) be the approximation of Caputo time fractional derivative at \(t=t_{p+1}\), then Eq. (1) can be expressed as
Using (19), the above equation can be written as
where \(\beta =\varGamma (2-\gamma )\Delta t^{\gamma }\) and \(y^{p+1}(x)=y(x,t ^{p+1})\) with the initial and boundary conditions as follows:
Moreover, the coefficients \(b_{j}\) involved in (19) have the following properties:
-
\(b_{j}'s\) are non-negative for \(j=0,1,\ldots ,p \);
-
\(1=b_{0}>b_{1}>b_{2}>b_{3}>\cdots >b_{p}\), \(b_{p}\rightarrow 0\) as \(p \rightarrow \infty \);
-
\(\sum_{j=0}^{p}(b_{j}-b_{j+1})+ b_{p+1}=(b_{0}-b_{1})+ \sum_{j=1}^{p-1}(b_{j}-b_{j+1})+b_{p}=1 \).
The truncation error in (20) is bounded, i.e.,
where the constant c is dependent on y. To apply this scheme, we need the values \(y^{0}\) and \(y^{1}\).
For \(p=0\), (22) takes the following form:
For \(p=1\), (22) becomes
Now (22) and (24) with initial and boundary conditions formulate a complete set of semi-discrete problem for (1).
The error term \(l^{p+1}\) can also be defined as [25]
From Eqs. (20) and (23), the error term can be expressed as
Now, we define some functional spaces and their standard norms as
where \(L^{2}(\eta )\) denotes the space of all measurable functions whose square is Lebesgue integrable in η. The inner product and norm in \(L^{2}(\eta )\) are given by
The inner product and norm in \(S^{2}(\eta )\) are given by
Also, the norm \(\|\cdot\|\) in \(H^{n}(\eta )\) is defined in the following way:
It is also preferred to define \(\|\cdot\|_{2}\)
Now, for the stability and convergence analysis, we are to find \(y^{p+1}\in H_{0}^{2}(\eta )\) such that, for all \(g\in H_{0}^{2}( \eta )\), Eqs. (22) and (24) give the following two relations:
and
The theorem given below describes the unconditional stability of the semi-discrete problem.
Theorem 1
The discrete problem is unconditionally stable in such a way that \(\forall \Delta t >0\), it holds
where \(\|\cdot\|_{2}\) is discussed in Eq. (27).
Proof
In order to prove this result, mathematical induction is used. For \(p=0\) and \(g=y^{1} \), Eq. (29) takes the following form:
Integrating by parts, the above result can be written as
Due to the boundary conditions on g, all the boundary related contributions disappear. From the Schwarz inequality and the inequality \(\|g\|_{0} \leq \|g\|_{2}\), Eq. (31) becomes
Suppose that the result is true for \(g=y^{j}\), i.e.,
Let \(g=y^{p+1}\) in Eq. (28)
Integrating by parts, we get
Again, due to the boundary conditions on g, all the boundary related contributions disappear. From the Schwarz inequality and the inequality \(\|g\|_{0}\leq \|g\|_{2}\), the above expression changes to
Using (32), the above relation takes the following form:
Using the properties of \(b_{j}\), we can write
□
Lemma 3.1
Let \(\{y^{p}\}_{p=0}^{K}\) be the time discrete solution to Eqs. (28)–(29) and y be the exact solution of (1), then
Proof
Consider \(e^{p}=y(x,t_{p})-y^{p}(x) \) for \(p=1\), the error equation takes the following form by combining Eqs. (1), (29), and (27):
Let \(g=e^{1}\) and \(e^{0}=0\) give the following relation:
Equation (26) along with (36) gives
For \(p=1\), Eq. (35) is satisfied.
Next, suppose that (35) is true for \(p=1,2,3,\ldots ,r\), i.e.,
Using (1), (27), (28) and for \(p=r+1\), the error equation is obtained as follows:
Now, using the induction assumption and taking \(g=e^{p+1}\) along with the relation \(\frac{b_{j}^{-1}}{b_{j+1}}<1\) for all positive integer j, Eq. (39) can be written as
Hence, proved. □
Also, from the definition of \(b_{p}\), the following useful equation can be formulated:
The function \(\psi (z)\) is defined as \(\psi (z)=\frac{z^{-\gamma }}{z ^{1-\gamma }-(z-1)^{1-\gamma }}\), as \(\psi (z)\geq 0\) \(\forall z>1\), the function \(\psi (z)\) is increasing on z. This indicates that as \(1< p\rightarrow \infty \), \(\frac{b_{p-1}^{-1}}{p^{\gamma }}\) increasingly approaches to \(\frac{1}{1-\gamma }\).
Since, for \(p=1\), \(p^{-\gamma }b_{p-1}^{-1}=1\). Therefore, it can be written in the following form:
Therefore, ∀p such that \(p\Delta t \leq T\),
The above discussion can be summed up in the following theorem.
Theorem 2
Let y be the analytical exact solution to (1) and \(\{y^{p}\} _{p=0}^{K}\) be the time discrete solution to Eq. (28) and Eq. (29) subject to the initial condition \(y^{0}=v_{0}(x)\), \(x\in [0,L]\), then the following holds:
4 Discretization in space
Let \((x_{i},t_{p})\) be the grid points which uniformly discretize the region \([0,L]\times [0,T]\) with \(x_{i}=ih\), \(t_{p}= p\Delta t\), \(T=K\Delta t\), where, \(i=0(1)n\) and \(p=0(1)K\). The parameters h, Δt are the grid sizes in the space and time directions, respectively. The space discretization of Eq. (22) using non-polynomial quintic spline is formulated as follows:
The operator Φ is defined as
Now, Eq. (8) takes the following form:
Applying the operator Φ on Eq. (41), we get the following result:
After simplifying, system (44) takes the following form:
where
System (46) provides \((n-3)\) equations involving \(S_{i}^{p+1}\), \(i=1,2,\ldots ,n-1\). Therefore, we further need two equations for complete solution of \(S_{i}^{p+1}\). The required two end conditions can be derived using simply supported boundary conditions as follows:
Similarly,
The proposed algorithm is a five point scheme. In order to implement it, the numerical values of \(S^{2}=[S_{1}^{2},S_{2}^{2},S_{3}^{2},\ldots ,S_{n-1}^{2}]^{T}\) and \(S^{1}=[S_{1}^{1},S_{2}^{1},S_{3}^{1},\ldots ,S _{n-1}^{1}]^{T}\) are needed. To calculate the values of \(S^{2}\), it is required to find \(S^{1}\). Solving Eq. (24) and using the non-polynomial quintic spline technique, value of \(S^{1}\) can be found as follows:
where
System (49) consists of \((n-3)\) equations involving \(S_{i}^{1}\), \(i=1,2,\ldots ,n-1\). Hence, to get a unique solution to this system, two additional end equations can be obtained from simply supported boundary conditions in the following way:
and
Suppose \(v=[v_{1},v_{2},\ldots ,v_{n-1}]^{T}\), \(u= [u_{1},u_{2}, \ldots ,u_{n-1}]^{T}\), \(\tilde{v}=[v_{0},0,\ldots ,0,v_{n}]^{T}\), and \(\tilde{u}=[u_{0},0, \ldots ,0,u_{n}]^{T}\) are column vectors with dimension \((n-1)\). The system in (49)–(51) can be expressed as
where A, B, and C are square matrices of order \((n-1)\) such that
4.1 Calculation of truncation error
Equation (44) can be written in the following form:
Expanding equation (52) with Taylor series in terms of \(S(x_{i},t_{p})\) and its spatial derivatives, the truncation error is obtained as follows:
or
where
Equation (54) along with Theorem 2 gives the following result:
From the above discussion it is concluded that the proposed numerical scheme is of \(O(h^{4}+\Delta t^{2-\gamma })\).
5 Numerical results
In this section, we consider three test problems to check the validity and efficiency of the proposed numerical scheme. The approximate results are compared with quintic spline collocation method (QnSM) used in [21]. All the computations are executed in Mathematica 9.0. The accuracy of the presented technique is tested by error norms \(L_{\infty }\), \(L_{2}\) and order of convergence (χ), which are calculated as follows:
where \(y_{i}\), \(Y_{i}\) represent the exact and approximate solution at the ith knot, respectively.
Problem 1
Consider the fourth-order time fractional PDE [21]:
with the initial condition
and the boundary conditions
The exact solution is \(y(x,t)=\sin (\pi x)e^{t}\). The computational error norms \(L_{\infty }\) and \(L_{2}\) corresponding to different values of γ are listed in Table 1 when \(\alpha =0.01\) and \(n=100\). It is obvious that our proposed computational approach produces more accurate results with \(\Delta t=0.01\) as compared to QnSM used in [21] with \(\Delta t=0.000001\). A comparison of \(L_{\infty }\), \(L_{2}\) and order of convergence χ with QnSM [21] at \(t=1\) corresponding to \(\gamma =0.5\) and \(\Delta t=h\) is reported in Table 2. It is observed that the order of convergence in numerical results exhibits a good agreement with the theoretical estimation. In Fig. 1, three-dimensional visuals of exact and approximate solutions are displayed for \(n=100\), \(\Delta t=0.01\). The absolute numerical error at \(t=1\) corresponding to \(n=100\), \(\Delta t=0.01\), and \(\gamma =0.5\) is portrayed in Fig. 2.
Exact and approximate solution for Problem 1 when \(n=100\), \(\Delta t=0.01\), and \(\gamma =0.25\)
Absolute error for Problem 1 using \(n=100\), \(\Delta t=0.01\), and \(\gamma =0.25\)
Problem 2
Consider the following fourth-order time fractional PDE [21]:
with the initial condition
and the boundary conditions
The closed form solution is \(y(x,t)=t\sin (\pi x)\). The computational error norms \(L_{\infty }\) and \(L_{2}\) for \(n=100\) and different choices of γ are presented in Table 3. It can be observed that our presented approach yields more accurate results with \(\Delta t=0.01\) as compared to QnSM employed in [21] with \(\Delta t=0.000001\). Table 4 presents the error norms \(L_{\infty }\), \(L_{2}\) and the corresponding order of convergence at \(t=1\) for \(\Delta t=h\) and \(\gamma =0.5\). Figure 3 shows three-dimensional plots of exact and approximate solutions for \(n=100\), \(\Delta t=0.01\), and \(\gamma =0.5\). The absolute numerical error at \(t=1\) corresponding to \(n=100\), \(\Delta t=0.01\), and \(\gamma =0.25\) is portrayed in Fig. 4.
Exact and approximate solution for Problem 2 when \(n=100\), \(\Delta t=0.01\), and \(\gamma =0.5\)
Absolute error for Problem 2 when \(n=100\), \(\Delta t=0.01\), and \(\gamma =0.5\)
Problem 3
Consider the fourth-order time fractional PDE [21]:
with the initial condition
and the boundary conditions
The analytical exact solution is \(y(x,t)=(t+1)\sin \pi x\). Table 5 shows a comparison of computational error norms with QnSM [21] corresponding to different selections of γ. It is found that our computational outcomes are better than QnSM [21]. In Fig. 5, three-dimensional visuals of exact and approximate solutions are displayed for \(n=40\), \(\gamma =0.5\), and \(\Delta t=0.01\). The absolute numerical error at \(t=1\) corresponding to \(n=40\), \(\Delta t=0.01\), and \(\gamma =0.5\) is portrayed in Fig. 6. It is obvious that approximate solution is highly consistent with the analytical exact solution, which proves the effectiveness of the proposed scheme.
Exact and approximate solution for Problem 3 when \(\gamma =0.5\), \(n=40\), and \(\Delta t=0.01\)
Absolute error for Problem 3 when \(n=40\), \(\Delta t=0.01\), and \(\gamma =0.5\)
6 Conclusion
In this work, non-polynomial quintic spline collocation method has been employed for approximate solution of fourth-order time fractional partial differential equations. The backward Euler method has been used for temporal discretization, whereas non-polynomial quintic spline function composed of a trigonometric part and a polynomial part has been employed to interpolate the unknown function in spatial direction. The proposed numerical algorithm is proved to be convergent and unconditionally stable. The numerical outcomes are found to be more accurate as compared to QnSM [21].
References
Podlubny, I.: Fractional Differential Equations: An Introduction to Fractional Derivatives, Fractional Differential Equations, to Methods of Their Solution and Some of Their Applications. Mathematics in Science and Engineering, Vol. 198. Academic Press, San Diego (1998)
Miller, K.S., Ross, B.: An Introduction to the Fractional Calculus and Fractional Differential Equations (1993)
Wang, Q.: Numerical solutions for fractional KdV–Burgers equation by Adomian decomposition method. Appl. Math. Comput. 182(2), 1048–1055 (2006)
Zurigat, M., Momani, S., Alawneh, A.: Analytical approximate solutions of systems of fractional algebraic–differential equations by homotopy analysis method. Comput. Math. Appl. 59(3), 1227–1235 (2010)
Turut, V., Güzel, N.: Multivariate Pade approximation for solving nonlinear partial differential equations of fractional order. Abstr. Appl. Anal. 2013, Article ID 746401 (2013)
Liu, J., Hou, G.: Numerical solutions of the space-and time-fractional coupled Burgers equations by generalized differential transform method. Appl. Math. Comput. 217(16), 7001–7008 (2011)
Khan, N.A., Khan, N.-U., Ayaz, M., Mahmood, A., Fatima, N.: Numerical study of time-fractional fourth-order differential equations with variable coefficients. J. King Saud Univ., Sci. 23(1), 91–98 (2011)
Abbas, M., Majid, A.A., Ismail, A.I.M., Rashid, A.: The application of cubic trigonometric B-spline to the numerical solution of the hyperbolic problems. Appl. Math. Comput. 239, 74–88 (2014)
Javidi, M., Ahmad, B.: Numerical solution of fourth-order time-fractional partial differential equations with variable coefficients. J. Appl. Anal. Comput. 5(1), 52–63 (2015)
Kanth, A.R., Aruna, K.: Solution of fractional third-order dispersive partial differential equations. Egypt. J. Basic Appl. Sci. 2(3), 190–199 (2015)
Pandey, R.K., Mishra, H.K.: Homotopy analysis Sumudu transform method for time-fractional third order dispersive partial differential equation. Adv. Comput. Math. 43(2), 365–383 (2017)
Prakash, A., Kumar, M.: Numerical method for fractional dispersive partial differential equations. Commun. Numer. Anal. 1, 1–18 (2017)
Bashan, A., Karakoc, S.B.G., Geyikli, T.: Approximation of the KdVB equation by the quintic B-spline differential quadrature method. Kuwait J. Sci. 42(2), 67–92 (2015)
Khan, A., Aziz, T.: The numerical solution of third-order boundary-value problems using quintic splines. Appl. Math. Comput. 137(2–3), 253–260 (2003)
Ramadan, M., Lashien, I., Zahra, W.: Quintic nonpolynomial spline solutions for fourth order two-point boundary value problem. Commun. Nonlinear Sci. Numer. Simul. 14(4), 1105–1114 (2009)
Khan, A., Sultana, T.: Non-polynomial quintic spline solution for the system of third order boundary-value problems. Numer. Algorithms 59(4), 541–559 (2012)
Karakoc, S.B.G., Yagmurlu, N.M., Ucar, Y.: Numerical approximation to a solution of the modified regularized long wave equation using quintic B-splines. Bound. Value Probl. 2013(1), 27 (2013)
Srivastava, P.K.: Study of differential equations with their polynomial and nonpolynomial spline based approximation. Acta Tech. Corviniensis, Bull. Eng. 7(3), 139 (2014)
Siddiqi, S.S., Arshed, S.: Numerical solution of time-fractional fourth-order partial differential equations. Int. J. Comput. Math. 92(7), 1496–1518 (2015)
Rashidinia, J., Mohsenyzade, M.: Numerical solution of one-dimensional heat and wave equation by non-polynomial quintic spline. Int. J. Math. Model. Comput. 5(4), 291–305 (2015)
Tariq, H., Akram, G.: Quintic spline technique for time fractional fourth-order partial differential equation. Numer. Methods Partial Differ. Equ. 33(2), 445–466 (2017)
Hamasalh, F.K., Muhammad, P.O.: Generalized quartic fractional spline interpolation with applications. Int. J. Open Probl. Comput. Math. 8(1), 67–80 (2015)
Arshed, S.: Quintic B-spline method for time-fractional superdiffusion fourth-order differential equation. Math. Sci. 11(1), 17–26 (2017)
Li, X., Wong, P.J.Y.: An efficient nonpolynomial spline method for distributed order fractional subdiffusion equations. Math. Methods Appl. Sci. (2018). https://doi.org/10.1002/mma.4938
Lin, Y., Xu, C.: Finite difference/spectral approximations for the time-fractional diffusion equation. J. Comput. Phys. 225(2), 1533–1552 (2007)
Acknowledgements
The authors are grateful to the anonymous reviewers for their helpful, valuable comments and suggestions in the improvement of this manuscript.
Availability of data and materials
Not applicable.
Funding
No funding is available for this research.
Author information
Authors and Affiliations
Contributions
All authors contributed equally to this work. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Amin, M., Abbas, M., Iqbal, M.K. et al. Non-polynomial quintic spline for numerical solution of fourth-order time fractional partial differential equations. Adv Differ Equ 2019, 183 (2019). https://doi.org/10.1186/s13662-019-2125-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-019-2125-1