Spectral Galerkin treatment of linear one-dimensional telegraph type problem via the generalized Lucas polynomials

The major goal of this research is to develop and test a numerical technique for solving a linear one-dimensional telegraph problem. The generalized polynomials, namely, the generalized Lucas polynomials are selected as basis functions. To solve the linear one-dimensional telegraph type equation, we solve instead its corresponding integral equation via the application of the spectral Galerkin method that serves to convert the equation with its underlying conditions into a system of linear algebraic equations that may be solved by a suitable numerical solver. The convergence and error analysis of the generalized Lucas expansion are discussed in depth. The current analysis is based on the assumption that the problem’s solution is separable. Finally, some explanatory numerical examples are displayed together with comparisons to some other articles, to demonstrate the suggested method’s validity, applicability, and accuracy.


Introduction
There are many methods that have vital roles in numerical analysis, see for example [23,24,33]. Of these methods are the spectral methods that have effective roles in dealing with partial differential equations, ordinary differential equations and fractional differential equations (see [18,40]). The principal idea of spectral methods is based on the assumption that the approximate solution can be written as linear combinations of certain basis functions which may be orthogonal or otherwise. Common spectral methods include collocation, tau, and Galerkin methods. The latter methods have been widely used by many authors. For example, the typical collocation method is utilized in Atta et al. [8] to treat multi-term fractional differential equations (FDEs). The spectral tau method is applied in Bhrawy et al. [11] along with the Jacobi operational matrix to treat the time-fractional diffusion-wave equations. Also, a spectral solution of the non-linear one-dimensional Burgers' equation was developed based on introducing new derivatives formulas of the Chebyshev polynomials of the sixth-kind along with the application of the spectral tau method in [1]. The Galerkin approach was followed by Youssri and Abd-Elhameed [39] to solve the time-fractional telegraph equations. For some other articles employ different spectral methods, see for example Refs. [10,14,29].
Because of their relevance in a variety of disciplines, several types of special functions have been intensively researched. The Fibonacci and Lucas polynomials, as well as their variations and extensions, are examples of these important special functions (see [27]). These polynomials have been investigated theoretically and practically. For example, the authors in [6] established new connection formulas between the Fibonacci polynomials and some Chebyshev polynomials. Supersymmetric Fibonacci polynomials were discussed in [38]. Numerically, these polynomials were utilized to treat several types of differential equations. For examples, the authors in [2,5], used respectively, the Fibonacci polynomials and their generalizations to treat some types of FDEs, while the same authors in [3,4] employed respectively, the Lucas polynomials and their generalized polynomials to treat some types of FDEs. Mixed types of FDEs were treated in [31] via modified Lucas polynomials. In [21], the authors used Fibonacci polynomials for proposing numerical solutions for the variable-order spacetime fractional Burgers-Huxley equation. Fibonacci wavelets were utilized in [35] along with the Galerkin method to treat some types of fractional optimal control problems. In [9], the authors used the generalized Fibonacci operational tau method to treat the fractional Bagley-Torvik Equation. An approximate solution of the two-dimensional Sobolev equation was proposed by employing mixed Lucas and Fibonacci polynomials in [20].
It is known that the telegraph equation is one of the most important problems because it describes many phenomena in different fields. For example, it describes energetic particle transport in the interplanetary medium [19]. Recently, the telegraph type equation has been discussed by many authors. For example, in [16], the authors have proposed a numerical algorithm to solve the one-dimensional hyperbolic telegraph equation using the Galerkin algorithm. In [13], the authors have discussed the one-dimensional hyperbolic telegraph equation using the collocation method. For further studies, one can see [25,26,32,36].
Our main objectives in the current paper can be listed in the following items: • Stating and proving some new theorems concerned with the generalized Lucas polynomials (GLPs) and their modified ones. • Employing the modified GLPs to obtain a numerical solution of the one-dimensional hyperbolic telegraph equation. • Investigate carefully the convergence analysis arising from the proposed modified generalized Lucas expansion. • Performing some comparisons of the proposed technique with other methods to clarify the efficiency and accuracy of the presented technique.
To the best of our knowledge, there are some advantages of the proposed technique can be mentioned as follows: • Selecting the basis functions in terms of the modified GLPs enables one to obtain approximate solutions with high accuracy by taking a few numbers of the retained modes. This leads to less computational time and computational errors. • The presence of two parameters in the GLPs enables one to obtain various approximate solutions for different choices of the two involved parameters.
The above advantages motivate our interest to employ the GLPs. In addition, the numerical investigations based on the GLPs are few. This also gives us another motivation to utilize numerically this kind of polynomials.
The following is how the paper is structured: Section 2 is devoted to presenting some preliminary information and relationships of the GLPs that will be utilized throughout the work. Section 3 is interested in transforming the linear one-dimensional telegraph type equation into its corresponding integral equation. Section 4 focuses on the selection of the basis function and the utilization of the Galerkin method to solve the linear one-dimensional telegraph problem. Section 5 presents a description of the convergence and error analysis of the proposed expansion. Section 6 displays the numerical results accompanied by some comparisons. Finally, in Sect. 7, a conclusion is displayed.

Some fundamental properties of the GLPs
The following recurrence relation generates the sequence of GLPs with the initial values: where a and b be any nonzero real constants.
The power form representation of the G L Ps is given by which can be expressed alternatively as The Binet's form for GLPs can be written in the following form:

Integral form of linear one-dimensional telegraph type equation
In this section, we focus on transforming the linear one-dimensional telegraph type equation into its corresponding integral equation, and after that, we handle the integral equation numerically using our presented technique in the next section. Consider the following linear one-dimensional telegraph type equation [13]: subject to the initial conditions: and the nonhomogeneous boundary conditions: where f (x, t) represents the source term and α, β are real constants. By integrating Eq. (3.1) twice with respect to the variable t to reduce the number of conditions, one gets subject to the following nonhomogeneous boundary conditions: Therefore, Eq. To further develop our spectral algorithm for treating (3.4)-(3.5), the following transformation is suitable to transform the non-homogeneous boundary conditions into the homogeneous ones [15]: Now, Eqs. (3.4)-(3.6) can be combined to give the following integral equation: subject to the homogeneous boundary conditions:

Numerical spectral treatment for linear one-dimensional telegraph type equation
This section focuses on analyzing a spectral Galerkin algorithm for numerically solving the linear onedimensional telegraph type equation. First, we consider the following two kinds of basis functions: Consider the following two spaces: Now, two important theorems related to the basis functions ψ i (x) and γ j (t) are stated and proved. The first theorem gives an expression for the n-times repeated integrations of γ j (t), while the second introduces an expression for nth derivative of ψ i (x). [37] x 0

Theorem 4.2 The n-times repeated integrations of γ j (x) are given by
Proof Making use of relation (4.3), one finds For j = 0, with the aid of γ 0 (t) = 2, one gets After integrating the previous equation, we get the desired result.
For j ≥ 1, one has Based on substituting by the formula (2.2) into (4.4) yields and accordingly, the result for j ≥ 1 can be obtained after integrating Eq. (4.5).
As a direct consequence of Theorem 4.2, two specific integrals formulas can be deduced. The following corollary exhibits these formulas.

Corollary 4.3
The following two integrals formulas hold:

Theorem 4.4 For all positive integers i,n and i ≥ n, the nth derivative of ψ i (x) can be expressed in the form
3) and Proof Equation (2.2) enables one to expand ψ i (x) in the following form: Based on the well-known identity: the following relation can be obtained After performing some rather lengthy manipulations, the last formula turns into Replace k → k + n − 1, the desired formula (4.6) can be obtained.
As a direct consequence of Theorem 4.4, the following special result holds:

Galerkin technique for handling Eq. (3.7)
If we assume that v(x, t) ∈ P( ), then v(x, t) can be written as Now, and for the sake of applying the Galerkin method, we first compute the residual of Eq. (3.7). It can be written in the form In virtue of Eqs. (4.1), (4.2) and Corollaries 4.3, 4.5, the residual R(x, t) may be obtained. And hence the application of the Galerkin method leads to Now, Eq. (4.7) generates a linear system of equations in the unknown expansion coefficients c i j of dimension (M + 1) 2 , they may be solved via Gaussian elimination procedure.

Convergence and error analysis
In this section, the convergence and error analysis of the proposed double generalized Lucas expansion are discussed. Several required lemmas are employed in this discussion. [7], the following inequality holds:

Lemma 5.1 As shown in Abramowitz and Stegun
where I n (x) is the modified Bessel function of order n of the first kind.

Lemma 5.2
As shown in Luke [28], the following inequality holds:
Proof We proceed by induction on i. Suppose that the inequality (5.1) is true at (i − 1) and (i − 2), one gets With the aid of the following identity

Lemma 5.5
The following inequality holds: Proof Eq. (4.1) enables one to write by making use of Lemma 5.4, the desired inequality (5.4) can be obtained.

Q k is a positive constant. And if u(x, t) has the expansion u(x, t)
, the following conclusions are obtained:

The series converges absolutely.
Proof With the aid of Lemma 5.3 and according to the assumption u( using the assumption | f By making use of Lemma 5.1, one gets

Now, the application of Lemma 5.2 leads to
which proves the first part of Theorem 5.6. To prove the second part of Theorem 5.6, using the inequality of the first part, we have with the aid of Lemmas 5.4 and 5.5, one gets Applying the comparison test implies that the series Proof It is clear that Theorem 5.6 enables us to write where ξ 1 = |a −1 Q 1 | and ξ 2 = |a −1 Q 2 |. Now, Inequality (5.5) may be formulated as where (.), (., .) and γ (., .) denote, respectively, gamma, upper incomplete gamma, and lower incomplete gamma functions [22]. In virtue of simple inequality: e −t ≤ 1, ∀ t ≥ 0, one gets Take ξ = max{ξ 1 , ξ 2 }, the desired result can be obtained.

Illustrative examples
In this section, the generalized Lucas Galerkin method (GLGM) is applied for obtaining a numerical solution to the linear one-dimensional telegraph type equation with different conditions. The accuracy of the numerical results is measured using L ∞ , L 2 and root mean square error (RMSE).
Remark 6.1 All results of Examples 1, 2, 3 and 4 are calculated at a = b = 1.
Example 6.2 As given in [16,34], consider Eqs. (3.1)-(3.3) with the following choices: where the exact solution is u(x, t) = x 2 + t. Now, applying the technique described in Section 3, one gets subject to the homogeneous boundary conditions: where the exact solution is u( In Table 1, a comparison between the numerical solutions with the exact solution is presented for the case corresponding to M = 8 at different values of time t. Table 2 presents the best L 2 and L ∞ errors compared with those obtained in [30]. Also, Table 3 shows the computational time (CPU time) for different values of M.
In addition, Figure 1 shows the maximum absolute errors at different values of t for the case M = 8. We can see from Tables 1, 2 and Fig. 1 that the proposed method is appropriate and effective.
where the exact solution is: u(x, t) = cos(t) sin(x). The RMSEs for different values of α, β and time t at M = 3, 5, 7 are shown in Table 4. Table 5 compares the RMSEs with those obtained in [12] at M = 7 and t = 0.5. In Table 6, we present the absolute error for M = 7 at different values of α, β and t. Furthermore, Fig. 2 shows the graphs of the approximate solution and absolute error for α = 40, β = 100 at M = 8. The results of Tables 4, 5, 6 and Fig. 2 show that our numerical results by taking few terms of the proposed Generalized Lucas expansion are more accurate.    Table 6 The absolute errors for Example 6.4 where the exact solution is u(x, t) = e −2 t sinh(x). In Table 7, the absolute errors that obtained by GLGM in solving the problem for different values of α, β at different values of time t are listed at M = 8. In Table 8, we give a comparison between the maximum absolute errors obtained from the application of the numerical scheme presented in [17] and our method for   Fig. 3 The absolute error graphs of Example 6.5 the two cases corresponding to α = 20, β = 25 at M = 7 and α = 40, β = 100 at M = 8, respectively. Figure 3 shows the absolute error for the case α = 20, β = 25 at M = 7. We can see from the tabulated absolute errors of Tables 7, 8 and Fig. 3 that the proposed method is suitable and powerful for solving the linear one-dimensional telegraph equation.

Concluding remarks
In this paper, a new numerical technique to solve the one-dimensional linear hyperbolic telegraph type equation using the Galerkin method was analyzed in detail. Two new basis functions of the generalized Lucas polynomials were employed as basis functions, and the spectral Galerkin method is applied to reduce the equation governed by its conditions to a linear system of equations that may be solved with the aid of a suitable numerical solver. The convergence and error analysis of the generalized Lucas expansion were deeply investigated. In addition, our numerical findings are compared with exact solutions and with the solutions obtained by some other approximate methods. These results demonstrate the good accuracy and applicability of this technique.
Funding The authors have not disclosed any funding.
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://creativecommons.org/licenses/by/4.0/.

Conflict of interest
The authors declare that they have no conflict of interest.