689
Views
0
CrossRef citations to date
0
Altmetric
Review Article

A numerical approach to solve hyperbolic telegraph equations via Pell–Lucas polynomials

ORCID Icon & ORCID Icon
Article: 2255404 | Received 20 Mar 2023, Accepted 27 Aug 2023, Published online: 20 Sep 2023

Abstract

In this article, a collocation approximation is investigated for approximate solutions of hyperbolic telegraph partial differential equations (HTPDEs). The method is based on evenly spaced collocation points and Pell–Lucas polynomials (PLPs). The form of solution, derivatives of unknown function in equation and conditions are expressed in matrix forms which depend on PLMs. By the help of these matrix forms and collocation points, problem is reduced to a system of linear algebraic equations. In addition, error analysis is performed for method. Thus, errors are bound by an upper bound. By making the applications of these techniques, the computed outcomes are offered in tables and graphs. Also the obtained outcomes by method are also compared with outcomes of other methods in the literature. These comparisons show that our method is more influential than other methods. All results have been computed by the aid of a code generated in MATLAB.

1. Introduction

Mathematical models in fields such as physics, engineering and economics are often expressed by using differential equations. Hyperbolic telegraph partial differential equations (HTPDEs), which are differential equation, are also often used in wave spread of electrical signals. Nowadays, many researchers have studied on HTPDEs. Sharifi and Rashidinia, Nazir et al., Jebreen et al., Bicer and Yalcinbas, Zarebnia and Parvaz, Adebayo et al., Dugassa et al., Nagaveni, Bahsi and Yalcinbas, Wang et al. have presented, respectively, a collocation approach based on cubic B-splines [Citation1], new cubic trigonometric B-splines approach [Citation2], a numerical algorithm used MWGM (multi-wavelet Galerkin method) [Citation3], Bernoulli polynomial approach [Citation4], a collocation approach based on quadratic B-spline functions [Citation5,Citation6], Laplace transform collocation method [Citation7], matrix inverse method [Citation8], Haar wavelet collocation method [Citation9], a collocation scheme based on Fibonacci polynomials [Citation10], a reduced order extrapolating method [Citation11]. Also, many methods such as a collocation technique used radial basis function [Citation12], Legendre MWGM [Citation13], Chebyshev–Tau method [Citation14], DRBIE method (a numerical technique used dual reciprocity method (DRM) with boundary integral equation) [Citation15], homotopy perturbation method [Citation16], variational iteration method [Citation17], variational iteration and homotopy perturbation methods [Citation18], differential quadrature method [Citation19], finite difference scheme [Citation20], a spectral collocation scheme based on Chebyshev polynomials [Citation21], Haar wavelet method [Citation22] and DGJ method [Citation23] have been studied for solving HTPDEs in literature. Yüzbaşı et al. made a great contribution to the literature by doing many studies on partial differential equations [Citation24–29]. Sezer et al. presented many studies on partial differential equations [Citation30–33]. Partial differential equations are very popular today and there are numerous works on partial differential equations in the literature [Citation34–75].

In this paper, it is introduced a collocation method using PLPs to get approximate solutions of hyperbolic equation [Citation13,Citation14,Citation27,Citation30,Citation76] (1) 2zβ2+bzβ+cz=2zα2+g(α,β),0αK,0βM(1)

under initial conditions (2) z(α,0)=f0(α),zβ(α,0)=f1(α),0αK,(2) and boundary conditions (3) z(0,β)=h0(β),z(K,β)=h1(β),0βM.(3) The basic aim of this paper is to compute the truncated Pell–Lucas polynomial solutions of (Equation1)–(Equation2)–(Equation3) as follows: (4) z2N(α,β)i=0Nj=0Nai,jQi,j(α,β),Qi,j(α,β)=Qi(α)Qj(β).(4)

The representations of parameters/variables in (Equation1)–(Equation2)–(Equation3)–(Equation4) are described in Table .

Table 1. The representations of the parameters/variables in the (Equation1)–(Equation2)–(Equation3)–(Equation4).

Also, Pell–Lucas polynomials are defined in [Citation77,Citation78] Qr(α)=s=0r/22r2srrs(rss)αr2s.Now, let's give two important features of PLPs that will be used in the next section. One of them is regarding the recurrence relation of PLPs defined by Qi(α)=2αQi1(α)+Qi2(α),i2when Q0(α)=2 and Q1(α)=2α. Other one is regarding derivatives of them as follows: (5) Qi(α)=2αQi1(α)+Qi2(α)+2Qi1(α),i2(5) when Q0(α)=0 and Q1(α)=2.

2. Matrix relations for solution method

In this section, partial differential equation (Equation1) and conditions (Equation2)-(Equation3) are expressed in matrix forms by aid of PLPs.

Lemma 2.1

Pell–Lucas polynomial solutions (Equation4) are given in matrix form [Citation29] (6) [z2N(α,β)]=QN(α)Q¯N(β)A¯N(6) where A¯N=[A0A1AN]T,At=[at,0at,1at,N]T,t=0,1,,NQN(α)=[Q0(α)Q1(α)QN(α)],0=zeros(1×(N+1)),Q¯N(β)=[QN(β)000QN(β)000QN(β)](N+1)×(N+1)2.

Proof.

We write expression QN,N(α,β)=QN(α)QN(β) in (Equation4) in matrix form as QN(α)Q¯N(β). Next, we multiply vector QN(α)Q¯N(β) by vector A¯N from right. Hence, we get relation (Equation6).

Lemma 2.2

The second derivative with respect to α of Equation (Equation1) is expressed in matrix form [Citation29] (7) (z2N(α,β))αα=QN(α)H2Q¯N(β)A¯N.(7)

Proof.

To proof it, we can use Lemma 2.1. We take derivative of solution form (Equation6) with respect to α and so we get (8) (z2N(α,β))α=QN(α)Q¯N(β)A¯N.(8) Also, we have relation QN(α)=QN(α)H by using (Equation5). Thus, we can express (Equation8) as (9) (z2N(α,β))α=QN(α)HQ¯N(β)A¯N(9) where if N is odd [Citation79,Citation80] H=[010305(1)N12N00408000006010(1)N322N00008000000000]and if N is even [Citation79,Citation80] H=[0103050004080(1)N222N00060100000080(1)N422N0000000].The size of the matrix H is (N+1)×(N+1). Similarly, we take derivative of (Equation8) with respect to α and we obtain (10) (z2N(α,β))αα=QN(α)Q¯N(β)A¯N.(10) Finally, we write obviously relation QN(α) in form QN(α)=QN(α)H2. Hence, by substituting this expression in Equation (Equation10), we get (Equation7).

Lemma 2.3

The matrix representations of the first derivative and the second derivative with respect to β in Equation (Equation1) respectively are represented by (11) (z2N(α,β))β=QN(α)Q¯N(β)H¯A¯N(11) and (12) (z2N(α,β))ββ=QN(α)Q¯N(β)H¯2A¯N.(12)

Proof.

Similarly to Lemma 2.2, the first derivative according to β of Equation (Equation6) is taken and thus we gain (13) (z2N(α,β))β=QN(α)Q¯N(β)A¯N.(13) Then, by taking the derivative of (Equation13), we get (14) (z2N(α,β))ββ=QN(α)Q¯N(β)A¯N.(14) Similar to previous lemma, let's express obviously derivative Q¯N(β) and Q¯N(β). Thus we can write, respectively Q¯N(β)=Q¯N(β)H¯ and Q¯N(β)=Q¯N(β)H¯2. Then, by substituting these obtained relations in (Equation13)–(Equation14), respectively, we complete the proof of theorem.

Theorem 2.1

We assume that Equation (Equation1) has an approximate solution as in form (Equation4). In that case, we give matrix relation (15) QN(α)Q¯N(β)H¯2A¯N+bQN(α)Q¯N(β)H¯A¯N+cQN(α)Q¯N(β)A¯NQN(α)H2Q¯N(β)A¯N=g(α,β)(15)

Proof.

If we use Lemma 2.1–2.3 in Equation (Equation1), then we obtain Equation (Equation15). More clearly, matrix relations in Equations (Equation6), (Equation7), (Equation11) and (Equation12) are written in Equation (Equation1). As a result, we gain the desired result.

Lemma 2.4

We obtain matrix representation of conditions (Equation2)–(Equation3) as (16) z2N(α,0)=QN(α)Q¯N(0)A¯N=f0(α)(z2N(α,0))β=QN(α)Q¯N(0)H¯A¯N=f1(α)(16) and (17) z2N(0,β)=QN(0)Q¯N(β)A¯N=h0(β)z2N(K,β)=QN(K)Q¯N(β)A¯N=h1(β).(17)

Proof.

For the proof of this lemma, Lemmas 2.1 and 2.3 are used. First, we write 0 instead of β, respectively, in Lemmas 2.1 and 2.3. So, we find (18) z2N(α,0)=QN(α)Q¯N(0)A¯N(z2N(α,0))β=QN(α)Q¯N(0)H¯A¯N.(18) Then, we write, respectively, 0 and K instead of α in Lemma 2.1. Hence, we get (19) z2N(0,β)=QN(0)Q¯N(β)A¯Nz2N(K,β)=QN(K)Q¯N(β)A¯N.(19) Finally, by utilizing right side of conditions (Equation2)–(Equation3), (Equation16) and (Equation17) are obtained.

3. The method of solution

In this section, we present Pell–Lucas collocation method. First, we define the collocation points. Then, we use the collocation points and matrix relations in Section 2. Thus we constitute the method of solution.

Theorem 3.1

The collocation points are described as [Citation29] (20) αr=KNr,βs=MNs,r,s=0,1,,N.(20) When we investigate the solution of Equation (Equation1) in form (Equation4), by using (Equation20) we reduce Equation (Equation1) to the following system of algebraic equations: (21) WA¯N=G.(21) Here, W=[W0W1WN],Wi=[W(αi,β0)W(αi,β1)W(αi,βN)],G=[G0G1GN],Gj=[g(αj,β0)g(αj,β1)g(αj,βN)].

Proof.

According to Theorem 2.1, we have (22) QN(α)Q¯N(β)H¯2A¯N+bQN(α)Q¯N(β)H¯A¯N+cQN(α)Q¯N(β)A¯NQN(α)H2Q¯N(β)A¯N=g(α,β).(22) Then, by using the collocation points (Equation20) instead of α and β in Equation (Equation22), we obtain system of matrix equations (23) {QN(α0)Q¯N(β0)H¯2A¯N+bQN(α0)Q¯N(β0)H¯A¯N+cQN(α0)Q¯N(β0)A¯NQN(α0)H2Q¯N(β0)A¯N=g(α0,β0)QN(α0)Q¯N(β1)H¯2A¯N+bQN(α0)Q¯N(β1)H¯A¯N+cQN(α0)Q¯N(β1)A¯NQN(α0)H2Q¯N(β1)A¯N=g(α0,β1)QN(α0)Q¯N(βN)H¯2A¯N+bQN(α0)Q¯N(βN)H¯A¯N+cQN(α0)Q¯N(βN)A¯NQN(α0)H2Q¯N(βN)A¯N=g(α0,βN)QN(α1)Q¯N(β0)H¯2A¯N+bQN(α1)Q¯N(β0)H¯A¯N+cQN(α1)Q¯N(β0)A¯NQN(α1)H2Q¯N(β0)A¯N=g(α1,β0)QN(α1)Q¯N(β1)H¯2A¯N+bQN(α1)Q¯N(β1)H¯A¯N+cQN(α1)Q¯N(β1)A¯NQN(α1)H2Q¯N(β1)A¯N=g(α1,β1)QN(α1)Q¯N(βN)H¯2A¯N+bQN(α1)Q¯N(βN)H¯A¯N+cQN(α1)Q¯N(βN)A¯NQN(α1)H2Q¯N(βN)A¯N=g(α1,βN)QN(αN)Q¯N(β0)H¯2A¯N+bQN(αN)Q¯N(β0)H¯A¯N+cQN(αN)Q¯N(β0)A¯NQN(αN)H2Q¯N(β0)A¯N=g(αN,β0)QN(αN)Q¯N(β1)H¯2A¯N+bQN(αN)Q¯N(β1)H¯A¯N+cQN(αN)Q¯N(β1)A¯NQN(αN)H2Q¯N(β1)A¯N=g(αN,β1)QN(αN)Q¯N(βN)H¯2A¯N+bQN(αN)Q¯N(βN)H¯A¯N+cQN(αN)Q¯N(βN)A¯NQN(αN)H2Q¯N(βN)A¯N=g(αN,βN)(23) This system (Equation23) shortly can also be shown as (24) WA¯N=G(24) where W=[QN(α0)Q¯N(β0)H¯2+bQN(α0)Q¯N(β0)H¯+cQN(α0)Q¯N(β0)QN(α0)H2Q¯N(β0)QN(α0)Q¯N(β1)H¯2+bQN(α0)Q¯N(β1)H¯+cQN(α0)Q¯N(β1)QN(α0)H2Q¯N(β1)QN(α0)Q¯N(βN)H¯2+bQN(α0)Q¯N(βN)H¯+cQN(α0)Q¯N(βN)QN(α0)H2Q¯N(βN)QN(α1)Q¯N(β0)H¯2+bQN(α1)Q¯N(β0)H¯+cQN(α1)Q¯N(β0)QN(α1)H2Q¯N(β0)QN(α1)Q¯N(β1)H¯2+bQN(α1)Q¯N(β1)H¯+cQN(α1)Q¯N(β1)QN(α1)H2Q¯N(β1)QN(α1)Q¯N(βN)H¯2+bQN(α1)Q¯N(βN)H¯+cQN(α1)Q¯N(βN)QN(α1)H2Q¯N(βN)QN(αN)Q¯N(β0)H¯2+bQN(αN)Q¯N(β0)H¯+cQN(αN)Q¯N(β0)QN(αN)H2Q¯N(β0)QN(αN)Q¯N(β1)H¯2+bQN(αN)Q¯N(β1)H¯+cQN(αN)Q¯N(β1)QN(αN)H2Q¯N(β1)QN(αN)Q¯N(βN)H¯2+bQN(αN)Q¯N(βN)H¯+cQN(αN)Q¯N(βN)QN(αN)H2Q¯N(βN)],G=[g(α0,β0)g(α0,β1)g(α0,βN)g(α1,β0)g(α1,β1)g(α1,βN)g(αN,β0)g(αN,β1)g(αN,βN)].Hence, the proof is completed.

Lemma 3.1

The condition (Equation2) and the condition (Equation3) by using the collocation point (Equation20) are expressed in matrix form as follows: (25) UA¯N=λ,U¯A¯N=γ,VA¯N=μ,V¯A¯N=ψ.(25)

Proof.

To begin with proof, we use the matrix relation in Lemma 2.4 and the collocation point (Equation20). Namely, by substituting the collocation points (Equation20) instead of α and β in the Equations (Equation18)–(Equation19), we obtain (26) {z2N(α0,0)=QN(α0)Q¯N(0)A¯N=f0(α0)=λ0z2N(α1,0)=QN(α1)Q¯N(0)A¯N=f0(α1)=λ1z2N(αN,0)=QN(αN)Q¯N(0)A¯N=f0(αN)=λN(z2N(α0,0))β=QN(α0)Q¯N(0)H¯A¯N=f1(α0)=γ0(z2N(α1,0))β=QN(α1)Q¯N(0)H¯A¯N=f1(α1)=γ1(z2N(αN,0))β=QN(αN)Q¯N(0)H¯A¯N=f1(αN)=γN(26) and (27) {z2N(0,β0)=QN(0)Q¯N(β0)A¯N=h0(β0)=μ0z2N(0,β1)=QN(0)Q¯N(β1)A¯N=h0(β1)=μ1z2N(0,βN)=QN(0)Q¯N(βN)A¯N=h0(βN)=μNz2N(K,β0)=QN(K)Q¯N(β0)A¯N=h1(β0)=ψ0z2N(K,β1)=QN(K)Q¯N(β1)A¯N=h1(β1)=ψ1z2N(K,βN)=QN(K)Q¯N(βN)A¯N=h1(βN)=ψN.(27) Briefly, we can write the Equations (Equation26) and (Equation27) as (28) UA¯N=λ,U¯A¯N=γ,VA¯N=μ,V¯A¯N=ψ,(28) where λ=[λ0λ1λN]T,γ=[γ0γ1γN]T,μ=[μ0μ1μN]T,ψ=[ψ0ψ1ψN]T,U=[U0U1UN]T,U¯=[U¯0U¯1U¯N]T,V=[V0V1VN]T,V¯=[V¯0V¯1V¯N]T,Ui=QN(αi)Q¯N(0),U¯i=QN(αi)Q¯N(0)H¯,Vj=QN(0)Q¯N(βj),V¯j=QN(K)Q¯N(βj).

Finally, we complete the proof of theorem.

Theorem 3.2

We assume that we seek the solution of problem (Equation1)–(Equation2)–(Equation3) in form (Equation4). Then, it is formed the augmented matrix [Citation29] (29) [W~;G~].(29)

Proof.

The matrix systems (Equation21) and (Equation25) are combined as a single system. We represent this new system as [W~;G~]. Namely, we obtain (30) [W~;G~]=[W;GU;λU¯;γV;μV¯;ψ].(30) Thus, we obtain the desired result.

Corollary 3.1

The system in Theorem 3.2 is solved. Solution of system (Equation29) is Pell–Lucas coefficient matrix A¯N in Equation (Equation6). Then, the obtained matrix A¯N is substituted in Equation (Equation6). Finally, by computing the matrix multiplication, it is obtained Pell–Lucas polynomial solution.

4. Error analysis

The two theorems about error analysis for the presented method in Section 3 are given in this part. The first theorem concerns the upper bound of errors in method. The second theorem concerns an error estimation technique to estimate errors with the help of residual function.

Theorem 4.1

Upper Bound for Errors

Let's show z(α,β) as exact solution and z2N(α,β) as Pell–Lucas polynomial solution (PLPS). Also z2NMac(α,β) shows Maclaurin expansion with 2Nth degree of z(α,β) in domain [0,K]×[0,M]. In that case, errors of PLPS z2N(α,β) for 0αK,0βM are bounded by Yüzbaşı and Yıldırım [Citation29] (31) z(α,β)z2N(α,β)kNA~~NqNq¯NA¯N+1(2N+1)!(αα+ββ)2N+1u(cα,cβ)(31) Here, kN=XN(α,β), A~~N shows coefficient matrix of z2NMac(α,β), qN=QN(α) and q¯N=Q¯N(β).

Proof.

First, let's write the expansion of 2Nth degree Maclaurin series of z(α,β) more explicitly. The expansion of Maclaurin series is expressed as (32) z2NMac(α,β)=n=02N1n!(αα+ββ)nz(α,β)|(α,β)=(0,0)=i=02Nj=02Ni1i!j!i+jαiβjz(α,β)|(α,β)=(0,0)αiβj(32) which becomes (33) z2NMac(α,β)=XN(α,β)A~~N(33) in matrix form. Also, here A~~N=[A~0A~1A~N]T, A~j=[a~i,0a~i,1a~i,N]T and XN(α,β) is matrix in dimensional 1×(N+1)2 as follows: (34) XN(s,t)=[X0,0(α,β)X0,N(α,β)X1,0(α,β)X1,N(α,β)XN,0(α,β)XN,N(α,β)](34) where Xm,n(α,β)=αmβn.

Second, according to Section 2, PLPS z2N(α,β) are expressed by (35) z2N(α,β)=QN(α)Q¯N(β)A¯N.(35) As a next step, error z(α,β)z2N(α,β) of PLPS can be written as (36) z(α,β)z2N(α,β)=z(α,β)z2NMac(α,β)+z2NMac(α,β)z2N(α,β)z(α,β)z2NMac(α,β)+z2NMac(α,β)z2N(α,β).(36) Note that we are making use of triangle inequality and Maclaurin expansion z2NMac(α,β) here.

Then, let's write more clearly terms on right-side of inequality (Equation36). For this purpose, by using Equations (Equation33) and (Equation35), it is obtained (37) z2NMac(α,β)z2N(α,β)=XN(α,β)A~~NQN(α)Q¯N(β)A¯NXN(α,β)A~~NQN(α)Q¯N(β)A¯N.(37) Here, qN and q¯N represent, respectively, QN(α) in [0,K] and Q¯N(β) in [0,M]. XN(α,β) is (38) XN(α,β)=kN:={KN×MN,ifK>1andM>1MN,ifK1andM>11,ifK1andM1(38)

in the domain [0,K]×[0,M].

Thus, we can express inequality (Equation37) as (39) z2NMac(α,β)z2N(α,β)kNA~~NqNq¯NA¯N.(39) We know that 2Nth degree Maclaurin series of z(α,β) and its remainder term are respectively as follows: (40) z(α,β)=z(0,0)+αzα+βzβ+12!(αα+ββ)2z(α,β)++1(2n)!(αα+ββ)2nz(α,β)(40) and (41) 1(2N+1)!(αα+ββ)2N+1u(cα,cβ),0αK,0βM.(41)

As a result, we write term z(α,β)z2NMac(α,β) in inequality (Equation36) as follows: (42) z(α,β)z2NMac(α,β)=1(2N+1)!(αα+ββ)2N+1u(cα,cβ),0αK,0βM.(42) By substituting Equations (Equation39) and (Equation42) in inequality (Equation36), for 0αK,0βM it is obtained (43) z(α,β)z2N(α,β)kNA~~NqNq¯NAN¯+1(2N+1)!×(αα+ββ)2N+1u(cα,cβ).(43) and thus the proof is completed.

Theorem 4.2

Estimating of Error

We suppose that z(α,β) and z2N(α,β) are, respectively, exact solution and Pell–Lucas polynomial solution of problem (Equation1)–(Equation2)–(Equation3). Also, residual function R2N(α,β) is described by Yüzbaşı and Yıldırım [Citation29] (44) R2N(α,β)=L[z2N(α,β)]g(α,β).(44) Accordingly, to estimate error e2N(α,β), the following error problem is obtained (45) {(e2N)ββ(α,β)+b(e2N)β(α,β)+ce2N(α,β)(e2N)αα(α,β)=R2N(α,β)e2N(α,0)=0(e2N)β(α,0)=0e2N(0,β)=0e2N(K,β)=0.(45)

Proof.

Let z(α,β) and z2N(α,β) be exact solution and PLPS of Equation (Equation1), respectively. Therefore, Equation (Equation1) is written in the form (46) L[z(α,β)]=g(α,β),L[z(α,β)]=zββ(α,β)+bzβ(α,β)+cz(α,β)zαα(α,β).(46)

Now, since PLPS z2N(α,β) satisfies Equations (Equation1)–(Equation2)–(Equation3), we get (47) L[z2N(α,β)]=(z2N)ββ(α,β)+b(z2N)β(α,β)+cz2N(α,β)(z2N)αα(α,β)=g(α,β)+R2N(α,β)(47) and (48) (z2N)(α,0)=f0(α),s[0,K](z2N)β(α,0)=f1(α),s[0,K](z2N)(0,β)=h0(β),β[0,M](z2N)(K,β)=h1(β),β[0,M].(48) Moreover, error function is defined by (49) e2N(α,β)=z(α,β)z2N(α,β).(49) After all, we subtract Equations (Equation47)–(Equation48) from Equations (Equation1)–(Equation2)–(Equation3). Hence, it becomes (50) {(e2N)ββ(α,β)+b(e2N)β(α,β)+ce2N(α,β)(e2N)αα(α,β)=R2N(α,β),e2N(α,0)=f0(α),(e2N)β(α,0)=f1(α),e2N(0,β)=h0(β),e2N(K,β)=h1(β).(50) Thus, (Equation45) is obtained.

Corollary 4.1

By solving the error problem (Equation50), the estimated error function is computed by (51) e2N,2M(α,β)m=0Nn=0Nam,nQm,n(α,β).(51) Hence, the errors can be estimated by using (Equation51) even if it is not known exact solution of problem.

Furthermore, it is calculated L2 error and L error by using L2=z(α,β)z2N(α,β)2=(cdab(z(α,β)z2N(α,β))2dαdβ)1/2and L=z(α,β)z2N(α,β)=max{|z(α,β)z2N(α,β)|,aαb,cβd}.In Section 5, errors L2 and L are used to make comparisons between the presented method and other methods.

5. Numerical applications

In this part, examples are made for methods presented in Sections 3 and 4. The numerical results obtained as a result of applications are explained on tables and supported visually with graphics. In addition, some comparisons are performed between the results of our method and the results of other methods in the literature. Let's note that numerical results are calculated by using MATLAB and graphics are created with the help of MATLAB. The definitions of some of variables in this section are given in Table .

Table 2. The representations of some variables in the Section 5.

Example 5.1

Let us consider the telegraph equation [Citation13,Citation30] (52) zββ(α,β)+4zβ(α,β)+2z(α,β)=zαα(α,β)(52) with initial conditions (53) z(α,0)=sin(α),zβ(α,0)=sin(α)(53) and boundary conditions (54) z(0,β)=0,z(1,β)=eβsin(1).(54) Here, the exact solution is z(α,β)=eβsin(α).

Now, we investigate approximate solution of problem (Equation52)–(Equation53)–(Equation54) as follows: z2N(α,β)m=0Nn=0Nam,nQm,n(α,β),Qm,n(α,β)=Qm(α)Qn(β)or in matrix form according to Lemma 2.1 it can be expressed by (55) [z2N(α,β)]=QN(α)Q¯N(β)A¯N.(55) According to Section 3 for N = 3, we write set of collocation points as (56) {α0=0,α1=13,α2=23,α3=1},{β0=0,β1=13,β2=23,β3=1}.(56) Applying method in Section 3, we obtain basic matrix equation as (57) WA¯N=G(57) where (58) W=[W0W1WN],Wi=[W(αi,β0)W(αi,β1)W(αi,βN)],G=[G0G1GN],Gj=[g(αj,β0)g(αj,β1)g(αj,βN)],W(αi,βj)=QN(αi)Q¯N(βj)H¯2+4QN(αi)Q¯N(βj)H¯+2QN(αi)Q¯N(βj)QN(αi)H2Q¯N(βj),Q¯N(βj)=[22βj4βj2+28βj3+6βj000000000000000022βj4βj2+28βj3+6βj000000000000000022βj4βj2+28βj3+6βj000000000000000022βj4βj2+28βj3+6βj],H=[0103004000060000],QN(αi)=[22αi4αi2+28αi3+6αi],H¯=[H0000H0000H0000H],A¯N=[A0A1A2A3],Ai=[ai,0ai,1ai,2ai,3].(58) According to Lemma 2.4, matrix form of conditions (Equation53)–(Equation54) is also created.

Then, system (Equation57) and matrix form of conditions (Equation53)–(Equation54) are written as a single system called [W~;G~]. Note that dimension of system [W~;G~] is 4((N+1)2×(N+1)2). By solving system [W~;G~], we calculate coefficient matrix as (59) A¯N=[21/8093257/4911935/36422725/36133330/1559525/2062481/692383/103788/84321274/470279/4274111/10325839/5572113/1111322/884711/82153]T.(59)

Finally, we compute approximate solution by replacing the calculated coefficient matrix A¯N in solution form (Equation55). Thus, method in Section 3 is applied. The error function is calculated by (60) e2N(α,β)=z(α,β)z2N(α,β)(60) and with the help of this function in (Equation60), results of method can be interpreted. On the other hand, to apply method in Theorem (4.2), we define residual function as follows: (61) R2N(α,β)=L[z2N(α,β)]g(α,β).(61) The obtained Pell–Lucas polynomial solutions z2N(α,β) satisfy Equation (Equation52) and conditions (Equation53)–(Equation54). From here, by using residual function in Equation (Equation61), it can be written as (62) L[e2N(α,β)]=L[z(α,β)]L[z2N(α,β)]=R2N(α,β)(62) and (63) e2N(α,0)=0,(e2N)β(α,0)=0,e2N(1,β)=0,e2N(0,β)=0.(63) That is, error problem is determined as (64) {(e2N)ββ(α,β)+4(e2N)ββ(α,β)+2e2N(α,β)(e2N)αα(α,β)=R2N(α,β)e2N(α,0)=0,(e2N)β(α,0)=0,e2N(1,β)=0,e2N(0,β)=0.(64) The solution of this error problem (Equation64) gives the estimated error function e2N,2M(α,β).

The tables and the graphs for problem (Equation52)–(Equation53)–(Equation54) show the following:

  • The exact solution and Pell–Lucas polynomial solution for N = 7 are depicted, respectively, in Figures (a) and (b).

  • Figure (a) shows the actual error e2N(α,β) for N = 7 while Figure (b) shows the estimated error e2N,2M(α,β) for (N,M)=(7,8).

  • Table  compares the actual errors for N=5,N=7,N=8 and the estimated errors for (N,M)=(5,6),(N,M)=(7,8),(N,M)=(8,9).

  • compares the results of the presented method with the results of the methods TM [Citation30] and LMM [Citation13] in the literature. Let's note that conditions z(α,0)=sin(α),zβ(α,0)=sin(α) are used in these two methods and in order to make a comparison, results are obtained according to conditions in these two methods in Table .

Figure 1. Plots of solutions (exact and Pell-Lucas polynomial) of problem (Equation52)–(Equation53)–(Equation54).

Figure 1. Plots of solutions (exact and Pell-Lucas polynomial) of problem (Equation52(52) zββ(α,β)+4zβ(α,β)+2z(α,β)=zαα(α,β)(52) )–(Equation53(53) z(α,0)=sin⁡(α),zβ(α,0)=−sin⁡(α)(53) )–(Equation54(54) z(0,β)=0,z(1,β)=e−βsin⁡(1).(54) ).

Figure 2. Plots of error functions (actual and estimation) of problem (Equation52)–(Equation53)–(Equation54).

Figure 2. Plots of error functions (actual and estimation) of problem (Equation52(52) zββ(α,β)+4zβ(α,β)+2z(α,β)=zαα(α,β)(52) )–(Equation53(53) z(α,0)=sin⁡(α),zβ(α,0)=−sin⁡(α)(53) )–(Equation54(54) z(0,β)=0,z(1,β)=e−βsin⁡(1).(54) ).

Table 3. Comparison of the actual errors for N = 5, N = 7, N = 8 and the estimated errors for (N,M)=(5,6),(N,M)=(7,8),(N,M)=(8,9) for problem (Equation52)–(Equation53)–(Equation54).

Table 4. Comparison of absolute errors (actual and estimation) with other methods for problem (Equation52)–(Equation53)–(Equation54).

According to results obtained from tables and graphics, the following results can be said:

  • The higher the value of N, the closer to exact solution results are obtained. That is, if the value of N is selected big enough, the made error is reduced.

  • The results obtained from error estimation method are similar to results obtained from actual errors. This reveals the success of the error estimation method.

  • The results of the suggested method have fewer errors at more points compared to the available literature works.

  • In summary, it is seen that methods in Sections 34 are effective and more successful results are obtained compared to other methods.

Example 5.2

Our next example is HPDE [Citation14,Citation27,Citation76] (65) zββ(α,β)+zβ(α,β)+z(α,β)=g(α,β)+zαα(α,β),0α1,0β1(65) with initial conditions (66) z(α,0)=0,zβ(α,0)=0(66) and boundary conditions (67) z(0,β)=0,z(1,β)=0.(67) Here, g(α,β)=(αα2)eβ(22β+β2)+2β2eβand the exact solution of (Equation65) is z(α,β)=(αα2)β2eβ.

The Pell–Lucas polynomial solution (PLPS) of problem (Equation65)–(Equation66)–(Equation67) is searched in matrix form z2N(α,β)m=0Nn=0Nam,nQm,n(α,β).The numerical results obtained from problem (Equation65)–(Equation66)–(Equation67) are described below:

  • The exact solution and the PLPS for N = 7 are shown, respectively, in Figures (a) and (b).

  • Figure (a) shows the actual error e2N(α,β) for N = 7 while Figure (b) shows the estimated error e2N,2M(α,β) for (N,M)=(7,8).

  • Table  compares the exact solution, the actual errors for N=5,N=7,N=9, the PLPS and the estimated errors for (N,M)=(5,6),(N,M)=(7,8),(N,M)=(9,10).

  • Table  compares the actual errors for the value of N = 7 with the results obtained from methods RWM [Citation76], CTM [Citation14] and BCM [Citation27] in the literature.

  • Table  compares the norms L2 and L between PM and BCM [Citation27].

  • Table  presents the CPU time(s). This represents the time passed while calculating in MATLAB.

Figure 3. Comparison of solutions (exact and approximate) for problem (Equation65)–(Equation66)–(Equation67).

Figure 3. Comparison of solutions (exact and approximate) for problem (Equation65(65) zββ(α,β)+zβ(α,β)+z(α,β)=g(α,β)+zαα(α,β),0≤α≤1,0≤β≤1(65) )–(Equation66(66) z(α,0)=0,zβ(α,0)=0(66) )–(Equation67(67) z(0,β)=0,z(1,β)=0.(67) ).

Figure 4. Comparison of error function (actual and estimation) for problem (Equation65)–(Equation66)–(Equation67).

Figure 4. Comparison of error function (actual and estimation) for problem (Equation65(65) zββ(α,β)+zβ(α,β)+z(α,β)=g(α,β)+zαα(α,β),0≤α≤1,0≤β≤1(65) )–(Equation66(66) z(α,0)=0,zβ(α,0)=0(66) )–(Equation67(67) z(0,β)=0,z(1,β)=0.(67) ).

Table 5. Comparison of results of the presented method for problem (Equation65)–(Equation66)–(Equation67).

Table 6. Comparison of errors between the presented method and other methods for problem (Equation65)–(Equation66)–(Equation67) for u(si,1).

Table 7. Comparison of norms (L2, L) for problem (Equation65)–(Equation66)–(Equation67).

According to tables and graphs, the following comments can be made:

  • As the value of N raises, the error in the method decreases. According to the obtained results, when value N = 9 is selected, satisfactory results are achieved.

  • The fact that the estimated error function e2N,2M(α,β) is resemblance to the actual error function e2N(α,β) reveals success of error estimation method.

  • More appropriate results are found by using the presented method for both actual errors and L2 and L errors.

  • According to Table , we can obtained the numerical results in a short time. This is an advantage of the presented method.

  • The methods in Sections 3 and 4 can be said to be applicable.

Example 5.3

Finally, let's solve HPDE (68) zββ(α,β)+zβ(α,β)+z(α,β)=zαα(α,β)(68) with the mixed conditions (69) z(α,0)=eα,zβ(α,0)=eα(69) and the boundary conditions (70) z(0,β)=eβ,u(1,β)=e4β.(70) The problem has the exact solution z(α,β)=eαβ.

We consider the PLPS of problem (Equation68)–(Equation69)–(Equation70) in form z2N(α,β)m=0Nn=0Nam,nQm,n(α,β),Qm,n(α,β)=Qm(α)Qn(β).Figures (a) and (b) show, respectively, the exact solution and PLPS of problem (Equation68)–(Equation69)–(Equation70). Figure (a) shows the actual error e2N(α,β) for N = 5 while Figure (b) shows the estimated error e2N,2M(α,β) for (N,M)=(5,6). Table  presents the actual error functions for many values of N and the estimated error functions for many values of (N,M) to problem (Equation68)–(Equation69)–(Equation70). According to all these results, it is observed that the made error  decreases as values of N raise. It can be said that the error estimation method is quite influential. That is, the results obtained from the presented methods are quite successful.

Figure 5. Comparison of solutions (exact and approximate) for problem (Equation68)–(Equation69)–(Equation70).

Figure 5. Comparison of solutions (exact and approximate) for problem (Equation68(68) zββ(α,β)+zβ(α,β)+z(α,β)=zαα(α,β)(68) )–(Equation69(69) z(α,0)=eα,zβ(α,0)=−eα(69) )–(Equation70(70) z(0,β)=e−β,u(1,β)=e4−β.(70) ).

Figure 6. Comparison of error functions (actual and estimation) of problem (Equation68)–(Equation69)–(Equation70).

Figure 6. Comparison of error functions (actual and estimation) of problem (Equation68(68) zββ(α,β)+zβ(α,β)+z(α,β)=zαα(α,β)(68) )–(Equation69(69) z(α,0)=eα,zβ(α,0)=−eα(69) )–(Equation70(70) z(0,β)=e−β,u(1,β)=e4−β.(70) ).

Table 8. The solutions (exact and approximate) and errors (actual and estimation) of problem (Equation68)–(Equation69)–(Equation70).

6. Conclusion

In this paper, a collocation method is studied by using the PLPs for HTPDEs. Then, error analysis is performed for method. The three different examples are made for suggested methods. The outcomes of our methods are presented in tables and graphs. In addition, comparisons are made for these examples with the results of other methods available in the literature. The made comparisons are also shown in tables. Moreover, there are also the made comparisons for L2 and L errors in this study. According to all the outcomes, it is said that the suggested methods offer more convenient outcomes than other methods. When the results of method are examined, it is observed that Pell–Lucas collocation method and error estimation method are quite successful. On the other hand, it is inferred that There is a decrease in the actual error and the estimated error with raise in N. However, if the number N is chosen too large, the matrix size also increases. This may also cause an increase in error when calculating in MATLAB. For this reason, the number N should be chosen large enough. From all the obtained outcomes, it is observed that methods are quite effective and successful. It should be noted that applications and graphics are obtained by using MATLAB. On the other hand, the numerical results are obtained in a short time. This is an advantage of the presented method. Furthermore, the presented method can be adapted to different type problems of partial differential equations after essential matrix forms are created.

Acknowledgments

The authors would like to thank the reviewers for all helpful comments to improve their manuscript.

Disclosure statement

No potential conflict of interest was reported by the author(s).

References

  • Sharifi S, Rashidinia J. Numerical solution of hyperbolic telegraph equation by cubic B-spline collocation method. Appl Math Comput. 2016;281:28–38.
  • Nazir T, Abbas M, Yaseen M. Numerical solution of second-order hyperbolic telegraph equation via new cubic trigonometric Bsplines approach. Cogent Math. 2017;4:Article ID 1382061. doi:10.1080/23311835.2017.1382061
  • Jebreen HB, Cano YC, Dassios I. An efficient algorithm based on the multi-wavelet Galerkin method for telegraph equation. AIMS Math. 2020;6:1296–1308. doi:10.3934/math.2021080
  • Bicer KE, Yalcinbas S. Numerical solution of telegraph equation using Bernoulli collocation method. Proc Natl Acad Sci India Sect A Phys Sci. 2019;89:769–775. doi:10.1007/s40010-018-0535-1
  • Zarebnia M, Parvaz R. A new approach for solution of telegraph equation. Int J Nonlinear Anal Appl. 2021;12:385–396.
  • Zarebnia M, Parvaz R. An approximation to the solution of one-dimensional hyperbolic telegraph equation based on the collocation of quadratic B-spline functions. Comput Methods Differ Equ. 2021;9:1198–1213.
  • Adebayo OA, Saheed OA, Adebayo AA, et al. Laplace transform collocation method for solving hyperbolic telegraph equation. Int J Eng Math. 2017;2017:1–9.
  • Dugassa M, File G, Aga T. Numerical solution of second order one dimensional linear hyperbolic telegraph equation. Ethiop J Educ Sci. 2018;14:39–52.
  • Nagaveni K. Haar wavelet collocation method for solving the telegraph equation with variable coefficients. Int J Appl Eng Res. 2020;15:235–243.
  • Bahsi AK, Yalcinbas S. A new algorithm for the numerical solution of telegraph equations by using Fibonacci polynomials. Math Comput Appl. 2016;21:15.
  • Wang H, He Q, Luo Z. A reduced order extrapolating technique of solution coefficient vectors to collocation spectral method for telegraph equation. Adv Differ Equ. 2020;2020:1–16. doi:10.1186/s13662-019-2438-0
  • Dehghan M, Shokri A. A numerical method for solving the hyperbolic telegraph equation. Numer Methods Partial Differ Equ. 2008;24:1080–1093. doi:10.1002/(ISSN)1098-2426
  • Yousefi SA. Legendre multiwavelet Galerkin method for solving the hyperbolic telegraph equation. Numer Methods Partial Differ Equ. 2010;26:535–543.
  • Saadatmandi A, Dehghan M. Numerical solution of hyperbolic telegraph equation using the Chebyshev Tau method. Numer Numer Methods Partial Differ Equ. 2010;26:239–252. doi:10.1002/num.v26:1
  • Dehghan M, Ghesmati A. Solution of the second-order one-dimensional hyperbolic telegraph equation by using the dual reciprocity boundary integral equation (DRBIE) method. Eng Anal Bound Elements. 2010;34:51–59. doi:10.1016/j.enganabound.2009.07.002
  • Mohyud-Din ST, Yildirim A, Kaplan Y. Homotopy perturbation method for one-dimensional hyperbolic equation with integral conditions. J Phys Sci. 2010;65:1077–1080.
  • Salkuyeh DK, Ghehsareh HR. Convergence of the variation literation method for the telegraph equation with integral conditions. Numer Methods Partial Differ Equ. 2011;27:1442–1455. doi:10.1002/num.20590
  • Raftari B, Yildirim A. Analytical solution of second-order hyperbolic telegraph equation by variational iteration and homotopy perturbation methods. Results Math. 2012;61:13–28. doi:10.1007/s00025-010-0072-y
  • Pekmen B, Tezer-Sezgin M. Differential quadrature solution of hyperbolic telegraph equation. J Appl Math. 2012;2012:18.
  • Mohebbi A. A fourth-order finite difference scheme for the numerical solution of 1D linear hyperbolic equation. Commun Numer Anal. 2013;2013:1–11.
  • Javidi M. Chebyshev spectral collocation method for computing numerical solution of telegraph equation. Comput Methods Differ Equ. 2013;1:16–29.
  • Berwal N, Panchal D, Parihar CL. Haar wavelet method for numerical solution of telegraph equations. Ital J Pure Appl Math. 2013;30:317–328.
  • Sari M, Gunay A, Gurarslan G. A solution to the telegraph equation by using DGJ method. Int J Nonlinear Sci. 2014;17:57–66.
  • Yüzbaşı Ş. A collocation approach for solving two-dimensional second-order linear hyperbolic equations. Appl Math Comput. 2018;338:101–114.
  • Yüzbaşı Ş. A numerical method for solving second-order linear partial differential equations under Dirichlet, Neumann and Robin boundary conditions. Int J Comput Methods. 2017;14:Article ID 1750015. doi:10.1142/S0219876217500153
  • Yüzbaşı Ş, Karaçayır M. A Galerkin-Type method to solve one-dimensional telegraph equation using collocation points in initial and boundary conditions. Int J Comput Methods. 2018;15:Article ID 1850031. doi:10.1142/S0219876218500317
  • Yüzbaşı Ş. Numerical solutions of hyperbolic telegraph equation by using the Bessel functions of first kind and residual correction. Appl Math Comput. 2016;287:83–93.
  • Yüzbaşı Ş, Şahin N. Numerical solutions of singularly perturbed one-dimensional parabolic convection-diffusion problems by the Bessel collocation method. Appl Math Comput. 2013;220:305–315.
  • Yüzbaşı Ş, Yıldırım G. A collocation method to solve the parabolic-type partial integro-differential equations via Pell–Lucas polynomials. Appl Math Comput. 2022;421:Article ID 126956.
  • Bulbul B, Sezer M. Taylor polynomial solution of hyperbolic type partial differential equations with constant coefficients. Int J Comput Math. 2011;88:533–544. doi:10.1080/00207161003611242
  • Isik OR, Sezer M, Guney Z. Bernstein series solution of linear second-order partial differential equations with mixed conditions. Math Meth Appl Sci. 2014;37:609–619. doi:10.1002/mma.2817
  • Yüksel G, Isik OR, Sezer M. Error analysis of the Chebyshev collocation method for linear second-order partial differential equations. Int J Comput Math. 2015;92:2121–2138. doi:10.1080/00207160.2014.966099
  • Yüksel G, Sezer M. A Chebyshev series approximation for linear second-order partial differential equations with complicated conditions. Gazi Univ J Sci. 2013;26:515–525.
  • Ahmed HF, Hashem WA. A novel spectral technique for 2D fractional telegraph equation models with spatial variable coefficients. J Taibah Univ Sci. 2022;16(1):885–894. doi:10.1080/16583655.2022.2123089
  • Akram T, Abbas M, Iqbal A, et al. Novel numerical approach based on modified extended cubic B-spline functions for solving non-linear time-fractional telegraph equation. Symmetry. 2020;12(7):1154. doi:10.3390/sym12071154
  • Anac H, Merdan M, Kesemen T. Solving for the random component time-fractional partial differential equations with the new Sumudu transform iterative method. SN Appl Sci. 2020;2:1112. doi:10.1007/s42452-020-2625-3
  • Bahia G, Ouannas A, Batiha IM, et al. The optimal homotopy analysis method applied on nonlinear time-fractional hyperbolic partial differential equations. Numer Methods Partial Differ Equ. 2021;37:2008–2022. doi:10.1002/num.v37.3
  • Bhowmik SK, Karakoc SB. Numerical approximation of the generalized regularized long wave equation using Petrov–Galerkin finite element method. Numer Methods Partial Differ Equ. 2019;35:2236–2257. doi:10.1002/num.v35.6
  • Chun C, Abbasbandy S. New application of variational iteration method for analytic treatment of nonlinear partial differential equations. World Appl Sci J. 2012;16(12):1677–1681.
  • Dehghan M, Ghesmati A. Combination of meshless local weak and strong (MLWS) forms to solve the two dimensional hyperbolic telegraph equation. Eng Anal Bound Elem. 2010;34(4):324–336. doi:10.1016/j.enganabound.2009.10.010
  • Dehghan M, Lakestani M. The use of Chebyshev cardinal functions for solution of the second-order one-dimensional telegraph equation. Numer Methods Partial Differ Equ. 2009;25(4):931–938. doi:10.1002/num.v25:4
  • Dehghan M, Mohebbi A. High order implicit collocation method for the solution of two-dimensional linear hyperbolic equation. Numer Methods Partial Differ Equ Int J. 2009;25(1):232–243. doi:10.1002/num.v25:1
  • Dehghan M, Salehi R. A method based on meshless approach for the numerical solution of the two-space dimensional hyperbolic telegraph equation. Math Methods Appl Sci. 2012;35(10):1220–1233. doi:10.1002/mma.v35.10
  • Dehghan M, Yousefi SA, Lotfi A. The use of He's variational iteration method for solving the telegraph and fractional telegraph equations. Int J Numer Methods Biomed Eng. 2011;27(2):219–231. doi:10.1002/cnm.v27.2
  • Dwivedi KD, Rajeev A, Das S, et al. Finite difference/collocation method to solve multi term variable-order fractional reaction-advection-diffusion equation in heterogeneous medium. Numer Methods Partial Differ Equ. 2021;37:2031–2045. doi:10.1002/num.v37.3
  • Entezari M, Abbasbandy S, Babolian E. Numerical solution of fractional partial differential equations with normalized Bernstein wavelet method. Appl Appl Math. 2019;14:890–909.
  • Eslahchi MR, Esmaili S, Namaki N, et al. Application of finite difference method in solving a second-and fourth-order PDE blending denoising model. Math Sci. 2023;17:93–106.
  • Gazi Karakoc SB, Neilan M. A C0 finite element method for the biharmonic problem without extrinsic penalization. Numer Methods Partial Differ Equ. 2014;30:1254–1278. doi:10.1002/num.v30.4
  • Gul T, Khan MA, Khan A, et al. Fractional-order three-dimensional thin-film nanofluid flow on an inclined rotating disk. Eur Phys J Plus. 2018;133(12):500. doi:10.1140/epjp/i2018-12315-4
  • Gumgum S, Kurul E, Savasaneril NB. Chebyshev collocation method for the two-dimensional heat equation. CMMA. 2018;3:1–8. doi:10.14426/mm.v3i2
  • Hajiketabi M, Abbasbandy S. The combination of meshless method based on radial basis functions with a geometric numerical integration method for solving partial differential equations: application to the heat equation. Eng Anal Bound Elem. 2018;87:36–46. doi:10.1016/j.enganabound.2017.11.008
  • Hajishafieiha J, Abbasbandy S. A new method based on polynomials equipped with a parameter to solve two parabolic inverse problems with a nonlocal boundary condition. Inverse Probl Sci Eng. 2020;28(5):739–753. doi:10.1080/17415977.2019.1696326
  • Hamid M, Usman M, Haq RU, et al. Linearized stable spectral method to analyze two-dimensional nonlinear evolutionary and reaction-diffusion models. Numer Methods Partial Differ Equ. 2022;38:243–261. doi:10.1002/num.v38.2
  • Jiwari R. Lagrange interpolation and modified cubic B-spline differential quadrature methods for solving hyperbolic partial differential equations with Dirichlet and Neumann boundary conditions. Comput Phys Commun. 2015;193:55–65. doi:10.1016/j.cpc.2015.03.021
  • Jiwari R. Barycentric rational interpolation and local radial basis functions based numerical algorithms for multidimensional sine-Gordon equation. Numer Methods Partial Differ Equ. 2021;37(3):1965–1992. doi:10.1002/num.v37.3
  • Jiwari R, Pandit S, Mittal R. A differential quadrature algorithm to solve the two dimensional linear hyperbolic telegraph equation with Dirichlet and Neumann boundary conditions. Appl Math Comput. 2012;218(13):7279–7294.
  • Koç DA, Öztörk Y, Gülsu M. A numerical algorithm for solving one-dimensional parabolic convection–diffusion equation. J Taibah Univ Sci. 2023;17(1):Article ID 2204808. doi:10.1080/16583655.2023.2204808
  • Kumar D, Singh J, Kumar S. Analytic and approximate solutions of space–time fractional telegraph equations via Laplace transform. Walailak J Sci Technol. 2014;11(8):711–728.
  • Kumar D, Singh J, Mehmet HB, et al. An effective computational approach to local fractional telegraph equations. Nonlinear Sci Lett A. 2017;8(2):200–206.
  • Kumbinarasaiah S, Mulimani M. A novel scheme for the hyperbolic partial differential equation through Fibonacci wavelets. J Taibah Univ Sci. 2022;16(1):1112–1132. doi:10.1080/16583655.2022.2143636
  • Kurulay M, Bayram M. A novel power series method for solving second order partial differential equations. Eur J Pure Appl Math. 2009;2:268–277.
  • Li YX, Muhammad T, Bilal M, et al. Fractional simulation for Darcy–Forchheimer hybrid nanoliquid flow with partial slip over a spinning disk. Alex Eng J. 2021;60(5):4787–4796. doi:10.1016/j.aej.2021.03.062
  • Merdan M, Anac H, Bekir Yazici Z, et al. Solving of some random partial differential equations by using differential transformation method and Laplace–Padé method. GÜFBED/GUSTIJ. 2019;9:108–118.
  • Mohyud-Din ST, Aslam Noor M. Homotopy perturbation method for solving partial differential equations. Z Naturforsch. 2009;64:157–170. doi: 10.1515/zna-2009-3-402
  • Mohyud-Din ST, Yildirim A, Hosseini MM, et al. A study on systems of variable-coefficient singular parabolic partial differential equations. World Appl Sci J. 2010;10:1321–1327.
  • Ozdemir N, Secer A, Bayram M. An algorithm for numerical solution of some nonlinear multi-dimensional parabolic partial differential equations. J Comput Sci. 2021;56:Article ID 101487. doi:10.1016/j.jocs.2021.101487
  • Pandit S, Kumar M, Tiwari S. Numerical simulation of second-order hyperbolic telegraph type equations with variable coefficients. Comput Phys Commun. 2015;187:83–90. doi:10.1016/j.cpc.2014.10.013
  • Rohila R, Mittal RC. A numerical study of two-dimensional coupled systems and higher order partial differential equations. Asian-Eur J Math. 2018;12:1950071 (12 pages).
  • Saeed U, Umair M. A modified method for solving non-linear time and space fractional partial differential equations. Eng Comput. 2019;36:2162–2178. doi:10.1108/EC-01-2019-0011
  • Soradi-Zeid S, Mesrizadeh M, Cattani C. Radial basis solutions of second-order quasi-linear hyperbolic boundary value problem. Numer Methods Partial Differ Equ. 2021;37:1916–1927. doi:10.1002/num.v37.3
  • Taherkhani S, Khalilsaraye IN, Ghayebi B. Numerical solution of the diffusion problem of distributed order based on the Sinc-collocation method. Math Sci. 2023;17:133–144.
  • Usman M, Hamid M, Khalid MSU, et al. A robust scheme based on novel–operational matrices for some classes of time-fractional nonlinear problems arising in mechanics and mathematical physics. Numer Methods Partial Differ Equ. 2020;36:1566–1600. doi: 10.1002/num.v36.6
  • Usman M, Hamid M, Liu M. Higher-order algorithms for stable solutions of fractional time-dependent nonlinear telegraph equations in space. Numer Methods Partial Differ Equ. 2022;38:1293–1318. doi:10.1002/num.v38.5
  • Yadav OP, Jiwari R. A finite element approach for analysis and computational modelling of coupled reaction diffusion models. Numer Methods Partial Differ Equ. 2019;35(2):830–850. doi:10.1002/num.v35.2
  • Zamani-Gharaghoshi H, Dehghan M, Abbaszadeh M. A meshless collocation method based on Pascal polynomial approximation and implicit closest point method for solving reaction-diffusion systems on surfaces. Eng Comput. 2023;1–10.
  • El-Azab MS, El-Gamel M. A numerical algorithm for the solution of telegraph equations. Appl Math Comput. 2007;190:757–764.
  • Horadam AF, Mahon Bro JM. Pell and Pell–Lucas polynomials. Fibonacci Q. 1985;23:7–20.
  • Horadam AF, Swita B, Filipponi P. Integration and derivative sequences for Pell and Pell–Lucas polynomials. Fibonacci Q. 1994;32:130–35.
  • Şahin M, Sezer M. Pell–Lucas collocation method for solving high-order functional differential equations with hybrid delays. Celal Bayar Univ J Sci. 2018;14:141–149.
  • Yüzbaşı Ş, Yıldırım G. Pell–Lucas collocation method for numerical solutions of two population models and residual correction. J Taibah Univ Sci. 2020;14:1262–1278. doi:10.1080/16583655.2020.1816027