Abstract
In the present work, we investigate the numerical solution of time-fractional telegraph equation by a local meshless method. The fractional-order derivative is defined in the Caputo’s sense. The time semi-discretization was carried out using finite difference method followed by radial basis function-based spatial discretization. The theoretical convergence analysis and stability analysis of time semi-discrete scheme are also proved. Several test problems with regular and irregular domains with uniform and non-uniform points are considered. To demonstrate the accuracy and efficiency of the proposed method, we compared the analytical and numerical solution of the proposed problem.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
In recent decades, fractional calculus has become a powerful tool because many complex problems can be easily and successfully modeled in various fields by fractional calculus. Fractional calculus has many applications in the fields of science, engineering, and finance [2, 4, 6, 8, 24, 48, 57]. Fractional partial differential equations are obtained by replacing integer-order derivatives of partial differential equations with fractional-order derivatives. A lot of publications related to fractional partial differential equations are presented; for example, see [10, 19, 47, 52, 62, 64].
In this paper, we are dealing with following time-fractional telegraph equation
where \( 1< \alpha < 2\), \(T>0\) and \(\xi ({\mathbf{x}})\), \(\psi ({\mathbf{x}})\), \(\zeta ({\mathbf{x}},t)\) and \(f({\mathbf{x}},t)\) are sufficiently smooth functions on closed and bounded domain \(\Omega \subset {\mathbb {R}}^{2}\), with boundary \(\partial \Omega \). Moreover, for any given positive integer, the Caputo’s differential operator k, \(_{0}^{c}{\mathscr {D}}_{t}^{\alpha }u({\mathbf{x}},t)\) is defined as
It is found that the classical telegraph equation has many applications in neutron transport [59], random walk of suspension flows [3], signal analysis, propagation and transmission of electrical signals [36], etc. Recently, fractional telegraph equation has been solved by many authors. Mittal and Bhatia [37] developed differential quadrature method based on cubic B-spline basis function to solve hyperbolic telegraph equation. Ömer Oruç [41] considered two-dimensional hyperbolic telegraph equation using finite difference method in time and Hermite wavelets approach for space. In [28] Jiang and Lin solved time-fractional telegraph equation using reproducing kernel theorem. Kumar et al. [31] considered a generalized time-fractional telegraph-type equation using a numerical scheme based on the finite difference method. Liang et al. [33] discussed time-fractional telegraph equation using a fast high-order difference scheme. In [17] Dehghan et al. solved four different types of linear telegraph equations using He’s variational iteration method. Li and Cao [32] used finite difference method to solve linear time-fractional telegraph equation. In [39] Adomian decomposition method is derived by Momani to solve space- and time-fractional telegraph equation. Chen et al. [5] derived the analytical solution of time-fractional telegraph equation and applied the method of separating variables. Yildirim [61] proposed homotopy perturbation method (HPM) to solve space- and time-fractional telegraph equation. Wang and Mei [60] presented the time-fractional telegraph equation using a generalized finite difference method in time and Legendre spectral Galerkin method in space. In [7] homotopy analysis method (HAM) is presented by Das et al. to solve the time-fractional telegraph equation. A finite difference method in time and Galerkin finite element method in space are used to solve the time–space-fractional telegraph equation by Zhao and Li [63].
Recently, radial basis function (RBF)-based meshfree methods are increasingly attracted the attention of the researchers for solving fractional partial differential equations. Several problems [6, 12, 18, 27, 35, 46, 54] of fractional partial differential equations have been solved by many researchers and references therein. Abbaszadeh and Dehghan [1] considered the distributed order time-fractional diffusion-wave equation using interpolating element-free Galerkin method. Recently, Kumar et al. [29, 30] considered time-fractional linear and nonlinear diffusion-wave equation using RBF-based meshless local collocation method, respectively. For further applications of meshless methods, we refer Nikan et al. [40], Dehghan et al. [9, 11, 13, 15], Ghehsareh et al. [20,21,22,23], Liu et al. [34], Salehi et al. [49] Shivanian and Jafarabadi [54, 55] and references therein. Recently, Oruç [45] developed two meshless methods, in which one is based on local radial basis function and other is based on barycentric rational interpolation for solving 2D viscoelastic wave equation, and also the same author in [42,43,44] proposed a meshless method based on multiple-scale Pascal polynomials for different problems. This method is easily implemented for the problems of irregular domain as it is mesh independent. Hosseini et al. in [25, 26] developed radial basis function-based method and meshless local radial point interpolation (MLRPI) method to solve time-fractional telegraph equation, respectively. Shivanian [51] considered a time-fractional telegraph equation using spectral meshless radial point interpolation (SMRPI) method. In [14] a meshless local weak-strong (MLWS) method is derived by Dehghan and Ghesmati to solve a hyperbolic telegraph equation. In [16] a hyperbolic telegraph equation is solved using RBF collocation method by Dehghan and Shokri. The nonlinear time-fractional telegraph equation is solved by Sepehrian and Shamohammadi [50] with collocation method. Mohebbi et al. [38] proposed a RBF-based meshless method to solve time-fractional telegraph equation. Shivanian et al. [56] solved telegraph equation using meshless local radial point interpolation (MLRPI) method. Shivanian et al. [53] considered a time-fractional telegraph equation using meshless local Petrov–Galerkin (MLPG) method in which Galerkin weak form and moving least-squares (MLS) approximation is applied.
This manuscript is organized as follows: Time semi-discretization scheme is described in Sect. 2; furthermore, in this section stability and convergence analysis of the time discrete numerical scheme is also described. In Sect.3, we have briefly discussed the local collocation method and how the proposed method is numerically implemented. We examined some numerical experiments to demonstrate the computational efficiency and accuracy of the proposed method in Sect. 4. In Sect. 5, we end this paper finally, with the help of some concluding remark.
2 The time semi-discretization
In the present section, we will develop and analyze the time semi-discrete scheme of the proposed Eq. (1.1), and the Caputo’s fractional derivative \(_{0}^{c}{\mathscr {D}}_{t}^{\alpha }u({\mathbf{x}},t)\) could be rewritten as follows
If \(1<\alpha <2\), then \(0<\alpha -1<1\), so
For any positive integer N, we let \(\delta t= \frac{T}{N}\), be the step size in time, and \(t_{n}=n \delta t, ~ n \in \mathbb {N^{+}}\) are the temporal discretization points. Now, we define the notation as \(u^{n-\frac{1}{2}}=\frac{1}{2}(u^{n}+u^{n-1})\), and \(\delta _{t}u^{n-\frac{1}{2}}=\frac{1}{\delta t}(u^{n}-u^{n-1})\), together with \(u^{n}\) being the abbreviation of the \(u({\mathbf{x}},t_{n})\).
Lemma 1
Let us suppose \(\eta (t) \in C^{2}[0,T]\) and \(1<\alpha <2\), it holds that
and
Proof
See Sun et al. [58]. \(\square \)
Lemma 2
Let \(1< \alpha < 2\), \(a_{0}=\frac{1}{\delta t \Gamma (2-\alpha )} \) and \(b_{k}=\frac{\delta t^{2-\alpha }}{ (2-\alpha )}\left[ (k+1)^{2-\alpha }-(k)^{2-\alpha }\right] \), then
Proof
Directly follows from Lemma 1. \(\square \)
Lemma 3
Let \(b_{k}=\frac{\delta t^{2-\alpha }}{ (2-\alpha )}\left[ (k+1)^{2-\alpha }-(k)^{2-\alpha }\right] \), where \(1< \alpha < 2\), \(k=0,1,2,\ldots \), then
Proof
See Sun et al. [58]. \(\square \)
For convention of the theory let us define,
Now applying Taylor expansion on (2.6), we have
and the numerical scheme is
where \(r_{1}^{n-\frac{1}{2}}\) and \(r_{2}^{n-\frac{1}{2}}\) are the local truncation errors which is bounded by
Discretizing Eqs. (2.7) and (2.8), we have
using Lemma 2, we have
Now define the operator [58]
and using both the initial condition \(v^{0}=v({\mathbf{x}},0)=\psi \) and \(u^{0}=u({\mathbf{x}},0)=\xi, \) we have
where
Now substituting (2.9) into (2.15), we have
now substituting (2.15) and above expression in (2.10), we have
where
where \(C=\left\{ \left[ { \frac{2C_{1}}{(2-\alpha )\Gamma (2-\alpha )}+C_{3}+C_{4}}\right] + C_{2} \right\} \). Now omitting the truncation error term \(R^{n-\frac{1}{2}}\) from Eq. (2.18), with exact value \(u{^{n}}\) is approximated by its numerical approximation \(U{^{n}}\), The resulted numerical scheme is as follows:
The above equation can be written in more precise form as
where \({\mathcal {L}}\) and F are given as:
2.1 Convergence and stability analysis
This section devoted to discuss the stability of the time semi-discrete scheme and also to prove that the time discrete scheme is convergent with convergence order \(\delta t^{3-\alpha }\) in \(\mathrm {L}_{2}\) norm.
Lemma 4
For any function \(\eta =\{\eta _{1},\eta _{2},\ldots \}\), \(\theta \) with \(1<\alpha <2\), we have
Proof
See [58]. \(\square \)
As the considered problem (1.1) is linear, it is sufficient to do analysis for homogeneous boundary conditions, i.e., \(\zeta ({\mathbf{x}},t)=0\).
Theorem 1
Let \(U^{n} \in H _{0}^{1}\), the time discrete scheme (2.19) is unconditionally stable and we have the following inequality:
Proof
Multiplying Eq. (2.19) by \((\delta _{t}U^{n-\frac{1}{2}}+U^{n-\frac{1}{2}})\) and integrating over \(\Omega \) give
where \(\left( \cdot ,\cdot \right) \) is used for inner product. Now we are using the following fact
and
we have
now taking the summation from \(n=1\) to \(n=m\) on both sides of the above inequality, we have
Also using inequality \(|xy| \le \frac{1}{2 \theta } x^{2}+ \frac{\theta }{2}y^{2}\), together with \(\theta = \frac{t_{m}^{1-\alpha }}{\Gamma (2-\alpha )}\), we get
Now using above relation together with Lemma 4, we have
Now simplifying above relation and switching index from m to n, we have
where \(\psi =U_{t}^{0}\) and \(\xi =U^{0}\). Therefore, we have
where \(C=\left( 1+\frac{T^{2-\alpha }}{\Gamma (3-\alpha )}+T^{\alpha }\Gamma (2-\alpha )\right) .\) \(\square \)
Theorem 2
Let \(u^{n}\) and \(U^{n}\) both belonging to \(H^{1}\) be the analytical and numerical solution of (2.18) and (2.19), respectively, then time semi-discrete scheme defined by (2.19) have \({\mathcal {O}}(\delta t^{3-\alpha })\) convergence order .
Proof
Let us define \({\mathcal {E}}^{n}=u^{n}-U^{n}\) with \(n \ge 1\), and also \({\mathcal {E}}^{0}=0\). From Eqs. (2.18) and (2.19), we get
Multiplying the above equation by \((\delta _{t}{\mathcal {E}}^{n-\frac{1}{2}}+{\mathcal {E}}^{n-\frac{1}{2}})\), and integrating over \(\Omega \), gives
Now summing the above relation from \(n=1\) to m, we have
Now application of Lemma 4 yields
Using inequality \(|xy| \le \frac{1}{2 \theta } x^{2}+ \frac{\theta }{2}y^{2}\), together with \(\theta = \frac{t_{m}^{1-\alpha }}{\Gamma (2-\alpha )}\), we have
Using the above relation into Eq. (2.27), we have
Multiplying both sides of the above inequality by \(2 \delta t\) and switching index from m to n, with some calculation we get
Therefore, we have
where \(C^{*}=\sqrt{T^{2}\Gamma (2-\alpha )C^{2}}\), which completes the proof. \(\square \)
3 The local collocation method for Spatial discretization
The local collocation method has been developed by taking the global domain \(\Omega \) that contains the M discretization points. For each discretization point \({\mathbf{x}}_{i}\), \(i=1,2,\ldots ,M\), there is a local sub-domain \(\Omega _{i}=\) \(\{{\mathbf{x}}_{j}\}_{j=1}^{m_{i}}\), where \(m_{i}\) are the closest points of the discretized point \({\mathbf{x}}_{i}\) in sub-domain \(\Omega _{i}\). In the local interpolation form, the \(u({\mathbf{x}},t_{n})\) can be numerically approximated as
where \(\{\lambda _{j}\}\) and \(\{\gamma _{j}\}\) are coefficients at nth time level that need to be determined, \(\phi \) is any considered radial basis function, considered norm is defined in Euclidean sense and \(\{p_{j}(x)\}_{j=1}^{l}\) is the basis of the l-dimensional polynomial space of total degree \(\le m-1\). The application of the interpolation condition on each sub-domain \(\Omega _{i}\) give us
with l homogeneous conditions
Equations (3.2–3.3) can be written in the matrix form as
where \(\Phi :=[\phi \Vert {\mathbf{x}}_{j}-{\mathbf{x}}_{k}\Vert ]_{1\le j,k \le m_{i}}\), \(P:= [p_{k}({\mathbf{x}}_{j})]_{1\le j \le m_{i}, 1 \le k \le l}\). The system (3.4) can be rewritten as
where \(\Lambda _{\Omega _{i}}=[\lambda _{1},\ldots ,\lambda _{m_{i}},\gamma _{1},\ldots ,\gamma _{l}]^{\intercal }\), \(U_{\Omega _{i}}^{n}=[u({\mathbf{x}}_{1},t_{n}),\ldots ,u({\mathbf{x}}_{m_{i}},t_{n}),0,\ldots ,0]^{\intercal }\), and \(A_{\Omega _{i}}\) is coefficient matrix defined in (3.4). At each stencil \({\mathbf{x}}_{i} \in {\Omega _{i}}\), we have approximation for \({\mathscr {D}}u({\mathbf{x}},t_{n})\) as;
where \(\Psi _{\Omega _{i}}=[ \phi (\Vert {\mathbf{x}}_{i}-{\mathbf{x}}_{1}\Vert ),\ldots , \phi (\Vert {\mathbf{x}}_{i}-{\mathbf{x}}_{m_{i}}\Vert ), p_{1}({\mathbf{x}}_{i}), \ldots p_{l}({\mathbf{x}}_{i})]\). For each i, the local operator \({\mathscr {D}}\Psi _{\Omega _{i}} A_{\Omega _{i}}^{-1}\) is a 1 \(\times \) \(m_{i}\) row vector. For the application of the local collocation method as defined in (3.6), for each collocation point \({\mathbf{x}}_{i} \in \Omega \), to the linear operator \({\mathscr {L}}\) as defined in Eq. (2.20), we have
For each row we have only \(m_{i}\) nonzero entry that will be stored in \(M^{2}\) global coefficient matrix, and extra spaces will be filled by zeros. Then, we get the following linear system
The resulting system is sparse because in each row we have only \(m_{i}\) nonzero entries that can be calculated very efficiently and easily.
4 Numerical simulation and discussion
In this section, we present some numerical results for confirmation of the validity and efficiency of the present numerical method. To measure the accuracy of the method, we used maximum absolute error \(L_{\infty }\) and root mean square error \(L_\mathrm{rms}\) which are defined by using the definition
where M denotes the number of collocation points and \(u(x_{i},T)\) and \(U(x_{i},T)\) represent an exact and numerical solution of the considered problem. We calculated the convergence rate of the proposed method by using the formula \(\frac{\log (E_{1}/E_{2})}{\log (\delta t_{1}/\delta t_{2})}\) where \(E_{1}\) and \(E_{2}\) are errors corresponding to temporal mesh size \(\delta t_{1}\) and \(\delta t_{2}\), respectively. To avoid the effect of the shape parameter \(\epsilon \) over the numerical solution, the thin plate spline \(r^{4}\ln (r)\) RBF is used for computation purpose. In all sub-domain, the number of collocation points is constant.
Example 1
Consider the following one-dimensional test problem
The initial conditions and boundary conditions are calculated using analytic solution
The linear source term read \(f(x,t)=\left( \frac{6t^{3-\alpha }}{\Gamma (4-\alpha )}+\frac{6t^{4-\alpha }}{\Gamma (5-\alpha )}\right) ({\sin {x}})^{2} -2t^{3}\cos {2x}+t^{3}({\sin {x}})^{2}\).
Considered problem is solved with the present method for different values of \(\alpha \) and \(\delta t\) on computational domain [0, 1]. The values of the root mean square error and absolute error for \(M=501\) spatial points, \(m=3\) at \(T=1\)s are reported in Table 1. From the data given in Table 1, we can easily observe that the numerical rate has a good agreement with theoretical rate of convergence, i.e., \(O(\delta t^{3-\alpha })\). The graph of numerical solution and absolute error in the numerical solution for \(\alpha =1.5\) and \(N=640\) is plotted in Fig. 1.
The values of different errors for \(M=1000\), \(N=1000\), \(\alpha =1.9\) and different values of local points m at \(T=1\) s are reported in Table 2. From the table, we observed that in most cases the improvement in the error is very small with respect to a increase in the number of local collocation points, while the computational time increases as m gets larger.
Example 2
Now consider the following one-dimensional test problem
The linear source term f(x, t) along with initial conditions and boundary conditions is calculated using analytic solution
It is not easy to find out the linear source term explicitly. Therefore, we used MATLAB symbolic calculation procedure for the same. We adopted this test problem from Hosseini et al. [25]; they solved the considered problem using RBF-based collocation method on the computational domain [0, 1]. The proposed method is compared with Hosseini et al. [25] at \(T=1.0\) s, and the results are given in Table 3. From Table 3, we can see that the present method gives better accuracy than [25]. Finally, the graph of numerical approximation and absolute error for \(\alpha =1.5\), \(M=201\) spatial points, \(m=3\) local points and \(N=200\) is reported in Fig.2.
Example 3
In this example, we consider two-dimensional test problem
The initial conditions and boundary conditions are calculated using analytic solution
The linear source term read \(f(x,t)=\left( \frac{24t^{4-\alpha }}{\Gamma (5-\alpha )}+\frac{24t^{5-\alpha }}{\Gamma (6-\alpha )}+2t^{4}\pi ^{2}\right) \sin ({\pi x}+{\pi y})+t^{4}{\sin ({\pi x}+{\pi y})}\).
In this example, we consider a rectangular domain \(\Omega =[0,1]\times [0,1]\) with 2025 uniform points and 2060 non-uniform points as shown in Fig. 3. The computational errors with \(m=5\) uniform and non-uniform points in local domain at \(T=1.0\) s are listed in Table 4 and Table 5, respectively. This table ensures that the computational convergence order is close to the theoretical convergence order. The behavior of the numerical solution and absolute error for \(\alpha =1.5\) and \(N=160\) is plotted in Fig. 4 for uniform points and in Fig. 5 for non-uniform points.
Example 4
Finally, we consider the two-dimensional test problem
The initial conditions and boundary conditions are calculated using analytic solution
The linear source term read \(f(x,t)= \frac{24t^{4-\alpha }}{\Gamma (5-\alpha )}+\frac{24t^{5-\alpha }}{\Gamma (6-\alpha )}+(x^{2}+y^{2}+t^{4})-4\).
In this test problem, we consider four different complex-shape computational domains \(\Omega _{i}\), \( = 1,2,3,4\) as shown in Fig. 6. The first one is circular domain as shown in the first part of Fig. 6 with center (0.5, 0.5) and radius \(r=0.5\). Table 6 shows errors on circular domain with \(M=2395\) spatial points, \(m=5\) at \(T=1.0\) s. Finally, Fig. 7 shows graph of numerical solution and also the graph of absolute error for \(\alpha =1.75\) and \(N=400\). After that, we consider irregular polar domain with uniform points as shown in the second part of Fig. 6 whose boundary is given by parametric equation \(\{(r \cos \theta ,r \sin \theta ): r=\frac{n+1}{3n^2}[n+1-\cos n \theta ]\}\) with \(n=6\). The value of errors corresponding to \(L^\infty \) and RMS are listed in Table 7 with \(M=1982\) spatial points on irregular polar domain at \(T=1.0\) s. Figure 8 represents the graph of numerical approximation and also the graph of absolute error for \(\alpha =1.85\) and \(N=400\).
Next, in this test problem we consider a multi-connected domain which is designed by two circles which are non-concentric as shown in the third part of Fig. 6. The center and radius of internal circle and external circle are (0.7, 0.6), \(r=0.1\) and (0.5, 0.5), \(r=0.5\), respectively. We used Dirichlet boundary conditions for both the inner and outer circles. The errors are computed with \(M=1590\) spatial points at \(T=1.0\) s and reported in Table 8. From Table 8, we can easily see that the present method is very efficient and accurate. Finally, the graph of numerical solution and also the graph of absolute error on multi-connected domain for \(\alpha =1.95\) and \(N=1600\) are plotted in Fig. 9. Lastly, we consider irregular shape domain with boundary \(\{r(\theta ) = 0.4+0.05(\sin 6\theta +\sin 3 \theta )\}\) and \(M=1645\) Halton non-uniform points as shown in the fourth part of Fig. 6. The numerical results on these non-uniform Halton points at \(T=1.0\) s are given in Table 9. The graph of numerical approximation and absolute error on domain \(\Omega _{4}\) for \(N=400\) and \(\alpha =1.55\) is given in Fig. 10.
5 Conclusion
In the present work, we have developed a local meshless method based on RBF for solving the time-fractional telegraph equation with the fractional derivative as defined in the Caputo sense. The time semi-discretization was done by finite difference method to obtain the semi-discrete scheme, and spatial discretization was done by RBF-based meshless method to obtain a fully discrete scheme. With the help of numerical examples, we shows that the computational convergence order in time is nicely close to theoretical order. To examine the efficiency of the proposed method, being suitable for irregular domain a numerical experiment on several complex domain was carried out. It was found that the method is robust and very pleasant to deal with regular as well as irregular domains.
References
Abbaszadeh M, Dehghan M (2017) An improved meshless method for solving two-dimensional distributed order time-fractional diffusion-wave equation with error estimate. Numer Algorithms 75(1):173–211
Bagley RL, Torvik PJ (1983) A theoretical basis for the application of fractional calculus to viscoelasticity. J Rheol 27(3):201–210
Banasiak J, Mika JR (1998) Singularly perturbed telegraph equations with applications in the random walk theory. Int J Stoch Anal 11(1):9–28
Cen Z, Huang J, Aimin X, Le A (2018) Numerical approximation of a time-fractional Black-Scholes equation. Comput Math Appl 75(8):2874–2887
Chen J, Liu F, Anh V (2008) Analytical solution for the time-fractional telegraph equation by the method of separating variables. J Math Anal Appl 338(2):1364–1377
Chen W, Ye L, Sun H (2010) Fractional diffusion equations by the Kansa method. Comput Math Appl 59(5):1614–1620
Das S, Vishal K, Gupta PK, Yildirim A (2011) An approximate analytical solution of time-fractional telegraph equation. Appl Math Comput 217(18):7405–7411
De Staelen RH, Hendy AS (2017) Numerically pricing double barrier options in a time-fractional black–scholes model. Comput Math Appl 74(6):1166–1175
Dehghan M, Abbaszadeh M (2017) A finite element method for the numerical solution of Rayleigh-Stokes problem for a heated generalized second grade fluid with fractional derivatives. Eng Comput 33(3):587–605
Dehghan M, Abbaszadeh M (2018) A finite difference/finite element technique with error estimate for space fractional tempered diffusion-wave equation. Comput Math Appl 75(8):2903–2914
Dehghan M, Abbaszadeh M, Mohebbi A (2015) Error estimate for the numerical solution of fractional reaction-subdiffusion process based on a meshless method. J Comput Appl Math 280:14–36
Dehghan M, Abbaszadeh M, Mohebbi A (2015) An implicit rbf meshless approach for solving the time fractional nonlinear sine-gordon and klein-gordon equations. Eng Anal Bound Elem 50:412–434
Dehghan M, Abbaszadeh M, Mohebbi A (2016) Analysis of a meshless method for the time fractional diffusion-wave equation. Numer Algorithms 73(2):445–476
Dehghan M, Ghesmati A (2010) Combination of meshless local weak and strong (mlws) forms to solve the two dimensional hyperbolic telegraph equation. Eng Anal Bound Elem 34(4):324–336
Dehghan M, Mohammadi V (2015) The numerical solution of cahn-hilliard (ch) equation in one, two and three-dimensions via globally radial basis functions (grbfs) and rbfs-differential quadrature (rbfs-dq) methods. Eng Anal Bound Elem 51:74–100
Dehghan M, Shokri A (2008) A numerical method for solving the hyperbolic telegraph equation. Numer Methods Part Differ Equ Int J 24(4):1080–1093
Dehghan M, Yousefi SA, Lotfi A (2011) The use of he’s variational iteration method for solving the telegraph and fractional telegraph equations. Int J Numer Methods Biomed Eng 27(2):219–231
Esen A, Bulut F, Oruç Ö (2016) A unified approach for the numerical solution of time fractional burgers’ type equations. Eur Phys J Plus 131(4):116
Ghandehari MAM, Ranjbar M (2013) A numerical method for solving a fractional partial differential equation through converting it into an nlp problem. Comput Math Appl 65(7):975–982
Ghehsareh HR, Bateni SH, Zaghian A (2015) A meshfree method based on the radial basis functions for solution of two-dimensional fractional evolution equation. Eng Anal Bound Elem 61:52–60
Ghehsareh HR, Raei M, Zaghian A (2019) Application of meshless local petrov–galerkin technique to simulate two-dimensional time-fractional tricomi-type problem. J Braz Soc Mech Sci Eng 41(6):252
Ghehsareh HR, Zaghian A, Raei M (2018) A local weak form meshless method to simulate a variable order time-fractional mobile–immobile transport model. Eng Anal Bound Elem 90:63–75
Ghehsareh HR, Zaghian A, Zabetzadeh SM (2019) An efficient meshless computational technique to simulate nonlinear anomalous reaction-diffusion process in two-dimensional space. Nonlinear Dyn 96(2):1191–1211
Gorenflo R, Mainardi F, Scalas E, Raberto M (2001) Fractional calculus and continuous-time finance iii: the diffusion limit. In: Kohlmann M, Tang S (eds) Mathematical finance. Springer, Berlin, pp 171–180
Hosseini VR, Chen W, Avazzadeh Z (2014) Numerical solution of fractional telegraph equation by using radial basis functions. Eng Analy Bound Elem 38:31–39
Hosseini VR, Shivanian E, Chen W (2015) Local integration of 2-d fractional telegraph equation via local radial point interpolant approximation. Eur Phys J Plus 130(2):33
Hosseini VR, Shivanian E, Chen W (2016) Local radial point interpolation (mlrpi) method for solving time fractional diffusion-wave equation with damping. J Comput Phys 312:307–332
Jiang W, Lin Y (2011) Representation of exact solution for the time-fractional telegraph equation in the reproducing kernel space. Commun Nonlinear Sci Numer Simul 16(9):3639–3645
Kumar A, Bhardwaj A (2020) A local meshless method for time fractional nonlinear diffusion wave equation. Numer Algorithms. https://doi.org/10.1007/s11075-019-00866-9
Kumar A, Bhardwaj A, Kumar BVR (2019) A meshless local collocation method for time fractional diffusion wave equation. Comput Math Appl 78(6):1851–1861
Kumar K, Pandey RK, Sharma S, Xu Y (2019) Numerical scheme with convergence for a generalized time-fractional telegraph-type equation. Numer Methods Part Differ Equ 35(3):1164–1183
Li C, Cao J (2012) A finite difference method for time-fractional telegraph equation. In: Mechatronics and Embedded Systems and Applications (MESA), 2012 IEEE/ASME International Conference on, pp 314–318. IEEE, 2012
Liang Y, Yao Z, Wang Z (2020) Fast high order difference schemes for the time fractional telegraph equation. Numer Methods Part Differ Equ 36(1):154–172
Liu J, Li X, Xiuling H (2019) A rbf-based differential quadrature method for solving two-dimensional variable-order time fractional advection-diffusion equation. J Comput Phys 384:222–238
Liu Q, Liu F, Turner I, Anh V, Gu YT (2014) A rbf meshless approach for modeling a fractal mobile/immobile transport model. Appl Math Comput 226:336–347
Mainardi F, Paradisi P (2001) Fractional diffusive waves. J Comput Acoust 9(04):1417–1436
Mittal RC, Bhatia R (2014) A numerical study of two dimensional hyperbolic telegraph equation by modified b-spline differential quadrature method. Appl Math Comput 244:976–997
Mohebbi A, Abbaszadeh M, Dehghan M (2014) The meshless method of radial basis functions for the numerical solution of time fractional telegraph equation. Int J Numer Methods Heat Fluid Flow 24(8):1636–1659
Momani S (2005) Analytic and approximate solutions of the space-and time-fractional telegraph equations. Appl Math Comput 170(2):1126–1134
Nikan O, Machado JAT, Golbabai A, Nikazad T (2019) Numerical investigation of the nonlinear modified anomalous diffusion process. Nonlinear Dyn 97(4):2757–2775
Oruç Ö (2018) A numerical procedure based on hermite wavelets for two-dimensional hyperbolic telegraph equation. Eng Comput 34(4):741–755
Oruç Ömer (2019) A meshfree computational approach based on multiple-scale pascal polynomials for numerical solution of a 2d elliptic problem with nonlocal boundary conditions. In: International journal of computational methods, p 1950080, 2019
Oruç Ö (2019) A meshless multiple-scale polynomial method for numerical solution of 3d convection–diffusion problems with variable coefficients. Eng Comput. https://doi.org/10.1007/s00366-019-00758-5
Oruç Ö (2019) Numerical solution to the deflection of thin plates using the two-dimensional Berger equation with a meshless method based on multiple-scale pascal polynomials. Appl Math Modell 74:441–456
Oruç Ö (2020) Two meshless methods based on local radial basis function and barycentric rational interpolation for solving 2D viscoelastic wave equation. Comput Math Appl. https://doi.org/10.1016/j.camwa.2020.01.025
Oruç Ö, Esen A, Bulut F (2019) A haar wavelet approximation for two-dimensional time fractional reaction-subdiffusion equation. Eng Comput 35(1):75–86
Ren J, Sun Z-Z, Zhao X (2013) Compact difference scheme for the fractional sub-diffusion equation with Neumann boundary conditions. J Comput Phys 232(1):456–467
Rudolf H (2000) Applications of fractional calculus in physics. World Scientific, Singapore
Salehi R (2017) A meshless point collocation method for 2-d multi-term time fractional diffusion-wave equation. Numer Algorithms 74(4):1145–1168
Sepehrian B, Shamohammadi Z (2018) Numerical solution of nonlinear time-fractional telegraph equation by radial basis function collocation method. Iranian J Sci Technol Trans A Sci 42(4):2091–2104
Shivanian E (2016) Spectral meshless radial point interpolation (smrpi) method to two-dimensional fractional telegraph equation. Math Methods Appl Sci 39(7):1820–1835
Shivanian E (2017) Analysis of the time fractional 2-d diffusion-wave equation via moving least square (mls) approximation. Int J Appl Comput Math 3(3):2447–2466
Shivanian E, Abbasbandy S, Alhuthali MS, Alsulami HH (2015) Local integration of 2-d fractional telegraph equation via moving least squares approximation. Eng Anal Bound Elem 56:98–105
Shivanian E, Jafarabadi A (2017) An improved spectral meshless radial point interpolation for a class of time-dependent fractional integral equations: 2d fractional evolution equation. J Comput Appl Math 325:18–33
Shivanian E, Jafarabadi A (2018) Capillary formation in tumor angiogenesis through meshless weak and strong local radial point interpolation. Eng Comput 34(3):603–619
Shivanian E, Khodabandehlo HR (2014) Meshless local radial point interpolation (mlrpi) on the telegraph equation with purely integral conditions. Eur Phys J Plus 129(11):241
HongGuang Sun, Zhang Y, Baleanu D, Chen W, Chen Y (2018) A new collection of real world applications of fractional calculus in science and engineering. Commun Nonlinear Sci Numer Simul 64:213–231
Sun Z, Xiaonan W (2006) A fully discrete difference scheme for a diffusion-wave system. Appl Numer Math 56(2):193–209
Vyawahare VA, Nataraj PSV (2013) Fractional-order modeling of neutron transport in a nuclear reactor. Appl Math Modell 37(23):9747–9767
Wang Y, Mei L (2017) Generalized finite difference/spectral galerkin approximations for the time-fractional telegraph equation. Adv Differ Equ 2017(1):281
Yıldırım A (2010) He’s homotopy perturbation method for solving the space-and time-fractional telegraph equations. Int J Comput Math 87(13):2998–3006
Zhang Y, Sun Z, Zhao X (2012) Compact alternating direction implicit scheme for the two-dimensional fractional diffusion-wave equation. SIAM J Numer Anal 50(3):1535–1555
Zhao Z, Li C (2012) Fractional difference/finite element approximations for the time-space fractional telegraph equation. Appl Math Comput 219(6):2975–2988
Zhou F, Xiaoyong X (2017) Numerical solution of time-fractional diffusion-wave equations via Chebyshev wavelets collocation method. Adv Math Phys 2017:2610804
Acknowledgements
We would like to thank reviewers for their valuable comments and suggestions that really improved the quality of the paper.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there is no conflict of interests regarding the publication of this article.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kumar, A., Bhardwaj, A. & Dubey, S. A local meshless method to approximate the time-fractional telegraph equation. Engineering with Computers 37, 3473–3488 (2021). https://doi.org/10.1007/s00366-020-01006-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00366-020-01006-x