Construction of symplectic (partitioned) Runge-Kutta methods with continuous stage
classification
🧮 math.NA
cs.NA
keywords
methodspartitionedrunge-kuttasymplecticconstructioncontinuousgeometricstage
read the original abstract
Hamiltonian systems are one of the most important class of dynamical systems with a geometric structure called symplecticity and the numerical algorithms which can preserve such geometric structure are of interest. In this article we study the construction of symplectic (partitioned) Runge-Kutta methods with continuous stage, which provides a new and simple way to construct symplectic (partitioned) Runge-Kutta methods in classical sense. This line of construction of symplectic methods relies heavily on the expansion of orthogonal polynomials and the simplifying assumptions for (partitioned) Runge-Kutta type methods.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.