Abstract
This article aims to develop an optimal superconvergent numerical method for approximating the solution of the nonlinear time-fractional generalized Fisher’s (TFGF) equation. The time-fractional derivative in the model problem is considered in the sense of Caputo and is approximated using the \(L2-1_{\sigma }\) scheme. Spatial discretization is performed using an optimal superconvergent quintic B-spline (OSQB) technique. To derive the method, a high-order perturbation of the semi-discretized equation of the original problem is generated using spline alternate relations. Convergence and stability of the method are analyzed, demonstrating that the method converges with \(O(\Delta t^{2}+\Delta x^6)\), where \(\Delta x\) and \(\Delta t\) are step sizes in space and time, respectively. Three numerical examples are provided to demonstrate the robustness of the proposed method. Our method is compared with an existing method in the literature and the elapsed computational time for the present scheme is provided.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
In the present study, we consider the following nonlinear TFGF equation:
where \((x,t)\in \left( X_l,X_r\right) \times \left( 0,T\right) , \alpha \in (0,1).\) The above problem subjected to the initial condition (IC)
and the boundary conditions (BCs)
Here, \(\beta >0\) is an integer and \(\nu \) is a viscosity parameter. The functions \(f(x,t),\, {{\tilde{\mu }}}(x),\, g_{1}(t)\) and \(g_{2}(t)\) are sufficiently smooth. We define the fractional derivative \(\frac{\partial ^{\alpha } u(x,t)}{\partial t^{\alpha }}\) in (1) in the sense of Caputo:
In recent years, fractional differential equations (FDEs) have gained much attention among researchers due to their wide range of applications in applied sciences and engineering. For more details, one may refer to Podlubny (1999); Giona et al. (1992); Mainardi (1997); Bagley and Torvik (1984); Roul et al. (2021, 2022); Veeresha et al. (2020); Kumar et al. (2020); Roul (2020) and references therein. The fractional order derivatives can model complex phenomena in a better manner than the integer order derivatives.
The study of the nonlinear Fisher’s equation has attracted much attention from researchers worldwide. This equation is found in various contexts, such as modeling the spread of a viral mutant, neutron population dynamics in atomic reactors, and the proliferation of flames. Analytic solutions for most Fractional Differential Equations (FDEs) cannot be obtained explicitly, necessitating the adaptation of numerical techniques for their solutions. Numerical techniques for solving time fractional parabolic differential equations, pertinent to reaction-diffusion or convection-diffusion processes, are discussed in several works (Roul and Rohil 2022; Hamou et al. 2022; Roul and Rohil 2023; Hamou et al. 2023). Several techniques have been developed for the time-fractional Fisher’s (TFF) equation. For instance, Gupta et al. (2014) presented a numerical technique based on Haar wavelets and the Optimal Homotopy Asymptotic Method (OHAM) for approximating the solution of Burgers’ and generalized Fisher’s equations. The authors of Cherif et al. (2016) implemented the classical Homotopy Perturbation Method (HPM) for solving the space-fractional Fisher’s equation. Using the Fractional Natural Decomposition Method (FNDM), Rawashdeh (2016) obtained approximate and analytical solutions for two nonlinear FDEs, namely the time-fractional Harry Dym equation and the nonlinear TFF equation. Qurashi et al. (2017) implemented the Residual Power Series Method (RPSM) to find a series solution for the nonlinear TFF equation. Khader and Saad (2018) introduced a numerical scheme for solving the space-fractional Fisher’s equation using the spectral collocation method based on Chebyshev approximations. Majeed et al. (2020) developed a numerical technique based on cubic B-spline (CS) basis functions for TFF and Burgers’ equations. This method uses the L1 formula to approximate the Caputo fractional derivative and third-degree basis spline functions based on the Crank-Nicolson scheme for space derivatives. Additionally, a numerical scheme based on the L1 formula and the CS basis functions is presented for solving the TFGF equation (Majeed et al. 2020). Wazwaz and Gorguis (2004) obtained the series solution of the integer-order Fisher’s equation using the Adomian Decomposition Method. Recently, Tamboli and Tandel (2022) employed the Fractional Reduced Differential Transform Method (FRDTM) to solve the Time-Fractional Generalized Burger-Fisher Equation (TF-GBFE), demonstrating high accuracy through comparison with exact solutions and varying fractional orders. Choudhary et al. (2023) presented a high-order numerical scheme for the generalized time-fractional Fisher’s equation, utilizing Caputo fractional derivatives, Euler backward discretization, quasilinearization, and a compact finite difference scheme, achieving convergence of order four in space and \((2-\alpha )\) in time. Numerical methods available in the literature for time-fractional problems are typically based on the classical L1 formula, converging with an order \(O(\Delta t^{2-\alpha })\). Gao et al. (2014) developed the \(L1-2\) formula for approximating the Caputo fractional derivative. Roul and Rohil (2022) proposed a numerical scheme for the nonlinear TFGF equation, employing the Caputo fractional derivative of order \(\alpha \) approximated using the \(L1-2\) scheme, along with space derivative discretization using a collocation method based on quintic B-spline (QBS) basis functions, establishing convergence analysis with the method achieving convergence of order four in space and two in time. Recently, Alikhanov (2015) introduced a new \(L2-1_{\sigma }\) scheme for approximating the Caputo fractional derivative. Numerical methods for one or two-dimensional time-fractional problems based on this scheme can be found in recent articles (Roul and Rohil 2022, 2023).
Our main objective is to develop a higher-order numerical method for solving the TFGF equation subject to initial and boundary conditions. The proposed method is based on the \(L2-1_{\sigma }\) scheme for discretization of the temporal fractional derivative and the OSQB method for discretization of the spatial derivative. To derive the method, a high-order perturbation of the semi-discretized equation of the original problem is generated using spline alternate relations. The convergence and stability of this scheme are studied, proving sixth-order convergence in space and second-order convergence in time. The results of our method are compared with those of a previous method proposed by Majeed et al. (2020). To the best of our knowledge, this scheme has not been considered in the literature for the numerical approximation of the TFGF equation.
The balance of this paper is organized as follows: In Sect. 2, the proposed method is developed for the problem (1)–(3). Stability and convergence analysis of the proposed scheme are presented in Sect. 3. Numerical results are presented in Sect. 4. Finally, the conclusions are discussed in Sect. 5.
2 Description of numerical scheme
This section is devoted to the derivation of our proposed numerical scheme for the solution of the TFGF Eq. (1) with IC (2) and BCs (3).
2.1 Time discretization
We first discretize the problem (1)–(3) with respect to the time variable over [0, T]. Let \(N\ge 1\) be an integer and define \(t_n=n \Delta t\) with \(0\le n\le N\), where \(\Delta t=\frac{T}{N}\) is the step size. Let \(\sigma =1-\frac{\alpha }{2}\) and denote \(t_{n-1+\sigma }=(n-1+\sigma )\Delta t\).
By means of the \(L2-1_{\sigma }\) scheme, the Caputo time-fractional derivative in (1) is descretized at \(t=t_{n-1+\sigma }\) as Alikhanov (2015)
where \(\text {for } n=1\), \(c_0^{\alpha }=a_0^{\alpha }\) and for \(n\ge 2\)
in which
The truncation error \(O(\Delta t^{3-\alpha })\) in (4) can be obtained by assuming that \(u(\cdot ,t) \in C^3([0, T ])\).
Lemma 1
(Alikhanov 2015) The coefficients \(c^{\alpha }_l,\) \(0<\alpha <1,\) satisfy
-
(1)
\(c^{\alpha }_l>\frac{1-\alpha }{2}(l+\sigma )^{-\alpha }\ge 0,\; l\ge 0,\)
-
(2)
\(c^{\alpha }_{l-1}>c^{\alpha }_{l}, \;l\ge 1. \)
Denote \(u(x,t_n)=u^n(x).\) Considering (1) at \(t=t_{n-1+\sigma }\) yields
By using Eq. (4), from (6) we have
Now using the Taylor’s series expansion, we can easily obtain the following:
Making use of (8), (9) and (10) in (7) and rearranging the terms, we obtain
where \( P_{\alpha }=\frac{\Delta t^{-\alpha }}{\Gamma (2-\alpha )}.\)
We use the following formula to linearize the non-linear term (Rubin and Graves 1975):
Making use of (12) into (11) and rearranging the terms, we obtain
with IC
and BCs
2.2 Space discretization
Here, we discretize (13)–(15) with respect to space variable using an OSQB scheme.
2.2.1 Quintic spline interpolation
In this subsection, we define quintic spline (QS) interpolant and derive several asymptotic relations that will be used in the formulation and the theoretical analysis of the proposed method.
Let \(M\ge 1\) and \(I=\bigl \{X_l = x_0<x_1<\dots < x_{M} = X_r\bigr \}\) denotes the uniform partition of the domain \(\left[ X_l,X_r\right] \), where \(x_{m}=m\Delta x,\,\,m=0,1,...,M\) and \(\Delta x\) is the spatial step size. We consider the set of midpoints as \({\pi }_I = \{\tau _{1}<\tau _{2}<...<\tau _{M}\},\) where \(\tau _{m}=\frac{x_{m-1}+x_{m}}{2}, m=1,2,...,M\). Let \(S_{5,I} = \{q(x)| q(x)\in {\mathbb {C}}^4[X_l, X_r]\)} be the quintic spline space (QSS). The QBS basis functions, \(\Theta _{k}(x)\), \(-2 \le k \le M+2\), for \(S_{5,I}\) are given by De Boor (1978):
with \({\mathcal {G}}(x)=\frac{x^5}{120\Delta x^{5}}\).
In order to facilitate the QBS basis functions, ten additional grid points as \(x_{-5}<x_{-4}<x_{-3}<x_{-2}<x_{-1}<x_{0}=X_l\) and \( x_{M}=X_r<x_{M+1}<x_{M+2}<x_{M+3}<x_{M+4}<x_{M+5}\), are considered outside the interval I. Let \(\tilde{\Theta }=\{\Theta _{-2}(x), \Theta _{-1}(x), \Theta _{0}(x),..., \Theta _M(x),\) \( \Theta _{M+1}(x), \Theta _{M+2}(x)\}\) be the set of QBS functions. All \(\Theta _i(x)\) are linearly independent. Let \(\Theta ^*(I)\) = span \({\tilde{\Theta }}\). Then, \(\Theta ^*(I)\) is a QSS with dimension \(M+5\). Observe that \(\Theta ^*(I)=S_{5,I}\) (Prenter 1975). Thus, \(S_{5,I}\) generates a QSS on I.
Let \({\mathcal {Z}}^{n}(x)\in S_{5,I}\) be the approximate solution of the exact solution \(u^{n}(x)\) of (13)–(15), which is given by
where \({\mathcal {Z}}^n(x)\) satisfies the following interpolating conditions:
The values of \({\mathcal {Z}}^n(x)\) and its first and second derivatives are obtained using (16) at the nodal points \(x_m (0\le m\le M)\) and midpoints \(\tau _{m} (1\le m\le M)\) as given in Table 1. With the help of Table 1, we get:
Theorem 1
Let \({\mathcal {Z}}^n(x)\) be the quintic spline interpolant (QSI) of \(u^n(x)\in {\mathbb {C}}^{6}[X_l,X_r] \). Then, for \(x_{m}, 0\le m \le M,\) we have (see Theorem 2 of (Roul 2020))
Theorem 2
Let \({\mathcal {Z}}^n(x)\) be the QSI of \(u^n(x)\in {\mathbb {C}}^{6}[X_l,X_r] \). Then for \({\tau }_{m}, 1\le m \le M,\) we have
Proof
This proof follows the same arguments as used in the proof of Theorem 2 of Roul (2020). \(\square \)
Theorem 3
Let \({\mathcal {Z}}^n(x)\in S_{5,I}\) be the QS interpolant of \(u^n(x)\in {\mathbb {C}}^{6}[X_l,X_r] \). Then, we have (see Theorem 3 of Roul (2020)):
where \(D^{p}=\frac{\partial ^p}{\partial x^p}.\)
We define the difference operators \(\delta \) and \(\delta ^2\) as follows:
Lemma 2
Let \({\mathcal {Z}}^n(x)\in S_{5,I}\) be the QS interpolant of \(u^n(x)\in {\mathbb {C}}^{6}[X_l,X_r] \) that satisfies the interpolation conditions (18) and (19). Then, we have
Proof
From (27), we have
Applying the operator \(\delta ^2\) defined in (31) on both sides of (33), we get
Using Taylor’s expansion on the right side of (34) and then simplifying we can obtain that
Corollary 1
If \(u^n(x)\in {\mathbb {C}}^{6}[X_l,X_r]\), then the following approximations hold at the grid points \(x_m\):
Proof
We can easily obtain the relation (35) from (26). To prove the relation (36), we substitute the value of \(u_{xxxxxx}^n(x_{m})\) from (32) in (27). Thus, we have
\(\square \)
Lemma 3
Let \({\mathcal {Z}}^n(x)\in S_{5,I}\) be the QS interpolant of \(u^n(x)\in {\mathbb {C}}^{6}[X_l,X_r] \) and it satisfies the interpolation conditions (18) and (19). Then the following relations hold near the left boundary points \((x_0, x_1)\) and the right boundary points \((x_{M-1}, x_M)\):
Proof
First we prove (37) for \(m=1\). We consider the approximation for \(u_{xxxxxx}^n(x_{1})\) as follows
Using (32) for \(m=2,3\) in above equation, we get
Hence, the relation (37) is obtained for \(m=1\).
To prove (37) for \(m=0,\) we consider an approximation for \(u_{xxxxxx}^n(x_{0})\) as follows
By using (40) and (32) for \(m=2\) in (41), we obtain
Hence, relation (37) for \(m=0\) is obtained. In a similar way, we can prove relation (38). \(\square \)
Lemma 4
Let \({\mathcal {Z}}^n(x)\in S_{5,I}\) be the QS interpolant of \(u^n(x)\in {\mathbb {C}}^{6}[X_l,X_r] \) and it satisfies the interpolation conditions (18) and (19). Then the following relations hold near the left boundary midpoint \(\tau _1\) and the right boundary midpoint \(\tau _M\):
Proof
First we prove (42). For the purpose, we consider an approximation for \(u_{xxxxxx}^n(\tau _{1})\) as follows
Using (37) for \(m=1\) and (32) for \(m=2\) in the above equation produces
Hence, relation (42) is obtained. In a similar way, we can prove (43). \(\square \)
2.2.2 Fully discrete scheme based on an OSQB method
Here, by means of the optimal quintic B-spline collocation method, we discretize Eqs. (13)–(15) with respect to space variable.
At the grid points \(x_{m}\), (13) is discretized as
The discretized BCs (3) are
By using (18) and (26)–(27) in (44), we obtain
where
In views of Lemma 2, Lemma 3 and ignoring the \(O(\Delta t^{2})\) terms, from Eq. (46) we have
Taking into account (18), (26) and Lemma 3, it follows from (45) that
Equations (47)–(53) produce a linear system of \(M+3\) equations having \(M+5\) unknowns: \({\lambda }_{-2}^n, {\lambda }_{-1}^n, {\lambda }_{0}^n\), ..., \({\lambda }_{M}^{n}, {\lambda }_{M+1}^n, {\lambda }_{M+2}^n\). To close this system, we require two more equations. For this purpose, we consider two auxiliary equations at the midpoints \(x=\tau _1,\tau _M\). By using Eqs. (18), (28) and (29) in (44), we obtain
where
In view of Lemma 4, from equation (54) we have
Let \(\tilde{{\mathcal {Z}}}^n(x)\) denote the collocation approximation for the solution of (13)-(15) given by
We compute this approximation by satisfying the collocation equations defined by (47)-(53) and (55)-(56), after dropping the \(O\left( \Delta x^6\right) \) terms. Thus, we obtain the following system of \((M+5)\) linear algebraic equations in \((M+5)\) unknowns:
where
The following algorithm illustrates the method described above. | |
Step 1: Provide inputs including the number of mesh points in space (M) and time (N), the mesh size in space (\(\Delta x\)) and time (\(\Delta t\)), as well as the coefficients \({a}_l^{\alpha }\), \({b}_l^{\alpha }\), and \({c}_l^{\alpha }\) for \(0\le l\le N\), along with the initial condition (IC) (2) and boundary conditions (BCs) (3). | |
Step 2: Formulate the system of equations given by equations (58)-(66). | |
Step 3: Employ the Gaussian elimination method to solve the system (58)-(66) at each time level, obtaining the unknown parameters \(\lambda _m^n\), where \(-2\le m\le M+2\) and \(1\le n\le N\). | |
Step 4: Output: The approximate value of the solution u(x, t) at the grid points by utilizing the obtained values of the unknown parameters \(\tilde{\lambda }_m^n\) in equation (57). |
3 Stability and convergence analysis
Here, we establish stability and convergence results of the present numerical scheme for the problem (1)–(3).
3.1 Stability
In this subsection, we study the stability analysis of the present numerical scheme.
Theorem 4
The present method (58)–(66) for the problem considered is unconditionally stable.
Proof
For simplicity, the non-linear term \(u^{n-1+\sigma }(x)\left( 1-(u^{n-1+\sigma }(x))^{\beta }\right) \) in the homogeneous form of (7) is linearized by setting \((u^{n-1+\sigma }(x))^{\beta }-1\) as a constant \(\mu \). Then, we obtain
Making use of the approximations (8) and (9) in (67), we obtain
Using the OSQB, as explained in Sect. 2, in Eq. (68) yields the following equations for the mesh points \(x=x_m\), \(m=2,3,\dots ,M-2\):
where \(\eta _1=\frac{P_{\alpha } c_0^{\alpha }}{120},\) \(\eta _2=\frac{\sigma \mu }{120}\) and \(\eta _3=\frac{\sigma \nu }{4320 \Delta x^2}.\) \(\square \)
Define the error \({\zeta }^n_m\) by
where \(\lambda ^{*}{_{m}^{n}}\) be the solution of the perturbed system of (69). By (70), we obtain the error equations for (69):
The error \({\zeta }_{m}^{n}\) can be chosen as
where \(i=\sqrt{-1}\). Inserting (72) into (71) yields
From (73), we have
where \(\gamma _1={\cos }(\rho \Delta x)+26{\cos }(\rho \Delta x)+33\) and \( \gamma _2=2{\cos }(4\rho \Delta x)-4{\cos }(3\rho \Delta x)-1456{\cos }(2\rho \Delta x)-2812{\cos }(\rho \Delta x)+4270.\)
We use the principle of mathematical induction to prove that
For \(n=1,\) (74) leads to
Since \(\sigma \in \left( \frac{1}{2},1\right) \), we have
Also since \(\Delta x>0,\) \(\Delta t>0\), \({\nu }\ge 0\) and \(0<\alpha <1,\) it follows that \(\Gamma (2-\alpha )>0\) and \(\eta _1,\, \eta _2,\, \eta _3\) are positive. Therefore, taking into account (77), for sufficiently small \(\Delta x\), we have
Therefore, (76) and (78) lead to
Thus, (75) is valid for \(n=1\). Suppose that (75) is valid for \(n\le j-1\), i.e.,
For \(n=j,\) (74) leads to
Using Lemma 1, (78) and (81), we can obtain that
Hence, (75) is valid for \(n=j\). Consequently, (75) is valid for every n, i.e.,
Proceeding in the same manner for the grid points \(x=x_m\), \(m=0,\,1,\,M-1,\,M\), we can obtain
where \(A^{(m)}=\frac{P_{\alpha }\gamma _1}{120}\Bigg [\displaystyle \sum _{l=1}^{j-1}\left( c^{\alpha }_{n-l-1}-c^{\alpha }_{j-l}\right) {\xi }^{l}+c^{\alpha }_{j-1} {\xi }^0\Bigg ]-\left( \frac{1-\sigma }{\sigma }\right) \eta _2\gamma _1{\xi }^{j-1}-\left( \frac{1-\sigma }{\sigma }\right) \eta _3{\tilde{\gamma }}_2^{(m)}{\xi }^{j-1}\), \(B^{(m)}=\left( \frac{1-\sigma }{\sigma }\right) \eta _3{\tilde{\gamma }}_3^{(m)}{\xi }^{j-1}\), \(C^{(m)}=\eta _1\gamma _1+\eta _2\gamma _1-\eta _3{\tilde{\gamma }}_2^{(m)}\) and \(D^{(m)}=-\eta _3{\tilde{\gamma }}_3^{(m)}\),
with
and
Using the principle of mathematical induction, we prove that
For \(n=1,\) (83) leads to
Making use of (77), for sufficiently small \(\Delta x\), it is clearly observed that
Therefore, (85) and (86) lead to
Thus, (84) is valid for \(n=1\). Suppose that (84) is valid for \(n\le j-1\), i.e.,
Using Lemma 1 and (87), we can obtain that
Finally, making use of (88) and (83), we get
which gives
Thus, (84) is valid for \(n=j\). Consequently, (84) is valid for every n, i.e.,
By (82) and (89), we conclude that the present numerical method (58)–(66) is unconditionally stable.
3.2 Convergence
A detailed analysis of convergence for proposed numerical method (58)-(66) for (1)–(3) is given here.
Theorem 5
Assume that \(\tilde{{\mathcal {Z}}}^{n}(x)\) defined in (57) is the QBS approximation for the exact solution \(u^n(x)\in {\mathbb {C}}^{6}[X_l,X_r]\) of (1)-(3). Then, we have
for small enough \(\Delta x\) and constant \({\mathcal {L}}\), independent of \(\Delta x.\)
Proof
First (7) is linearized by setting \((u^{n-1+\sigma }(x))^{\beta }-1\) as a constant \(\mu \) then the terms in the resulting equation are rearranged to obtain
The BCs are
Equations (90) and (91) can be rewritten in operator form as follows:
where
Let \({{\mathcal {Z}}}^{n}(x)\in S_{5,I}\) defined by equation (17) be the QS interpolant to the exact solution of (90)–(91). Then, by using Theorems 1 and 2 we have
Since \(u^{n}(x_{m})=\tilde{{\mathcal {Z}}}^n(x_{m}),\hspace{0.1cm}m=0,1,...,M\) and \(u^{n}({\tau }_{m})=\tilde{{\mathcal {Z}}}^n({\tau }_{m}),\hspace{0.1cm}m=1,M,\) therefore, we write the system (93) and (95) in the matrix form, as follows
where \(E=[O(\Delta x^6), O(\Delta x^6),...,O(\Delta x^6),O(\Delta x^6)]^{T}\).
From (96), for \(x=x_0,\, x_1,\, x_{M-1},\, x_{M},\,\tau _{1}\) and \(\tau _{M}\), respectively, we have
and
where \({\tilde{\eta }}_1=\eta _1+\eta _2,\) \(\eta _1^*=\frac{P_{\alpha } c_0^{\alpha }+\sigma \mu }{3840}\) and \(\eta _2^*=\frac{\sigma \nu }{69120 \Delta x^2}\).
We eliminate the unknowns \({\lambda }_{-2}^{n}, {\lambda }_{M+2}^{n}, \tilde{\lambda }_{-2}^{n}\) and \(\tilde{\lambda }_{M+2}^{n}\) from (97)–(102) by using (63) and (64). Thus, at the grid point \(x=x_0,\) we obtain
At the grid point \(x=x_1\), we obtain
At the grid point \(x=x_2\), we obtain
At the grid point \(x=x_{m}\), \((m=3,...,M-1)\), we obtain
At the grid point \(x=x_{M-2}\), we obtain
At the grid point \(x=x_{M-1}\), we obtain
Similarly, at the grid point \(x=x_M\), we obtain
At the mid point \(x=\tau _{1}\), we obtain
At the mid point \(x=\tau _{M}\), we obtain
In matrix form, Eqs. (103)–(111) can be written as
Here R is a square matrix of dimension \(M+3\), given as
R=\({\left( \begin{array}{ccccccccccccc} d^*_1&{}d^*_2&{} d^*_3&{}d^*_4&{}d^*_5&{}d^*_6&{}d^*_7&{} d^*_8&{}d^*_9&{}0 &{}\cdots &{}0&{}0\\ {\tilde{d}}_1&{}{\tilde{d}}_2&{} {\tilde{d}}_3&{}{\tilde{d}}_4&{}{\tilde{d}}_5&{}{\tilde{d}}_6&{}{\tilde{d}}_7&{} {\tilde{d}}_8&{}{\tilde{d}}_9&{}0 &{}\cdots &{}0&{}0\\ {\hat{d}}_{1}&{}{\hat{d}}_{2}&{}{\hat{d}}_{3}&{}{\hat{d}}_{4}&{}{\hat{d}}_{5}&{}{\hat{d}}_{6}&{}{\hat{d}}_7&{}{\hat{d}}_7&{}{\hat{d}}_8&{}0&{}\cdots &{}0&{}0\\ d_{6}&{}d_{7}&{}d_{8}&{}d_{9}&{}d_{4}&{}d_{3}&{}d_{2}&{}d_{1}&{}0&{}0&{}\cdots &{}0&{}0\\ d_1&{}d_2&{}d_3&{}d_4&{}d_5&{}d_4&{}d_3&{}d_2&{}d_1&{}0&{}\cdots &{}0&{}0\\ \ddots &{}\ddots &{}\ddots &{}\ddots &{}\ddots &{}\ddots &{}\ddots &{}\ddots &{}\ddots &{}\ddots &{}\ddots &{}\ddots &{}\ddots \\ 0 &{}0&{}\cdots &{} 0&{}d_1&{}d_2&{} d_{3}&{}d_{4}&{}d_{5}&{}d_{4}&{}d_{3}&{}d_{2}&{}d_1\\ 0 &{}0&{}\cdots &{} 0&{}0&{}d_{1}&{} d_{2}&{}d_{3}&{}d_{4}&{}d_{9}&{}d_{8}&{}d_{7}&{}d_6\\ 0 &{}0&{}\cdots &{} 0 &{} {\hat{d}}_{8}&{}{\hat{d}}_{7}&{}{\hat{d}}_{7}&{}{\hat{d}}_{6}&{}{\hat{d}}_{5}&{}{\hat{d}}_{4}&{}{\hat{d}}_3&{}{\hat{d}}_2&{}{\hat{d}}_1\\ 0 &{}0&{} \cdots &{}0&{}{\tilde{d}}_9&{}{\tilde{d}}_8&{} {\tilde{d}}_7&{}{\tilde{d}}_6&{}{\tilde{d}}_5&{}{\tilde{d}}_4&{}{\tilde{d}}_3&{} {\tilde{d}}_2&{}{\tilde{d}}_1\\ 0 &{}0&{} \cdots &{}0&{}d^*_9&{}d^*_8&{} d^*_7&{}d^*_6&{}d^*_5&{}d^*_4&{}d^*_3&{} d^*_2&{}d^*_1 \end{array}\right) }\,\) and \({\lambda }^{n}-\hat{\lambda }^{n}\)=\({\left( \begin{array}{cc} {\lambda }_{-1}^{n}-\hat{\lambda }_{-1}^{n}\\ {\lambda }_{0}^{n}-\hat{\lambda }_{0}^{n}\\ {\lambda }_{1}^{n}-\hat{\lambda }_{1}^{n}\\ {\lambda }_{2}^{n}-\hat{\lambda }_{2}^{n}\\ {\lambda }_{3}^{n}-\hat{\lambda }_{3}^{n}\\ \vdots \\ {\lambda }_{M-3}^{n}-\hat{\lambda }_{M-3}^{n}\\ {\lambda }_{M-2}^{n}-\hat{\lambda }_{M-2}^{n}\\ {\lambda }_{M-1}^{n}-\hat{\lambda }_{M-1}^{n}\\ {\lambda }_{M}^{n}-\hat{\lambda }_{M}^{n}\\ {\lambda }_{M+1}^{n}-\hat{\lambda }_{M+1}^{n} \end{array}\right) },\)
where \(d_1=\eta _3,\, d_2=-2\eta _3,\, d_3={\tilde{\eta }}_1-728\eta _3,\, d_4=26{\tilde{\eta }}_1-1406\eta _3,\, d_5= 66{\tilde{\eta }}_1+4270\eta _3,\, d_6=-28\eta _3,\, d_7={\tilde{\eta }}_1-794\eta _3,\, d_8= 26{\tilde{\eta }}_1-1432\eta _3,\, d_9= 66{\tilde{\eta }}_1+4269\eta _3, \,{\hat{d}}_1={\tilde{\eta }}_1-777\eta _3, \,{\hat{d}}_2=26{\tilde{\eta }}_1-1586\eta _3, \,{\hat{d}}_3=66{\tilde{\eta }}_1+4344\eta _3, \,{\hat{d}}_4=26{\tilde{\eta }}_1-1576\eta _3, \,{\hat{d}}_5={\tilde{\eta }}_1-602\eta _3, \,{\hat{d}}_6=-50\eta _3, \,{\hat{d}}_7=4\eta _3, \,{\hat{d}}_8=-\eta _3,\, {\tilde{d}}_1= 17194\eta _3,\, {\tilde{d}}_2=51622\eta _3,\, {\tilde{d}}_3=17320\eta _3,\, {\tilde{d}}_4=-221\eta _3,\, {\tilde{d}}_5=202\eta _3,\, {\tilde{d}}_6=-92\eta _3,\, {\tilde{d}}_7=10\eta _3,\, {\tilde{d}}_8=7\eta _3,\, {\tilde{d}}_9=-2\eta _3,\, d^*_1=211\eta _1^*+8201\eta _2^*,\, d^*_2=1616\eta _1^*+129268\eta _2^*,\, d^*_3=1656\eta _1^*+68672\eta _2^*,\, d^*_4=236\eta _1^*-26301\eta _2^*,\, d^*_5=\eta _1^*-3680\eta _2^*,\, d^*_6=994\eta _2^*,\, d^*_7=-98\eta _2^*,\, d^*_8=-77\eta _2^*\) and \( d^*_9=21\eta _2^*.\)
Let \(s_{i},\ i=-1,0,1,....,{M+1}\) be the summation of the \(i-\)th row of R. Then, we have
For small enough \(\Delta x,\) it follows that \(s_{-1}>0, s_{0}>0, s_{k}\ge 0, k=1,...,M-1, s_{M}>0\) and \(s_{M+1}>0\). Therefore, R is monotone and hence \({R}^{-1}\) exists. Let \(r^{-1}_{k,j}\) be the (k, j)-th element of \({R}^{-1}.\) From the theory of matrices we have
Equation (113) yields
By Taylor’s expansion, we get
By employing infinity norm, (112) reduces to
Alternatively, we may write
where \(\mathcal {K}\) is a constant.
Moreover, by using (63), (64) and (114), we have
From (17) and (57), it follows that
The definition of the basis functions \(\Theta _{k}\) leads to
Operating the \(L_\infty \) norm on (116) and making the use of (114), (115) and (117) leads to
where \({\mathcal {N}}=\frac{186}{120}{\mathcal {K}} \). Theorem 3 yields
The triangle inequality gives
Now, substituting (118) and (119) into (120), we obtain
This completes the proof of Theorem 5. \(\square \)
Theorem 6
Assume that \(\tilde{{\mathcal {Z}}}(x,t)\) and u(x, t), respectively, represents the B-spline approximation and the exact solution of nonlinear TFGE equation. Then, the method (58)–(66) converges with the following estimate
Proof
By using Theorem 5 and Eq. (46), we can obtain the result in (121). \(\square \)
4 Numerical illustrations
In this section, we consider three nonlinear examples and solve them using the present method (58)–(66) in order to illustrate the efficacy and accuracy of the method. We compute the \(L_{\infty }\) norm error \(({\mathcal {E}}^{M,N}_{1})\) of the present scheme. The \(L_{\infty }\) norm error is defined as
where \(u(x_m,t_n)\) is the exact solution and \(\tilde{{\mathcal {Z}}}_m^n\) denote the approximate solution at \((x_m,t_n)\). We calculate the ROC (rate of convergence) of presented numerical method in space using the following formula:
Numerical results are computed with MATLAB R2020a on AMD Ryzen 5 2500U and 2.00 GHz processor.
Example 1
We consider (1) with \(\beta =3\), the IC:
and BCs
The exact solution is given by \(u(x,t)=t^{2\alpha }\left( 1-x^2\right) e^{2x}\). The source function f(x, t) can be obtained using the exact solution. We set \(T=1\) and \(\nu =1.\)
Table 2 presents the ROC in time based on \(L_{\infty }\) norm errors for \(\Delta x=1/1000\) and different N when \(\alpha = 0.5\), 0.8, 0.95. It is observed in Table 2 that the proposed method converges with order two in time direction. Table 3 presents the ROC in space for \(\Delta t=1/70,000\) and different M when \(\alpha =0.95.\) It can be observed from Table 3 that the proposed method is sixth order accurate in space. Further, we can observe from Tables 2 and 3 that the experimental ROC is consistent with the theoretical ROC given in Theorem 6. The comparison of the \(L_{\infty }\) error of our scheme for \(\Delta t = 0.0003\) and \(\Delta x=0.01\) with the method in Majeed et al. (2020) is given in Table 4. It can be observed from Table 4 that our method is more accurate than the method in Majeed et al. (2020). Figure 1 presents the two-dimensional graph of the approximate solutions for several T. In order to observe the effect of \(\alpha \), we plot the approximate solution for various values of \(\alpha \) when \(T=0.5\) in Fig. 2. The surface plots of numerical and exact solutions when \(\alpha =0.95\) and \(N=M=50\) are displayed in Figs. 3 and 4, respectively. These figures confirm that the proposed method approximates the exact solution very well. The elapsed computational time (in seconds) for the OSQB scheme is presented in Table 2. From the table one can observe that the present numerical scheme is computationally efficient.
Example 2
We consider (1) with \(\beta =3\), the IC:
and BCs
The analytical solution is given by \(u(x,t)=\left( 1+t^2\right) x^2e^{2x}\). The source function f(x, t) can be obtained using the exact solution. We set \(T=1\) and \(\nu =1.\)
In Table 5, we give the ROC in time for \(\Delta x=1/500\) and different N when \(\alpha = 0.5\). As expected, it is observed in Table 5 that the proposed method converges with order two in time direction. Next, Table 6 gives the ROC in space for \(\Delta t=1/70,000\) and different M when \(\alpha =0.95.\) It can be seen in this table that the proposed method is sixth order accurate in space. Further, Tables 5 and 6 confirm that the experimental ROC is consistent with the theoretical one given in Theorem 6. The comparison of the \(L_{\infty }\) error of our scheme for \(\Delta t = 0.0003\) and \(\Delta x=0.01\) with the scheme in Majeed et al. (2020) is given in Table 7 which suggests that our method is more accurate than the method in Majeed et al. (2020). Figure 5 presents the two-dimensional graph of the numerical solution for several T. Figs. 6 and 7 show the 3D plots of approximate and exact solutions, respectively, when \(\alpha =0.95\) and \(M=N=50\). These figures show that the numerical solution agrees very well with the exact solution.
Example 3
We consider (1) with \(\beta =2\), the IC:
and BCs
The exact solution is given by \(u(x,t)=t^2\sin (2\pi x)\). The source function f(x, t) can be obtained using the exact solution. We set \(T=1\) and \(\nu =1.\)
In Table 8, we give the ROC in time for \(\Delta x=1/500\) and different N when \(\alpha = 0.5\). As expected, it is observed in Table 8 that the proposed method converges with order two in time direction. Table 9 presents the ROC in space for \(\Delta t=1/70,000\) and different M when \(\alpha =0.95.\) It can be seen in this table that the proposed method is sixth order accurate in space. Further, Tables 8 and 9 confirm that the experimental ROC is consistent with the theoretical one given in Theorem 6. The comparison of the \(L_{\infty }\) error of our scheme for \(\Delta t = 0.0001\) and \(\Delta x=0.01\) with the method in Majeed et al. (2020) is given in Table 10. It can be observed from Table 10 that our scheme is more accurate than the scheme in Majeed et al. (2020). Figure 8 presents the two-dimensional graph of the numerical solution for several T. In Figs. 9 and 10, we present the 3D plots of numerical and exact solutions, respectively, when \(\alpha =0.95\) and \(M=N=50\). Figures 9 and 10 suggest that the approximate solution agrees very well with the exact solution.
5 Conclusions
The present paper described an accurate computational method for numerical solution of nonlinear TFGF equation. In this technique, the \(L2-1_{\sigma }\) formula is used for the approximation of the Caputo fractional derivative which appears in the model problem considered. The space derivatives are approximated using the collocation technique based on an OSQB. The developed method is proved to be unconditionally stable. The convergence results indicate that the method is sixth order convergent in space direction and second order convergent in temporal direction. The experimental results indicate that the present method is very accurate and effective in solving the nonlinear TFGF equation and the experimental ROC is consistent with the theoretical one. The comparison results show that our scheme provides more accurate results than the method in Majeed et al. (2020). Moreover, the authors in Majeed et al. (2020) has not established the convergence results for their method while we proved that our method has convergence order of six in space and of order two in time. It is also observed that the order of the fractional derivative has profound effects on the solution profile of the nonlinear TFGF equation. The CPU time of the method, provided in the Tables, confirms that the method is computationally efficient. Indeed, a potential direction for future research or extension of this work could involve developing a high-order numerical method for solving the nonlinear TFGF equation with non-smooth exact solution. While the present study focuses on problems with smooth exact solutions with respect to the time variable, addressing scenarios with non-smooth solutions could enhance the applicability and robustness of the numerical method.
Availability of supporting data
The manuscript has no associated data.
References
Alikhanov AA (2015) A new difference scheme for the time fractional diffusion equation. J Comput Phys 280:424–438
Bagley RL, Torvik PJ (1984) On the appearance of the fractional derivative in the behavior of real materials. J Appl Mech 51:294–298
Cherif MH, Belghaba K, Zaine D (2016) Homotopy perturbation method for solving the fractional Fishers equation. Int J Anal Appl 10(1):9–16
Choudhary R, Singh S, Kumar D (2023) A high-order numerical technique for generalized time-fractional Fisher’s equation. Math Meth Appl Sci 46:16050–16071
De Boor C (1978) A practical guide to splines. Springer, Berlin
Gao G, Sun Z, Zhang H (2014) A new fractional numerical differentiation formula to approximate the Caputo fractional derivative and its applications. J Comput Phys 259:33–50
Giona M, Cerbelli S, Roman HE (1992) Fractional diffusion equation and relaxation in complex viscoelastic materials. Phys A 191:449–453
Gupta AK, Ray SS (2014) On the solutions of fractional Burgers Fisher and generalized Fishers equations using two reliable methods. Int J Math Math Sci 2014:682910
Hamou AA, Hammouch A, Azroul E, Agarwal P (2022) Monotone iterative technique for solving finite difference systems of time fractional parabolic equations with initial/periodic conditions. Appl Numer Math 181:561–593
Hamou AA, Azroul E, Hammouch Z, Alaoui AL (2023) A monotone iterative technique combined to finite element method for solving reaction-diffusion problems pertaining to non-integer derivative. Eng Comput 39:2515–2541
Khader MM, Saad KM (2018) A numerical approach for solving the fractional Fisher equation using Chebyshev spectral collocation method. Chaos Solit Fract 110:169–177
Kumar S, Kumar R, Cattani C, Samet B (2020) Chaotic behaviour of fractional predator-prey dynamical system. Chaos Soliton Fract 135:109811
Mainardi F (1997) Fractals and fractional calculus continuum mechanics. Springer, Wien
Majeed A, Kamran M, Iqbal MK, Baleanu D (2020) Solving time fractional Burgers’ and Fisher’s equations using cubic B-spline approximation method. Adv Differ Equ 2020:175
Majeed A, Kamran M, Abbas M, Singh J (2020) An efficient numerical technique for solving time-fractional generalized Fisher’s equation. Front Phys 8:293
Podlubny I (1999) Fractional differential equations. Academic, New York
Prenter PM (1975) Splines and variational methods. Wiley, New York
Qurashi MMA, Korpinar Z, Baleanu D, Inc M (2017) A new iterative algorithm on the time-fractional Fisher equation: residual power series method. Adv Mech Eng 9(9):1–8
Rawashdeh MS (2016) The fractional natural decomposition method: theories and applications. Math Methods Appl Sci 40(7):2362–2376
Roul P (2020) A high accuracy numerical method and its convergence for time-fractional Black-Scholes equation governing European options. Appl Numer Math 151:472–493
Roul P, Rohil V (2022) A high-order numerical scheme based on graded mesh and its analysis for the two-dimensional time-fractional convection-diffusion equation. Comput Math Appl 126:1–13
Roul P, Rohil V (2022) A high order numerical technique and its analysis for nonlinear generalized Fisher’s equation. Comput Appl Math 406:114047
Roul P, Rohil V (2022) A novel high-order numerical scheme and its analysis for the two-dimensional time-fractional reaction-subdiffusion equation. Num Algo 90:1357–1387
Roul P, Rohil V (2023) An efficient numerical scheme and its analysis for the multiterm time-fractional convection-diffusion-reaction equation. Math Meth Appl Sci 46(16):16857–16875
Roul P, Rohil V (2023) A high-accuracy computational technique based on \(L2-1_{\sigma }\) and B-spline schemes for solving the nonlinear time-fractional Burgers’ equation. Soft Comput. https://doi.org/10.1007/s00500-023-09413-0
Roul P, Rohil V, Espinosa-Paredes G, Obaidurrahman K (2021) An efficient numerical method for fractional neutron diffusion equation in the presence of different types of reactivities. Ann Nucl Energy 152:108038
Roul P, Rohil V, Espinosa-Paredes G, Obaidurrahman K (2022) Numerical simulation of two-dimensional fractional neutron diffusion model describing dynamical behavior of sodium-cooled fast reactor. Ann Nucl Energy 166:108709
Rubin, SG Graves RA (1975) A cubic spline approximation for problems in fluid mechanic. NASA TR R-436, Washington
Tamboli VK, Tandel PV (2022) Solution of the time-fractional generalized Burger-Fisher equation using the fractional reduced differential transform method. J Ocean Eng Sci 7(4):399–407
Veeresha P, Prakasha DG, Kumar S (2020) A fractional model for propagation of classical optical solitons by using nonsingular derivative. Math Meth Appl Sci. https://doi.org/10.1002/mma.6335
Wazwaz AM, Gorguis A (2004) An analytic study of Fishers equation by using Adomian decomposition method. Appl Math Comput 154(3):609–620
Acknowledgements
The authors would like to thank the editor and anonymous referees for their valuable suggestions and comments which helped us to improve the quality of the manuscript.
Funding
There is no funding for this work.
Author information
Authors and Affiliations
Contributions
Pradip Roul: Conceptualization, Formal analysis, Resources, Writing- original draft, Investigation, Supervision Vikas Rohil: Writing-original draft, Formal analysis, Software.
Corresponding author
Ethics declarations
Conflict of interest
The author declares that they have no Conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Roul, P., Rohil, V. An accurate numerical method and its analysis for time-fractional Fisher’s equation. Soft Comput (2024). https://doi.org/10.1007/s00500-024-09885-8
Accepted:
Published:
DOI: https://doi.org/10.1007/s00500-024-09885-8