Symplectic Runge-Kutta Methods Generated by Trapezoidal Rule
Jiabo Tan
Abstract
Jiabo Tan
Abstract
To preserve the symplecticity property, it is natural to require numerical integration of Hamiltonian systems to be symplectic. As a famous numerical integration, it is known that the trapezoidal rule is not symplectic. With the help of symplectic conditions of Runge-Kutta method and partitioned Runge-Kutta method, a symplectic partitioned Runge-Kutta method and a symplectic Runge-Kutta method are constructed on the basis of the trapezoidal rule in this paper.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
To preserve the symplecticity property, it is natural to require numerical integration of Hamiltonian systems to be symplectic. As a famous numerical integration, it is known that the trapezoidal rule is not symplectic. With the help of symplectic conditions of Runge-Kutta method and partitioned Runge-Kutta method, a symplectic partitioned Runge-Kutta method and a symplectic Runge-Kutta method are constructed on the basis of the trapezoidal rule in this paper.
Key concepts: Symplectic geometry, Runge–Kutta methods, Mathematics, Numerical integration, Symplectic integrator, Symplectic representation, Applied mathematics, Hamiltonian system