Advanced shifted sixth-kind Chebyshev tau approach for solving linear one-dimensional hyperbolic telegraph type problem

A new numerical scheme based on the tau spectral method for solving the linear hyperbolic telegraph type equation is presented and implemented. The derivation of this scheme is based on utilizing certain modified shifted Chebyshev polynomials of the sixth-kind as basis functions. For this purpose, some new formulas concerned with the modified shifted Chebyshev polynomials of the sixth-kind have been stated and proved, and after that, they serve to study the hyperbolic telegraph type equation with our proposed scheme. One advantage of using this scheme is that it reduces the problem into a system of algebraic equations that can be simplified using the Kronecker algebra analysis. The convergence and error estimate of the proposed technique are analyzed in detail. In the end, some numerical tests are presented to demonstrate the efficiency and high accuracy of the proposed scheme.


Introduction
The telegraph equation is a second-order hyperbolic partial differential equation (HPDE).It is usually used for transmission and propagation of electrical signals [1,2].There are many applications of the hyperbolic telegraph equation in many fields such as microwaves and radio frequency fields [3].In recent years, there has been a growing interest to study the hyperbolic telegraph equation numerically.For instance, in [4], the authors presented two schemes based on Lagrange polynomials to deal with the numerical solution of the second-order two-dimensional telegraph equation with the Dirichlet boundary conditions.An approximate solution of the hyperbolic telegraph equation was proposed in [5] by using the Bernoulli collocation method.In [6], the authors developed an efficient computational method for numerically solving the hyperbolic telegraph equation in two and threedimensional spaces by using the generalized finite difference method.A Haar wavelet collocation approach is followed in [7] for treating one and two-dimensional second-order linear and nonlinear hyperbolic telegraph equations.Another numerical algorithm depending on the meshless approach is developed for the numerical solution of some types of hyperbolic telegraph equation in [8][9][10].A Galerkin wavelet approach was proposed in [11] for solving the telegraph equation.Some other contributions regarding telegraph type models can be found in [12][13][14].
As we know, partial differential equations (PDEs) and fractional PDEs are used to describe a variety of physical phenomena which are often difficult to solve analytically; therefore, the employment of numerical techniques to treat such equations becomes necessary.For some of these studies, see [15][16][17][18][19][20].Numerical techniques based on spectral methods are efficient methods for solving PDEs since they are able to provide excellent error properties and converge exponentially.The main idea behind spectral methods is building approximate solutions of differential equations in terms of expansions of orthogonal polynomials.The three celebrated versions of the spectral methods are the collocation, tau and Galerkin methods.These methods are used as popular techniques to find the coefficients of the used expansion.There are very promising efforts in developing spectral methods for solving various types of differential equations.In this regard, collocation method is applied in [21][22][23][24][25], tau method is used in [26][27][28][29][30][31][32], and Galerkin method was employed in [33][34][35][36][37].
Recently, there have been renewed interests in employing different orthogonal polynomials in spectral methods.In particular, there are considerable contributions concerned with the first-, second-, third-and fourth-kinds of Chebyshev polynomials.These four kinds of Chebyshev polynomials have played important roles in the numerical solutions of various types of differential equations using the different versions of spectral methods (see, [38][39][40][41][42]).One of the advantages of using Chebyshev polynomials is the good representation of smooth functions by finite Chebyshev expansion.In addition, the coefficients in the Chebyshev expansion approach zero faster than any inverse power in m as m tends to infinity.In [43], Masjed-Jamei presented other two half-trigonometric orthogonal Chebyshev polynomials, and he named them the fifth-and sixth-kinds.We comment here that the authors in [28,44] presented complete trigonometric representations for, respectively, the Chebyshev polynomials of the fifthand sixth-kinds.In fact, these two types of polynomials are special polynomials of the so-called generalized ultraspherical polynomials (see, [45]).Recently, these two families of orthogonal polynomials have received considerable attention among many researchers.For instance, the authors in [44] and [28] used, respectively, the fifth-and the sixth-kinds Chebyshev polynomials as basis functions to solve some types of linear and nonlinear fractional-order differential equations.In [46], the reaction-diffusion-convection equation was solved by using the sixth-kind Chebyshev collocation method.
Our main aim in the current paper can be summarized as follows: • Stating and proving new theorems concerned with the shifted sixth-kind Chebyshev polynomials and their modified ones.• Employing the modified shifted polynomials to obtain the proposed numerical solution of the telegraph equation.• Investigate carefully the convergence analysis arising from the proposed expansion.
• Performing some comparisons of the proposed scheme with schemes proposed by some other researchers to clarify the efficiency and accuracy of the presented scheme.
To the best of our knowledge, the novelty of this paper comes from the following points: • Selecting the basis functions in terms of the modified Chebyshev polynomials of the sixth-kind is new.• Combining the use of the spectral tau method with Kronecker's algebra enables us to solve the resulting linear system easier.
The rest of the paper is organized as follows.In Sect.2, some properties and relations of the Chebyshev polynomials of the sixth-kind and their shifted ones are presented.Section 3 is interested in employing the shifted sixth-kind Chebyshev tau method to solve the hyperbolic telegraph type equation.Section 4 is devoted to the discussion of the convergence and error analysis of the suggested scheme.Section 5 is interested in providing some numerical results and comparisons to illustrate the efficiency of the proposed technique.In the end, a conclusion is presented in Sect.6.

An overview on Chebyshev polynomials of the sixth-kind
The main objective of this section is to introduce some properties and relations of Chebyshev polynomials of the sixthkind which will be used in the current study.
These polynomials satisfy the following orthogonality relation ( [28]): , where and The polynomials Y i (t) may be determined with the aid of the following recurrence relation: The shifted orthogonal Chebyshev polynomials of the sixthkind Y * i (t) are defined on [0, ] as The orthogonality relation of Y * i (t) on [0, ] is given by: where and The problem of expressing the derivatives of several orthogonal polynomials in terms of their original polynomials is of great interest in the scope of numerical analysis, and in particular, in the numerical solutions of different types of differential equations.The following theorem exhibits the derivatives of the polynomials Y * i (t) in terms of their original ones.
Theorem 1 [47] The following expression for the derivatives of the polynomials (1) ( ( Remark 1 Although, the two hypergeometric functions that appear in the coefficients A r,i,m are terminating, they can not be summed in general for all m.Regarding the two cases m = 1 and m = 2 , these hypergeometric functions can be summed, and accordingly, the expressions of the first-and second-order derivatives can be obtained in simple forms.
The following two lemmas concerning the reduction of certain two terminating hypergeometric functions are required.

Lemma 1 Let and i be any two nonnegative integers. One has
Proof To obtain a reduction formula for the above terminating hypergeometric function, set and we resort to the celebrated algorithm of Zeilberger ( [48]) to show that G ,i satisfies the following recurrence relation: The exact solution of the above recurrence relation is given by odd.

◻
Lemma 2 Let and i be two nonnegative integers.One has

Proof First set
The application of Zeilberger's algorithm again ( [48]) enables one to obtain the following recurrence relation for H ,i : whose exact solution is given by ◻ Now, we are going to establish two expressions for the first-and second-order derivatives of the shifted Chebyshev polynomials of the sixth-kind.

and M r,i is given by
Proof Setting m = 1 in (5) yields the following two reduced formulas ( [47]) for The two formulas in ( 9) and ( 10) can be merged together to give the following unified formula for the first-order derivative: where ◻ Corollary 2 For all i ≥ 2 , the second-order derivative of the polynomials Y * i (t) can be expressed explicitly as: where Proof Setting m = 2 in relation ( 5) yields the following two formulas: and If we substitute by the reduction formulas ( 6) and ( 7) of the two terminating hypergeometric functions that appear in ( 12) and ( 13), then the following two formulas can be obtained: (11) and The last two formulas can be unified to give the following formula with This completes the proof of Corollary 2. ◻ if i odd and i−r−4 2 even, 0, otherwise.

The proposed numerical scheme for treating the telegraph-type equation
The main aim of this section is to introduce the modified shifted sixth-kind Chebyshev polynomials and utilize them for the numerical solution of the linear hyperbolic telegraph type equation.Now, we introduce the following modified shifted Chebyshev polynomials of the sixth-kind defined as follows: where Y * i (z) is the shifted Chebyshev polynomials of the sixth-kind that are defined in (2).
The family of polynomials i (z) i≥0 forms an orthogonal set of polynomials on [0, ] in the sense that: where h ,i is given in (4).
Our main target in this section is to employ the modified polynomials i (x) to solve the telegraph type equation.Explicitly, we will analyze in detail our proposed method, namely the modified shifted sixth-kind Chebyshev tau method (MS6CTM).
In order to proceed in our proposed algorithm, and based on Corollaries 1 and 2, the following theorem which expresses the second-order derivative of the polynomials i (z) in terms of the polynomials Y * j (z) will be stated and proved.

Theorem 2
The second-order derivative of i (z) can be explicitly expressed as: where Proof From the choice of the basis functions in (14), we have ( 14) if i, j even and i−j+2 2 odd, −3 (j + 2), if i, j even and i−j+2 2 even, , if i, j odd and i−j+2 2 even, , if i, j odd and i−j+2 2 odd, 0, otherwise.
With the aid of Corollaries 1 and 2, Eq. ( 16) may be rewritten as the following form In virtue of the recurrence relation (1), and by replacing t with ( 2 z − 1), the following recurrence relation for the shifted sixth-kind Chebyshev polynomials holds: Furthermore, making use of the last formula leads to the following formula: Substituting by relations (18), (19) into relation (17), and performing some computations, one finds where ◻ Now, we are in a position to analyze our algorithm to solve the following linear telegraph type equation ( [29]): subject to the initial conditions: (16) .
(20)  tt u(z, t) +   t u(z, t) +  u(z, t) and the homogeneous boundary conditions: where , are real constants and p 1 (z), p 2 (z), g(z, t) are con- tinuous functions.Also, the source term g(z, t) describes that the medium is heated g(z, t) > 0 or cooled g(z, t) < 0 at space z and time t.Now, consider the following spaces Then any function u M (z, t) ∈ χM , may be written as where and = (c ij ) 0≤i,j≤M is the matrix of unknowns of order (M + 1) × (M + 1).
The principal idea for the application of MS6CTM is based on finding u M (z, t) ∈ χM such that where ŵ = (t) (z) and (u, v) ŵ = ∫  0 ∫ 0 ŵ u v dz dt.Now, let us define the following matrices: where With the aid of the above matrices, Eq. ( 22) can be rewritten as follows: Assuming that F and G are, respectively, two matrices of order (n + 1) × (m + 1) and (p + 1) × (q + 1), then the kro- necker product F ⊗ G is the (n + 1) (p + 1) × (m + 1) (q + 1) block matrix: and the vectorization of the matrix F is a matrix of order (n + 1)(m + 1) × 1 defined as: Based on the Kronecker product and vectorization (see, [49]), the following property holds where F, G and H are three matrices.Thanks to the previous property, Eq. ( 23) can be written as In addition, the matrix form of the initial conditions becomes where . Now, Eqs. ( 24) and ( 25) generate a linear system of equations in the unknown expansion coefficients c ij of dimen- sion (M + 1) 2 .This system may be solved via the Gaussian elimination technique.Now, we present a theorem, in which the nonzero elements of the matrices , , , , and are explicitly given in the following theorem.
Theorem 3 Let i (z) be the basis defined in (14), and let Then the nonzero elements b ir , d sj , f sj , k sj and a ir are given by i , . Proof Using Eqs. ( 15), ( 18) and ( 19) , we have and Now, making use of the orthogonality relation (3), we get the nonzero elements ( 26) and (27).
Similarly, the elements of the matrices , and may be obtained with the aid of Eqs. ( 8), (11) and the orthogonality relation (3).◻ , .

Treatment of the non-homogeneous boundary conditions
Consider the hyperbolic telegraph equation ( 20) subject to the initial conditions ( 21) and the non-homogeneous boundary conditions With the aid of the following transformation: Eq. ( 20) can be turned into the following one: subject to the initial conditions: and the homogeneous boundary conditions: where

Investigation of the convergence and error analysis
This section investigates the convergence and error analysis of the proposed double polynomial series expansion in depth.Several required lemmas are employed in this investigation.Furthermore, two theorems will be presented and proved.The first theorem estimates the expansion coefficients, whereas the second theorem estimates the truncation error.
Lemma 3 [28] The following inequality holds for Y * j (t): where

Lemma 4
The following estimate holds for i (z): Proof With the aid of Eq. ( 14) and Lemma 3, one gets and hence Also ◻

and assume that it has the following expansion:
this series converges uniformly to f(t) and the expansion coefficients in (28) holds where the expression A ≲ B means that there exists a generic constant c independent of M and any function such that A ≤ c B.
for some positive constants M 1 , M 2 can be expanded as: where The series in (29) converges uniformly to u(z, t), and the expansion coefficients in (29) holds Proof According to the hypotheses of Theorem 5 and use of the two substitutions: we get Imitating the steps used in Theorem 4 followed in [28], the desired result can be obtained.◻

Theorem 6 If u(z, t) satisfies the hypothesis of Theorem 5, and if u
, then the follow- ing truncation error estimate is satisfied Proof The truncation error may be written as: ( With the aid of Eq. ( 30), one can write By making similar steps as in Theorem 4 followed in [28], one finds Similarly, we can prove that and Substituting by Eqs. ( 33)-( 34) into Eq.( 32) and using Lemma 3 and the integral test (see, [50]) lead to the estimation ◻ Remark 2 As shown in Theorem 6, we find that the truncation error estimate (31) leads to an exponential rate of convergence. (33)

Illustrative examples
In this section, some numerical tests are presented to test the efficiency of the MS6CTM for solving the hyperbolic telegraph equation.In this respect, three problems will be solved numerically using our proposed method.In addition, to show the advantages of our method, comparisons with some other numerical algorithms used for solving the linear one-dimensional hyperbolic telegraph type equation are displayed.
Example 1 [34] Consider the telegraph equation subject to the initial conditions: and the non-homogeneous boundary conditions: where the exact solution is: u(z, t) = sin(z) cos(t).Table 1 presents the absolute error (AE) for M = 10, = = 1 and for various values of , and t.Table 2 displays a comparison of the maximum absolute error (MAE) for the case corresponding to M = 8, = = 1 , and for various values of and , while Table 3 displays the AE for the case corresponding to Table 1 The AE for Example 1    4 and 5. Table 6 presents the absolute error (AE) for M = 18, = 1, = 10 and for various values of , and t. Figure 2 shows the L ∞ Error for various values of , at M = 18, = 1, = 10 .The results of Tables 1, 2, 3, 6 and Fig. 1, 2 show that our numerical results with taking few terms of the proposed shifted sixth-kind Chebyshev expansion are more accurate.This demonstrates the advantage of our method if compared with some other numerical methods.
Example 2 [51] Consider the telegraph equation governed by the following initial and boundary conditions: where the exact solution is: u(z, t) = z 2 (1 − z) sin 2 (t).
In Table 7, a comparison of AE is listed for the case corresponding to = 1, = 1, M = 10 , while in Table 8, the AE for the case corresponding to M = 14, = 1, = 2 is displayed.In addition, Fig. 3 illustrates the Log10(AE) for different values of M. The CPU time of Example 2 for different values of M is presented in Table 9.We can see from Table 7, 8 and Fig. 3 that the proposed method is appropriate and effective.
Example 3 [52] Consider the telegraph equation governed by the following initial and boundary conditions: where the exact solution is: Table 10 displays the absolute errors for the case corresponding to = = 1, = = 1 and for the two val- ues M = 10 and M = 12 .Table 11 presents the AE for the case corresponding to = 1, = 5 , = 6, = 9, M = 16 .12. We can see from the tabulated AEs of Tables 10,11 and Fig. 4 that the proposed method is suitable and powerful for solving the telegraph type equation.

Concluding remarks
We have presented in this paper a numerical algorithm designed for approximating the solutions for the hyperbolic telegraph type problem based using the spectral tau approach.
In fact, to be capable of deriving our numerical scheme, basis functions are selected as suitable combinations of the shifted of double sixth-kind Chebyshev polynomials were introduced and utilized.The first-and second-order derivatives of the proposed basis functions were explicitly expressed using reduction formulae of certain terminating hypergeometric formulae of unit argument.Zeriberger's algorithm is pivotal in such reduction.The derivatives formulae, in conjunction with the use of the Kronecker algebra, serve in the discretization of the hyperbolic telegraph equation governed by its underlying conditions.The suggested algorithm is applicable and well-suited to computer programming.As a result, we do not require a lot of CPU time or a big number of calculations.The double expansion's convergence and error analysis were thoroughly studied.Numerical examples in Sect. 5 show that the suggested approach is appropriate and very effective for large intervals.Furthermore, we expect that our proposed method is suitable for solving the two and three-dimensional problems.As an expected future work, we aim to employ the developed theoretical results in this paper along with suitable spectral methods to treat numerically some other types of PDEs and fractional PDEs.All codes were written and debugged by Mathematica 11 on HP Z420 Workstation, Processor: Intel (R) Xeon(R) CPU E5-1620 -3.6 GHz, 16GB Ram DDR3, and 512 GB storage.

Fig. 1
Fig. 1 The Log10(AE) of Example 1 for different values of M.
Additionally, Fig. 4 illustrates the Log10(AE) for different values of M. The CPU time of Example 3 for different values of M is shown in Table

Fig. 2
Fig. 2 The L ∞ Error of Example 1

Fig. 3
Fig. 3 The Log10 (AE) of Example 2 for different values of M.

Fig. 4
Fig. 4 The Log10(AE) of Example 3 for different values of M

Funding
Open access funding provided by The Science, Technology & Innovation Funding Authority (STDF) in cooperation with The Egyptian Knowledge Bank (EKB).Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material.If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.To view a copy of this licence, visit http:// creat iveco mmons.org/ licen ses/ by/4.0/.

Table 2
Comparison of MAE for Example 1

Table 4
CPU time (seconds) of Example 1