Answers are grounded in this paper and cite their sources.
The telegraph equation describes various phenomena in many applied sciences. We propose two new efficient spectral algorithms for handling this equation. The principal idea behind these algorithms is to convert the linear/nonlinear telegraph problems (with their initial and boundary conditions) into a system of linear/nonlinear equations in the expansion coefficients, which can be efficiently solved. The main advantage of our algorithm in the linear case is that the resulting linear systems have special structures that reduce the computational effort required for solving them. The numerical algorithms are supported by a careful convergence analysis for the suggested Chebyshev expansion. Some illustrative examples are given to demonstrate the wide applicability and high accuracy of the proposed algorithms.
No takes yet. Share an insight, caveat, or question.
Abd‐Elhameed et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: