An Enhanced Rothe–Jacobi Spectral Algorithm for Hyperbolic Telegraphic Models with Variable Coefficients: Balancing Temporal and Spatial Convergence

This study introduces a high-order numerical scheme for solving 1D second-order hyperbolic telegraph equations (HTEs) with variable coefficients. We employ a generalized temporal discretization (TD) of order p via the Rothe approach, combined with a spatial spectral collocation (SCM) method using generalized shifted Jacobi polynomials (GSJPs). By utilizing a Galerkin-type basis that structurally satisfies homogeneous boundary conditions (HBCs)—including Dirichlet or Neumann types—we achieve a global error bound of O((Δτ)p+N−s), where Δτ denotes the temporal step size and s represents the spatial regularity of the exact solution (ExaS). The proposed algorithm, Rothe-GSJP, allows for an optimal balance between the temporal and spatial parameters, minimizing computational effort for high-precision engineering applications such as Phase-Locked Loop (PLL) modeling. Numerical experiments performed on an i9-10850 workstation show that the scheme always reaches the machine precision floor of 10−16. While the framework supports temporal orders up to p=6, the results indicate that p∈{2,3,4} provides an optimal balance between high-order precision and absolute stability. The Rothe-GSJP method proves to be a robust, efficient, and highly accurate alternative to traditional solvers for hyperbolic systems.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-02-25
DOI
https://doi.org/10.3390/math14050774
Primary Topic
Numerical methods for differential equations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Enhanced Rothe–Jacobi Spectral Algorithm for Hyperbolic Telegraphic Models with Variable Coefficients: Balancing Temporal and Spatial Convergence

H. M. Ahmed
Mathematics
Numerical methods for differential equations
article

An Enhanced Rothe–Jacobi Spectral Algorithm for Hyperbolic Telegraphic Models with Variable Coefficients: Balancing Temporal and Spatial Convergence

H. M. Ahmed
article en

Abstract

This study introduces a high-order numerical scheme for solving 1D second-order hyperbolic telegraph equations (HTEs) with variable coefficients. We employ a generalized temporal discretization (TD) of order p via the Rothe approach, combined with a spatial spectral collocation (SCM) method using generalized shifted Jacobi polynomials (GSJPs). By utilizing a Galerkin-type basis that structurally satisfies homogeneous boundary conditions (HBCs)—including Dirichlet or Neumann types—we achieve a global error bound of O((Δτ)p+N−s), where Δτ denotes the temporal step size and s represents the spatial regularity of the exact solution (ExaS). The proposed algorithm, Rothe-GSJP, allows for an optimal balance between the temporal and spatial parameters, minimizing computational effort for high-precision engineering applications such as Phase-Locked Loop (PLL) modeling. Numerical experiments performed on an i9-10850 workstation show that the scheme always reaches the machine precision floor of 10−16. While the framework supports temporal orders up to p=6, the results indicate that p∈{2,3,4} provides an optimal balance between high-order precision and absolute stability. The Rothe-GSJP method proves to be a robust, efficient, and highly accurate alternative to traditional solvers for hyperbolic systems.

MathematicsVol. 14(5)
Helwan University (EG)
Openalex Percentile: Top 41%
Numerical methods for differential equations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.