Abstract
Hamiltonian systems, as one of the most important class of dynamical systems, are associated with a well-known geometric structure called symplecticity. Symplectic numerical algorithms, which preserve such a structure are therefore of interest. In this article, we study the construction of symplectic (partitioned) Runge–Kutta methods with continuous stage. This construction of symplectic methods mainly relies upon the expansion of orthogonal polynomials and the simplifying assumptions for (partitioned) Runge–Kutta type methods. By using suitable quadrature formulae, it also provides a new and simple way to construct symplectic (partitioned) Runge–Kutta methods in classical sense.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.