Fully Legendre Spectral Galerkin Algorithm for Solving Linear One-Dimensional Telegraph Type Equation

Abstract

In this paper, we analyze and implement a new efficient spectral Galerkin algorithm for handling linear one-dimensional telegraph type equation. The principle idea behind this algorithm is to choose appropriate basis functions satisfying the underlying boundary conditions. This choice leads to systems with specially structured matrices which can be efficiently inverted. The proposed numerical algorithm is supported by a careful investigation for the convergence and error analysis of the suggested approximate double expansion. Some illustrative examples are given to demonstrate the wide applicability and high accuracy of the proposed algorithm.