.png){kind=icon}
.png){kind=icon}
Return
Efficient and High-Order Time Spectral Methods for Initial Value Problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10915-026-03387-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we revisit the Legendre (dual) Petrov–Galerkin spectral method in time for initial value problems (IVPs) and establish the relationship between the numerator of the Padé approximation to $$\textrm{e}^z$$ and the determinant of $$ \widehat{\varvec{A}}(z)=\varvec{I} - z \varvec{\widehat{M}},$$ where $$\varvec{\widehat{M}}$$ is the mass matrix from the Legendre dual Petrov–Galerkin scheme, for instance. Based upon this equivalence, we construct an efficient implementation of the spectral method in time with the aid of the zeros of the generalized reverse Bessel polynomials. As a by-product, we prove the equivalence between the Legendre (dual) Petrov–Galerkin spectral method and the spectral tau method, such that the implementation of the algorithm proposed in [Z. Chen and Y. Liu. SIAM J. Sci. Comput., 46(3): A2073–A2100, 2024] becomes more effective. Numerical experiments illustrate the accuracy and effectiveness of the proposed algorithms.
Keywords:
Legendre (dual) Petrov–Galerkin methods
Generalized reverse Bessel polynomials
Spectral method in time
Parallel implementation
Journal
IF:
3.3
Papers:
680
Citations:
9.6K