Research article Special Issues

An approach based on the pseudospectral method for fractional telegraph equations

  • We aim to implement the pseudospectral method on fractional Telegraph equation. To implement this method, Chebyshev cardinal functions (CCFs) are considered bases. Introducing a matrix representation of the Caputo fractional derivative (CFD) via an indirect method and applying it via the pseudospectral method helps to reduce the desired problem to a system of algebraic equations. The proposed method is an effective and accurate numerical method such that its implementation is easy. Some examples are provided to confirm convergence analysis, effectiveness and accuracy.

    Citation: Haifa Bin Jebreen, Beatriz Hernández-Jiménez. An approach based on the pseudospectral method for fractional telegraph equations[J]. AIMS Mathematics, 2023, 8(12): 29221-29238. doi: 10.3934/math.20231496

    Related Papers:

    [1] Haifa Bin Jebreen, Beatriz Hernández-Jiménez . Pseudospectral method for fourth-order fractional Sturm-Liouville problems. AIMS Mathematics, 2024, 9(9): 26077-26091. doi: 10.3934/math.20241274
    [2] A. K. Mittal, L. K. Balyan . Chebyshev pseudospectral approximation of two dimensional fractional Schrodinger equation on a convex and rectangular domain. AIMS Mathematics, 2020, 5(3): 1642-1662. doi: 10.3934/math.2020111
    [3] Haifa Bin Jebreen, Hongzhou Wang . On the effective method for the space-fractional advection-diffusion equation by the Galerkin method. AIMS Mathematics, 2024, 9(9): 24143-24162. doi: 10.3934/math.20241173
    [4] M. Mossa Al-Sawalha, Azzh Saad Alshehry, Kamsing Nonlaopon, Rasool Shah, Osama Y. Ababneh . Fractional view analysis of delay differential equations via numerical method. AIMS Mathematics, 2022, 7(12): 20510-20523. doi: 10.3934/math.20221123
    [5] Dina Abdelhamid, Wedad Albalawi, Kottakkaran Sooppy Nisar, A. Abdel-Aty, Suliman Alsaeed, M. Abdelhakem . Mixed Chebyshev and Legendre polynomials differentiation matrices for solving initial-boundary value problems. AIMS Mathematics, 2023, 8(10): 24609-24631. doi: 10.3934/math.20231255
    [6] Haifa Bin Jebreen, Yurilev Chalco Cano, Ioannis Dassios . An efficient algorithm based on the multi-wavelet Galerkin method for telegraph equation. AIMS Mathematics, 2021, 6(2): 1296-1308. doi: 10.3934/math.2021080
    [7] S. Mohammadian, Y. Mahmoudi, F. D. Saei . Solution of fractional telegraph equation with Riesz space-fractional derivative. AIMS Mathematics, 2019, 4(6): 1664-1683. doi: 10.3934/math.2019.6.1664
    [8] Shazia Sadiq, Mujeeb ur Rehman . Solution of fractional boundary value problems by ψ-shifted operational matrices. AIMS Mathematics, 2022, 7(4): 6669-6693. doi: 10.3934/math.2022372
    [9] Waleed Mohamed Abd-Elhameed, Youssri Hassan Youssri . Spectral tau solution of the linearized time-fractional KdV-Type equations. AIMS Mathematics, 2022, 7(8): 15138-15158. doi: 10.3934/math.2022830
    [10] Sunyoung Bu . A collocation methods based on the quadratic quadrature technique for fractional differential equations. AIMS Mathematics, 2022, 7(1): 804-820. doi: 10.3934/math.2022048
  • We aim to implement the pseudospectral method on fractional Telegraph equation. To implement this method, Chebyshev cardinal functions (CCFs) are considered bases. Introducing a matrix representation of the Caputo fractional derivative (CFD) via an indirect method and applying it via the pseudospectral method helps to reduce the desired problem to a system of algebraic equations. The proposed method is an effective and accurate numerical method such that its implementation is easy. Some examples are provided to confirm convergence analysis, effectiveness and accuracy.



    The objective of this project is to employ the pseudospectral approach to approximate the solution of the fractional Telegraph equation

    ηw(x,t)tη+s1η1w(x,t)tη1+s2w(x,t)=s32w(x,t)x2+q(x,t), (1.1)

    subjected to boundary and initial conditions

    w(0,t)=f0(t),w(1,t)=f1(t),t[0,1], (1.2)
    w(x,0)=p0(x),w(x,1)=p1(x),x[0,1]. (1.3)

    Here, s1, s2 and s3 are constants, and q(x,t) is a known function. The fractional derivative is of the CFD type, so we will introduce it later.

    As it is widely acknowledged, partial differential equations (PDEs) play a significant role in the simulation of multitudinous physical phenomena. Among them, the Telegraph equation, due to its application in modeling several phenomena such as electrical phenomena, signal processing and wave propagation, has been the focus of researchers. For this reason, solving it can be a fascinating challenge and attract the focus of scientists. Several methods are devoted to solving this equation. Interpolating scaling functions are applied to solve the problem via the collocation method [1]. Yang et al. [2] used orthogonal spline collocation method to solve the sub-diffusion equation. In [3], the authors proposed the collocation method for the desired equation using Chebyshev cardinal functions. Dehghan et al. [4] proposed a collocation method based on splines radial basis function. In [5], authors applied meshfree collocation method to solve Telegraph equation. The numerical results raised of the collocation method, taking the B-spline functions, are investigated in [6]. We list several numerical methods proposed to solve this equation, including shifted Jacobi collocation [7], multi-wavelet Galerkin method [8], Tchebyshev-Galerkin method [9], tau method [10] and so on.

    In recent years, fractional calculations in modeling various physical phenomena have attracted the attention of engineers and specialists. Moreover, many types of equations with fractional derivatives have been considered, and many numerical schemes have been introduced to solve them, including the implementation of the Galerkin method for the fractional Riccati equation where biorthogonal Hermite cubic Spline is considered [11]. The application of the Tau method for a solution of space-time fractional PDEs has been considered based on interpolating scaling functions [12]. The multiwavelet method for solving the Cauchy-type problem is considered in [13]. In [14], the authors introduced the hybrid clique functions and applied them via the collocation method for fractional Schrödinger equation. A predictor-corrector compact difference scheme for a nonlinear fractional differential equation is applied in [15]. A nonlinear finite volume method is used to solve multi-term fractional sub-diffusion equation on polygonal meshes [16]. Zhang et al. [17] utilized collocation method based on Spline functions to solve the nonlinear fourth-order reaction sub-diffusion equation. In [18], the authors used the collocation method based on cubic B-spline functions to solve the time-fractional cable model. In [19], the authors applied a novel numerical technique to solve the time fractional reaction-diffusion model with a non-singular kernel, etc.

    Among fractional PDEs, the fractional Telegraph equation, due to its application, has been considered as a challenging problem by many scientists. Hosseini et al. [20] applied a hybrid method based on finite differences and radial basis functions to solve the Eq (1.1). In [21], the spectral Galerkin method based on Legendre polynomials is studied for solving the problem. Mollahasani et al. [22] utilized a hybrid function scheme based on Block-Pulse-Functions and Legendre polynomials for solving (1.1). There is another form of time-fractional Telegraph equation

    2ηw(x,t)tη+s1ηw(x,t)tη=s22w(x,t)x2+q(x,t), (1.4)

    along with the initial conditions

    w(x,0)=p0(x),w(x,1)=p1(x),x[0,1], (1.5)

    and boundary conditions

    w(1,t)+a2wx(1,t)=f1(t),w(0,t)+a1wx(0,t)=f0(t),t[0,1]. (1.6)

    For solving this equation, Saadatmandi et al. [23] used the Legendre polynomials and Tau method. In [24], the separable variable method is considered such as an analytical method to solve Eq (1.4). In [25], the authors solved (1.4) via the bireproducing kernel theorem. Akram et al. [19] used modified extended cubic B-spline functions to solve the Non-Linear Time-Fractional Telegraph Equation. The 2D time-fractional Telegraph equation is solved using modified fractional group iterative scheme [26].

    The Chebyshev cardinal functions are applied as attractive bases for solving various kinds of equations. Owing to their abilities, they can be used in the pseudospectral and Galerkin methods. Recently, Shahriari et al. [27] studied the fractional Dirac problem using these bases. These bases are applied for solving the fractional Sturm-Liouville problem in [28]. Bin Jebreen et al. solved a family of time-fractional partial differential equation by these bases.

    In this paper, for the first time, the Hyperbolic fractional Telegraph equation is solved using Cardinal Chebyshev functions. As you know, existing fractional derivatives and the nature of the hyperbolic partial differential equations are two factors that cause problems in the numerical solution. To overcome these issues, we apply the pseudospectral method based on Chebyshev cardinal functions. In this study, a matrix representation of the Caputo fractional derivative is introduced via an indirect method (using the relation between the Caputo fractional derivative and fractional integration) which plays a key role in our algorithm. An analysis of convergence is investigated to show the effectiveness and efficiency of the method.}

    The paper is organized as follows. The CCFs along with their properties are briefly described in Section 2. In Section 3, the pseudospectral method implements for approximating the solution of the problem. In this section, also, convergence analysis is investigated for the presented method. Some numerical examples are considered to give an affirmation of the method's efficiency.

    Consider the Chebyshev nodes as a set of numbers

    Y:={yj:Tn+1(yj)=0,jΩ},Ω:={1,2,,n+1},

    in which Tn+1 is Tchebyshev polynomial of order n+1, n is a positive integer number, and {yj}jΩ are the roots of Tn+1 on [1,1]. As we know, the roots of this polynomial are obtained via

    yj:=cos(2j12n+2π),jΩ. (2.1)

    It is so easy to verify that the Tchebyshev polynomials can be shifted on any arbitrary interval using a proper change of variables. The generated polynomials are known as the shifted Chebyshev polynomials, given by

    Tn+1(x):=Tn+1(2(xa)ba1),x[a,b]. (2.2)

    Due to the change of variable y=(2(xa)ba1), the roots of the Chebyshev polynomials are also shifted to interval [a, b] and are given by xj=(yj+1)(ba)2+a.

    The CCFs are the momentous type of cardinal functions that use orthogonal polynomials. These polynomials are defined via

    ψj(x)=Tn+1(x)Tn+1,x(xj)(xxj),jΩ, (2.3)

    in which the subscript x demonstrates differentiation with respect to x (Tn+1,x(xj):=ddxTω+1(x)|x=xj). For simplicity and computational demands, these polynomials can be demonstrated as

    ψj(x)=ρk=1,kjn+1(xxk), (2.4)

    where ρ=22n+1/((ba)n+1Tn+1,x(xj)). These types of functions have significant property so that make them powerful tools for solving differential equations. According to Eq (2.3), It is obvious that

    ψj(xi)=δji={1,j=i,0,ji,iΩ, (2.5)

    where δji determines the Kronecker δ-function. This property is sufficient to demonstrate that any function p(x) can be easily represented as an expansion based on Chebyshev cardinal functions, i.e.,

    p(x)pn(x)=j=1n+1p(xj)ψj(x). (2.6)

    Let D be the derivative operator. Given ωN, the Sobolev space Hω([0,1]) is specified by

    Hω([0,1])={pL2([0,1]):nω,DnpL2([0,1])}.

    This space is equipped with norm

    pHω([0,1])2=k=0ωp(k)L2([0,1])2, (2.7)

    and semi-norm

    |p|Hω,n([0,1])2=k=min{ω,n}np(k)L2([0,1])2. (2.8)

    Lemma 1. [29] Assuming the set of points {xj}jΩ as the shifted Gauss-Chebyshev points, we say that the bound of error for (2.6) can be approximated by

    ppnL2([0,1])C0nω|p|Hω,n([0,1]), (2.9)

    where ωN and C0 is a constant and independent of ω.

    Putting the Chebyshev cardinal functions ψj(x) into an (n+1)-dimensional vector, we introduce the vector function Ψ(x) whose j-th entry is ψj(x).

    Lemma 2. The derivative operator D can be represented by a square matrix D as

    D(Ψ)(x)DΨ(x), (2.10)

    whose entries are given by

    Dj,i=D(ψj)(xi)={l=1lin+11(xixl),j=i,ρl=1li,jn+1(xixl),ji. (2.11)

    Proof. Using (2.6) and (2.10), we can easily verify that the elements of matrix D are computed by

    Dj,i=D(ψj)(xi). (2.12)

    Motivated by (2.4), to derive the entries of matrix D, the following results can be obtained by taking the derivative with respect to the variable x from both sides of (2.4), viz,

    D(ψj)(x)=ρDk=1kjn+1(xxk)=ρl=1ljn+1k=1kj,ln+1(xxk)=l=1ljn+1Tn+1(x)(xxj)(xxl)Tn+1,x(xj)=l=1ljn+11(xxl)ψj(x). (2.13)

    Thus, this gives rise to (2.11) and we have

    D(ψj)(xi)=l=1lin+11(xixl),i=j,D(ψj)(xi)=ρl=1li,jn+1(xixl),ij.

    The matrix D can be considered instead of the derivative from bases in the numerical method. This matrix is used to reduce and simplify the calculations. It is worthwhile to mention that when we utilize the spectral methods, it is no longer a need to find the derivative of the bases. Instead, we can use the matrix D.

    Before introducing a matrix such as the operational matrix Iη for the fractional integral operator I0η of order η>0, let us make some preliminaries about the fractional integral.

    Definition 1. Given ηR+. Assuming the local integrable function p:[0,1]R, the operator of the fractional integral I0η of order η>0 is specified by

    I0η(p)(x):=1Γ(η)0x(xz)η1p(z)dz,x[0,1],pL1[0,1]. (2.14)

    With simple calculations, it can be shown that acting this operator on a power function is also a power function

    I0η(xβ)=Γ(β+1)Γ(β+η+1)xβ+η. (2.15)

    Motivated by [30], the fractional integral can be bounded. To specify this bound, one can refer to the following Lemma.

    Lemma 3. The operator I0η is bounded in Lp([0,1]), i.e.,

    I0η(p)q1Γ(η+1)pq,1q. (2.16)

    Lemma 4. Given ηR+, one can approximate acting the fractional integral operator on Ψ as follows

    I0η(Ψ)(x)IηΨ(x), (2.17)

    in which Iη is a square matrix of order (n+1) whose entries are obtained by

    [Iη]j,i=ρk=0nzj,kΓ(nk+1)Γ(nk+η+1)xink+η. (2.18)

    Proof. It is convenient to verify that

    k=1kin+1(xxk)=k=0nzi,kxnk, (2.19)

    where

    zi,0=1,zi,k=1kl=0kci,lzi,kl, k=1,2,,n, i=1,2,,n+1,

    and

    ci,k=j=1jin+1xjk, k=1,2,,n, i=1,2,,n+1.

    Using the aforementioned changes, Chebyshev cardinal functions can be rewritten as

    ψj(x)=ρk=0nzj,kxnk. (2.20)

    Putting (2.20) back into (2.14) and using Eq (2.15), one can write

    I0ηψj(x)=ρI0η(k=0nzj,kxnk)=ρk=0nzj,kI0η(xηk)=ρk=0nzj,kΓ(nk+1)Γ(nk+η+1)xnk+η.

    This gives rise to reaching the desired result.

    Before introducing the operational matrix Dη for the fractional derivative operator cD0η, it is necessary to state some preliminaries about the CFD. Let ACη([0,1]) is a space of functions such that

    ACη[0,1]={p:[0,1]C,&D(η1)(p)AC[0,1]}.

    Assuming p(x)ACη[0,1], the Caputo fractional derivative, characterized by

    (cD0ηp)(x)=1Γ(κη)0xp(κ)(t)dt(xt)ηκ+1=:I0κηDκ(p)(x), (2.21)

    exists for almost every x[0,1]. As a consequence of this definition, it is convenient to verify that [30]

    (cD0η(x)α1)(x)=Γ(α)Γ(αη)xαη,(α>κ). (2.22)

    Here, our objective is to introduce a square matrix Dη so that it satisfies

    cD0η(Ψ(x))DηΨ(x). (2.23)

    However, to gain the entries of the matrix Dη, we avoid finding them directly in a manner that is proposed for fractional integral. Instead, motivated by (2.21), matrix Iη can be used to obtain Dη, viz

    cD0η(Ψ(x))=I0κηDκ(Ψ(x))I0κη(DκΨ(x))=DκI0κη(Ψ(x))DκIκη(Ψ(x)).

    Consequently, operational matrix Dη obtain by

    Dη:=DκIκη. (2.24)

    Therefore, to obtain the operational matrix for the fractional derivative Dη, it is enough to obtain the operational matrix of the fractional integral of order κη and multiply it by the κ power of the operational matrix of the derivative.

    We emphasize that our objective is to approximate the solution of the Telegraph equation (1.1) by implementing the pseudospectral method. To develop the pseudospectral method for solving (1.1), the process begins by considering the unknown solution as an expansion based on CCFs

    w(x,t)wn(x,t)=i=1n+1j=1n+1Wi,jΨi(x)Ψj(t)=ΨT(x)WΨ(t), (3.1)

    in which W is a square matrix of order n+1 whose elements should be found. Here and throughout the text, the superscript "T" denotes transpose.

    Putting (1.3) back into (1.1) gives rise to

    ηwn(x,t)tη+s1η1wn(x,t)tη1+s2wn(x,t)=s32wn(x,t)x2+q(x,t). (3.2)

    Using operational matrices D and Dη, one can introduce the residual in the approximation as

    r(x,t)=ΨT(x)(WDη+s1WDη1+s2Ws3D2TWQ)Ψ(t), (3.3)

    where Q is an n+1-dimensional matrix and obtain by

    Qi,j=q(xi,xj).

    Let WDη+s1WDη1+s2Ws3D2TW=UW (this is always applicable), then Eq (3.3) may be rewritten as

    r(x,t)=ΨT(x)(UWQ)Ψ(t). (3.4)

    Pick distinct collocation points {xj:jΩ}, the pseudospectral method requires

    r(xi,xj)=0,i,jΩ. (3.5)

    This leads to specifying U as the solution of the linear system

    UW=Q. (3.6)

    To solve this system, we convert U and Q to U~ and Q~, respectively. So we have a new system

    AU~=Q~. (3.7)

    Considering p as a polynomial that interpolates the given sufficiently smooth function q at the points

    qi,j=q(xi,tj),i,j=1,2,,n+1,

    the reminder formula is obtained by [31]

    |q(x,t)p(x,t)|=nxnq(ξ,t)Πi=1n(xxi)n!+ntnq(x,τ)Πj=1n(ttj)n!2nxntnq(ξ,τ)Πi=1n(xxi)Πj=1n(ttj)n!n!,τ,ξ,τ,ξ[0,1]. (3.8)

    Selecting the Chebyshev polynomials zeros as the interpolation nodes, (3.7) can be written as follows

    |q(x,t)p(x,t)|(12)n12n1n!supξ[0,1)|nxnq(ξ,t)|+(12)n12n1n!supτ[0,1)|ntnq(x,τ)|+(12)2n14n1(n!)2supξ,τ[0,1)|2nxntnq(ξ,τ)|Mq(12)m12m1m!(2+(12)m12m1m!), (3.9)

    in which

    Mq=max{supξ[0,1)|nxnq(ξ,t)|,supτ[0,1)|ntnq(x,τ)|,supξ,τ[0,1)|2nxntnq(ξ,τ)|}.

    Given e=wwn, subtracting (3.2) from

    ηwn(x,t)tη+s1η1wn(x,t)tη1+s2wn(x,t)=s32wn(x,t)x2+qn(x,t),

    the global error satisfies

    ηe(x,t)tη+s1η1e(x,t)tη1+s2e(x,t)=s32e(x,t)x2+q(x,t)qn(x,t). (3.10)

    Let the residual corresponding to (3.10) is

    Rn(x,t)=ηe(x,t)tη+s1η1e(x,t)tη1+s2e(x,t)s32e(x,t)x2q(x,t)+qn(x,t). (3.11)

    Motivated by Theorem 2.2 [30], we have

    |ηtηe(x,t)|=|I0κηκtκe(x,t)|1Γ(κη)(κη+1)κtκe(x,t)C,|η1tη1e(x,t)|=|I0κηκ1tκ1e(x,t)|1Γ(κη)(κη+1)κ1tκ1e(x,t)C.

    Substituting these equations into (3.11) and using triangle inequality, we get

    |Rn(x,t)||ηe(x,t)tη|+|s1η1e(x,t)tη1|+|s2e(x,t)|+|s32e(x,t)x2|+|q(x,t)qn(x,t)|1Γ(κη)(κη+1)(κtκe(x,t)C+|s1|κ1tκ1e(x,t)C)+|s2|e(x,t)C+|s3|2e(x,t)x2C+|q(x,t)qn(x,t)|.

    To proceed, using (3.9), it can be found

    |Rn(x,t)|(12)m12m1m!(2+(12)m12m1m!)(Mκwtκ+|s1|Mκ1wtκ1Γ(κη)(κη+1)+|s2|Mw+|s3|M2wx2+Mq). (3.12)

    Putting Cy=(Mκwtκ+|s1|Mκ1wtκ1Γ(κη)(κη+1)+|s2|Mw+|s3|M2wx2+Mq) back into (3.12), we have

    |Rn(x,t)|Cy(12)m12m1m!(2+(12)m12m1m!). (3.13)

    Thus |Rn(x,t)|0 as m.

    To demonstrate the performance of the proposed method, some examples are provided in this section. To illustrate the results and make a global view of the present method and its efficiency, sometimes, the absolute errors

    e=|w(xi,tj)wn(xi,tj)|,i.j=1,,n,

    and L2 error

    L2error=(0101|w(x,t)wn(x,t)|2dxdt)1/2,

    are reported in tables or plotted in figures.

    Example 1. We dedicate the first example to the fractional Telegraph equation as

    ηw(x,t)tη+η1w(x,t)tη1+w(x,t)=π2w(x,t)x2+q(x,t), 1<η2,

    with initial and boundary conditions

    w(0,t)=0, w(1,t)=t3sin2(1), w(x,0)=0, w(x,0)=0,

    in which

    q(x,t)=6t3η(sin2(x))Γ(4η)+6t4η(sin2(x))Γ(5η)+t3(sin2(x))π(2t3(cos2(x))2t3(sin2(x))).

    The exact solution for this equation is given by w(x,t)=t3sin2(x) [20].

    To show the algorithm of the proposed method to solve this example, we describe it step by step here.

    (1) Chose n;

    (2) construct the Chebyshev cardinal functions of order n (refer to (2.3));

    (3) compute the Matrices D, Iη and Dη (refer to Lemma 2, Lemma 4 and (2.24), respectively);

    (4) approximate w(x,t) using wn(x,t) (refer to (1.3));

    (5) put wn(x,t) back into (1.1) (refer to (3.2));

    (6) compute the residual r(x,t) (refer to (3.4));

    (7) obtain the linear system (3.6) using the shifted Chebyshev nodes xj=(yj+1)2 (j=1,,n);

    (8) solve the linear system (3.7).

    For instance, the coefficients' matrix in the obtained linear system for this example, taking η=1.75 and n=3, is equal to

    [0.089310.00.00.333330.00.01.24400.00.00.00.089310.00.00.333330.00.01.24400.00.00.00.089310.00.00.333330.00.01.24400.00.00.00.089310.333331.24400.00.00.00.05.33240.05.52372.76023.38100.05.33240.00.00.00.01.51215.33333.82150.00.00.00.00.00.00.00.00.00.089310.333331.24400.01.24400.00.00.333330.00.00.0893160.00.00.01.24400.00.00.333330.00.00.089316].

    Recall that the CFD of a function w tends to integer derivative as ηκ. To demonstrate this effect, our results illustrated in Figure 1, obviously, demonstrate it. Figure 2 illustrates the effect of parameter n on L2 error and confirm the convergence analysis. As you see, when n increases, the error decreases exponentially. Figure 3 demonstrates the approximate solution and corresponding absolute errors. Absolute error is reported for different values of x and t, taking n=9 and η=1.75, respectively, Table 1. It is worthwhile to mention that the process took a total of 77.390 seconds of CPU time.

    Figure 1.  Approximate solution, taking different η for Example 1.
    Figure 2.  The L2-error obtained by different number of n for Example 1.
    Figure 3.  The plots of approximate and corresponding absolute error, taking n=9 and η=1.75, for Example 1.
    Table 1.  Absolute errors, taking n=9 and η=1.75 for Example 1.
    x t=0.2 t=0.4 t=0.6 t=0.8 t=1
    0.1 2.409e09 1.711e09 1.647e09 1.903e09 6.011e10
    0.3 7.426e09 3.795e09 2.722e09 4.259e09 8.402e09
    0.5 1.107e08 4.569e09 1.723e09 1.055e09 6.911e10
    0.7 1.033e08 4.387e09 1.637e10 3.377e09 1.876e08
    0.9 4.454e09 1.497e09 1.348e09 4.402e10 1.384e08

     | Show Table
    DownLoad: CSV

    Example 2. We devote this example to the fractional Telegraph equation

    ηw(x,t)tη+η1w(x,t)tη1+w(x,t)=2w(x,t)x2+(t22t+2)(xx2)et+2t2et

    with boundary and initial conditions

    w(x,0)=0, w(x,0)=0, w(0,t)=0, w(1,t)=0.

    For this example, the exact solution is given by w(x,t)=(xx2)ett2 [4,21,22].

    The approximate solution at t=0.1, taking different values of η, is plotted in Figure 4. In Table 2, we observe a comparison between the present method and the method proposed in [22]. To demonstrate the accuracy and ability of the present method, the maximum absolute error at different times is tabulated in Table 3. The approximate solution and corresponding absolute errors are illustrated in Figure 5. For more evidence of accuracy, Figure 6 is reported to show the L2 errors with different choices of n for this example.

    Figure 4.  Approximate solution at t=0.1, taking different η for Example 2.
    Table 2.  The comparison between hybrid functions method and the proposed method for Example 2.
    Proposed method [22]
    t n=6 n=10 n=6 n=10
    0.6 5.21×105 3.67×1010 4.43×103 2.19×103
    0.7 4.39×105 2.88×1010 2.67×103 1.45×103
    0.8 2.92×105 1.76×1010 2.14×103 1.62×103
    CPU time 0.156 0.563

     | Show Table
    DownLoad: CSV
    Table 3.  The L2 errors at different times with different choices of n, taking η=2 for Example 2.
    t n=3 n=5 n=7 n=9 n=11
    0.1 9.67e04 9.10e05 9.10e07 2.70e09 5.18e13
    0.3 6.00e03 3.77e04 2.48e06 6.47e09 8.23e13
    0.5 1.06e02 4.20e04 2.84e06 7.29e09 3.27e12
    0.7 1.08e02 2.97e04 2.04e06 5.23e09 8.10e12
    0.9 4.60e03 1.24e04 6.41e07 1.32e09 1.74e11
    CPU time 0.062 0.141 0.187 0.344 0.672

     | Show Table
    DownLoad: CSV
    Figure 5.  The plots of approximate and corresponding error, taking n=8 and η=2, for Example 2.
    Figure 6.  Effect of n on L2 error, taking n=8 and η=2, for Example 2.

    Example 3. We devote this example to the fractional Telegraph equation

    ηw(x,t)tη+η1w(x,t)tη1+w(x,t)=2w(x,t)x2+Γ(α+1)sin(x)+Γ(α+1)tαβsin(x)Γ(α+1β)+2tαsin(x)

    with boundary and initial conditions

    w(x,0)=0, w(x,0)=0, w(0,t)=0, w(1,t)=sin(1)tη.

    For this example, the exact solution is given by w(x,t)=sin(x)tη.

    Table 4 shows the L2-error at different times and different choices of η. In this table, the CPU time is also reported. It is clear that when the parameter n increases, the error decreases. The approximate solution and corresponding absolute errors are illustrated in Figure 7.

    Table 4.  L2-error at different times for Example 3.
    η=1.75 η=1.90
    t n=7 n=10 n=7 n=10
    0.1 1.32×103 7.14×104 4.60×104 2.94×104
    0.3 2.02×103 9.89×104 9.38×104 2.53×104
    0.5 1.44×103 6.75×104 8.78×104 4.35×104
    0.7 4.04×104 1.77×104 5.17×104 2.08×104
    0.9 4.21×104 2.27×104 5.10×104 3.21×104
    CPU time 2.624 5.215 2.765 6.002

     | Show Table
    DownLoad: CSV
    Figure 7.  The plots of approximate and corresponding error, taking n=10 and η=1.75, for Example 3.

    The pseudospectral method based on CCFs can be solved by the fractional Telegraph equation accurately. The presented method is easy to implement, and it solves problems of this type effectively and with appropriate accuracy. The convergence analysis also proves the method is convergent, and numerical examples confirm this investigation. Due to the cardinality property of the bases used, there is no need for integration to find the coefficients in the expansions, and this reduces the computational time and computational cost. For future work, we can use the pseudospectral method directly or apply the finite difference method and collocation method to solve the sophisticated models and the generalization of the method to two and three dimensions [32].

    The authors declare that they have not used Artificial Intelligence (AI) tools in the creation of this article.

    This project was supported by the Researchers Supporting Project number (RSP2023R210), King Saud University, Riyadh, Saudi Arabia.

    The authors declare that they have no conflicts of interest.



    [1] M. Lakestani, B. N. Saray, Numerical solution of Telegraph equation using interpolating scaling functions, Comput. Math. Appl., 60 (2010) 1964–1972. https://doi.org/10.1016/j.camwa.2010.07.030
    [2] X. Yang, H. Zhang, J. Tang, The OSC solver for the fourth-order sub-diffusion equation with weakly singular solutions, Comput. Math. Appl., 82 (2021), 1–12.
    [3] M. Dehghan, M. Lakestani, The use of Chebyshev cardinal functions for solution of the second-order one-dimensional telegraph equation, Numer. Meth. Part. D. E., 25 (2009), 931–938. https://doi.org/10.1002/num.20382 doi: 10.1002/num.20382
    [4] M. Dehghan, A. Shokri, A numerical method for solving the hyperbolic telegraph equation, Numer. Math. Part. D. E., 24 (2008), 1080–1093. https://doi.org/10.1002/num.20306 doi: 10.1002/num.20306
    [5] O. Nikan, Z. Avazzadeh, J. A. T. Machado, M. N. Rasoulizadeh, An accurate localized meshfree collocation technique for the telegraph equation in propagation of electrical signals, Eng. Comput., 39 (2023), 2327–2344. https://doi.org/10.1007/s00366-022-01630-9 doi: 10.1007/s00366-022-01630-9
    [6] S. Sharifi, J. Rashidinia, Numerical solution of hyperbolic telegraph equation by cubic B-spline collocation method, Appl. Math. Comput., 281 (2016), 28–38. https://doi.org/10.1016/j.amc.2016.01.049 doi: 10.1016/j.amc.2016.01.049
    [7] R. M. Hafez, Numerical solution of linear and nonlinear hyperbolic telegraph type equations with variable coefficients using shifted Jacobi collocation method, Comput. Appl. Math., 37 (2018), 5253–5273. https://doi.org/10.1007/s40314-018-0635-1 doi: 10.1007/s40314-018-0635-1
    [8] H. B. Jebreen, Y. C. Cano, I. Dassios, An efficient algorithm based on the multi-wavelet Galerkin method for telegraph equation, AIMS Math., 6 (2020), 1296–1308. https://doi.org/10.3934/math.2021080 doi: 10.3934/math.2021080
    [9] W. M. Abd-Elhameed, E. H. Doha, Y. H. Youssri, M. A. Bassuony, New Tchebyshev-Galerkin operational matrix method for solving linear and nonlinear hyperbolic telegraph type equations, Numer. Meth. Part. D. E., 32 (2016), 1553–1571. https://doi.org/10.1002/num.22074 doi: 10.1002/num.22074
    [10] A. Saadatmandi, M. Dehghan, Numerical solution of hyperbolic telegraph equation using the Chebyshev tau method, Numer. Meth. Part. D. E., 26 (2010), 239–252. https://doi.org/10.1002/num.20442 doi: 10.1002/num.20442
    [11] H. B. Jebreen, I. Dassios, A biorthogonal hermite cubic spline Galerkin method for solving fractional riccati equation, Mathematics, 10 (2022), 1461. https://doi.org/10.3390/math10091461 doi: 10.3390/math10091461
    [12] H. B. Jebreen, C. Cattani, Interpolating scaling functions tau method for solving space-time fractional partial differential equations, Symmetry, 14 (2022), 2463. https://doi.org/10.3390/sym14112463 doi: 10.3390/sym14112463
    [13] M. Asadzadeh, B. N. Saray, On a multiwavelet spectral element method for integral equation of a generalized Cauchy problem, BIT, 62 (2022), 383–1416. https://doi.org/10.1007/s10543-022-00915-1 doi: 10.1007/s10543-022-00915-1
    [14] M. H. Heydari, M. Razzaghi, Highly accurate solutions for space-time fractional Schrödinger equations with non-smooth continuous solution using the hybrid clique functions, Math. Sci., 17 (2023), 31–42. https://doi.org/10.1007/s40096-021-00437-x doi: 10.1007/s40096-021-00437-x
    [15] X. Jiang, J. Wang, W. Wang, H. Zhang, A predictor-corrector compact difference scheme for a nonlinear fractional differential equation, Fractal Fract., 7 (2023), 521. https://doi.org/10.3390/fractalfract7070521 doi: 10.3390/fractalfract7070521
    [16] X. Yang, Q. Zhang, G. Yuan, Z. sheng, On positivity preservation in nonlinear finite volume method for multi-term fractional subdiffusion equation on polygonal meshes, Nonlinear Dynam., 92 (2018), 595–612.
    [17] H. Zhang, X. Yang, D. Xu, An efficient spline collocation method for a nonlinear fourth-order reaction subdiffusion equation, J. Sci. Comput., 85 (2020). https://doi.org/10.1007/s10915-020-01308-8
    [18] A. Iqbal, T. Akram, A numerical study of anomalous electro-diffusion cells in cable sense with a non-singular kernel, Demonstr. Math., 55 (2022), 574–586. https://doi.org/10.1515/dema-2022-0155 doi: 10.1515/dema-2022-0155
    [19] T. Akram, M. Abbas, A. Ali, A. Iqbal, D. Baleanu, A numerical approach of a time fractional reaction-diffusion model with a non-singular kernel, Symmetry, 12 (2020), 1653. https://doi.org/10.3390/sym12101653 doi: 10.3390/sym12101653
    [20] V. R. Hosseini, W. Chen, Z. Avazzadeh, Numerical solution of fractional telegraph equation by using radial basis functions, Eng. Anal. Bound. Elem., 38 (2014), 31–39. https://doi.org/10.1016/j.enganabound.2013.10.009 doi: 10.1016/j.enganabound.2013.10.009
    [21] Y. H. Youssri, W. M. Abd-Elhameed, Numerical spectral Legendre-Galerkin algorithm for solving time fractional telegraph equation, Rom. J. Phys., 63 (2018), 1–16.
    [22] N. Mollahasani, M. M. Mohseni, K. Afrooz, A new treatment based on hybrid functions to the solution of telegraph equations of fractional order, Appl. Math. Model., 40 (2016), 2804–2814. https://doi.org/10.1016/j.apm.2015.08.020 doi: 10.1016/j.apm.2015.08.020
    [23] A. Saadatmandi, M. Mohabbati, Numerical solution of fractional telegraph equation via the tau method, Math. Rep., 17 (2015), 155–166.
    [24] J. Chen, F. Liu, V. Anh, Analytical solution for the time-fractional telegraph equation by the method of separating variables, J. Math. Anal. Appl., 338 (2008), 1364–1377. https://doi.org/10.1016/j.jmaa.2007.06.023 doi: 10.1016/j.jmaa.2007.06.023
    [25] W. Jiang, Y. Lin, Representation of exact solution for the time-fractional telegraph equation in the reproducing kernel space, Commun. Nonlinear Sci., 16 (2011), 3639–3645. https://doi.org/10.1016/j.cnsns.2010.12.019 doi: 10.1016/j.cnsns.2010.12.019
    [26] A. Ali, T. Abdeljawad, A. Iqbal, T. Akram, M. Abbas, On unconditionally stable new modified fractional group iterative scheme for the solution of 2D time-fractional telegraph model, Symmetry, 13 (2021), 2078. https://doi.org/10.3390/sym13112078 doi: 10.3390/sym13112078
    [27] M. Shahriari, B. N. Saray, B. Mohammadalipour, S. Saeidian, Pseudospectral method for solving the fractional one-dimensional Dirac operator using Chebyshev cardinal functions, Phys. Scripta., 98 (2023), 055205. https://doi.org/10.1088/1402-4896/acc7d3 doi: 10.1088/1402-4896/acc7d3
    [28] A. Afarideh, F. D. Saei, M. Lakestani, B. N. Saray, Pseudospectral method for solving fractional Sturm-Liouville problem using Chebyshev cardinal functions, Phys. Scripta, 96 (2021), 125267. https://doi.org/10.1088/1402-4896/ac3c59 doi: 10.1088/1402-4896/ac3c59
    [29] C. Canuto, M. Y. Hussaini, A. Quarteroni, T. A. Zang, Spectral methods fundamentals in single domains, Berlin: Springer-Verlag, 2006.
    [30] A. Kilbas, H. M. Srivastava, J. J. Trujillo, Theory and applications of fractional differential equations, Amsterdam: Elsevier, 2006.
    [31] G. Dahlquist, A. Björck, Numerical methods, Englewood Cliffs: Prentice Hall, 1974.
    [32] H. Zhang, Y. Liu, X. Yang, An efficient ADI difference scheme for the nonlocal evolution problem in three-dimensional space, J. Appl. Math. Comput., 69 (2023), 651–674.
  • This article has been cited by:

    1. Jiakun Zhang, Fengying Zhou, Naiwei Mao, Numerical optimization algorithm for solving time-fractional telegraph equations, 2025, 100, 0031-8949, 045237, 10.1088/1402-4896/adbf6f
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1253) PDF downloads(51) Cited by(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog