Chebyshev symplectic methods based on continuous-stage Runge-Kutta methods

2018/05/29 by Wensheng Tang, Tang, Wensheng · 1 citation
Computer Science · Engineering · Mathematics · #Electromagnetic Simulation and Numerical Methods #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Numerical methods for differential equations

paper · pdf · doi:10.48550/arxiv.1805.11237

openalex publication_date 2018/05/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We develop Chebyshev symplectic methods based on Chebyshev orthogonal polynomials of the first and second kind separately in this paper. Such type of symplectic methods can be conveniently constructed with the newly-built theory of weighted continuous-stage Runge-Kutta methods. A few numerical experiments are well performed to verify the efficiency of our new methods.

Citations

• Continuous-stage Runge-Kutta methods based on weighted orthogonal polynomials

Cited by

• An extended framework of continuous-stage Runge-Kutta methods

Related

• Construction of symplectic (partitioned) Runge-Kutta methods with continuous stage
• An extended framework of continuous-stage Runge-Kutta methods
• Continuous-stage Runge-Kutta-NystrÖm methods
• Continuous-stage Runge-Kutta methods based on weighted orthogonal polynomials
• Symplecticity-preserving continuous-stage Runge-Kutta-Nyström methods