A Rothe-Chebyshev collocation algorithm for the hyperbolic telegraphic type equations with variable coefficients

We construct a semi-discretized spectral approach for the second-order telegraphic-type equations with Dirichlet or Neumann boundary conditions. The successive method of Rothe is first employed for the temporal discretization procedure to transform the model equations into a system of boundary value...

Full description

Saved in:
Bibliographic Details
Published in:Ain Shams Engineering Journal Vol. 16; no. 11; p. 103720
Main Authors: Izadi, Mohammad, Noeiaghdam, Samad, Ahmed, H.M.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.11.2025
Subjects:
Collocation nodes
Convergence analysis
Error estimation
Hyperbolic telegraphic equation
Modified Chebyshev polynomials
Time-horizontal Rothe's approach
Collocation nodes
65N12
35B25
Error estimation
65M70
41A10
Hyperbolic telegraphic equation
Time-horizontal Rothe's approach
Modified Chebyshev polynomials
Convergence analysis
ISSN:2090-4479
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We construct a semi-discretized spectral approach for the second-order telegraphic-type equations with Dirichlet or Neumann boundary conditions. The successive method of Rothe is first employed for the temporal discretization procedure to transform the model equations into a system of boundary value problems. Subsequently, the spectral matrix procedure utilizing the shifted modified Chebyshev polynomials (SMCPs) is formulated for the spatial variable. The family of discrete solutions obtained by the hybrid Rothe-SMCPs algorithm is demonstrated to exhibit uniform convergence to the continuous solution of order O(Δτ+R−3). In this context, Δτ signifies the time step, while R represents the number of SMCPs employed in the approximation procedure. Simulation experiments are carried out to highlight the strong agreement between the numerical results and theoretical predictions. The numerical results utilizing a larger time-step size exhibit greater accuracy compared to the computational values available in existing research works.
ISSN:2090-4479
DOI:10.1016/j.asej.2025.103720