Journal article
Symplecticness conditions of some low order partitioned methods for non-autonomous Hamiltonian systems
Numerical algorithms, Vol.86(2), pp.495-514
02/01/2021
DOI: 10.1007/s11075-020-00898-6
Abstract
We consider the application of partitioned Runge-Kutta (PRK) methods to non-autonomous Hamiltonian systems. Necessary and sufficient conditions for the symplecticness of PRK methods are given, more particularly for two low order PRK methods: the partitioned (explicit-implicit) Euler method and the 2-stage Lobatto IIIA-B PRK method. Both methods are often the basis of composition schemes of higher order. In particular for irreducible PRK methods we show the necessity for the nodes of the two underlying PRK methods to be equal.
Details
- Title: Subtitle
- Symplecticness conditions of some low order partitioned methods for non-autonomous Hamiltonian systems
- Creators
- Laurent O Jay - University of Iowa
- Resource Type
- Journal article
- Publication Details
- Numerical algorithms, Vol.86(2), pp.495-514
- Publisher
- SPRINGER
- DOI
- 10.1007/s11075-020-00898-6
- ISSN
- 1017-1398
- eISSN
- 1572-9265
- Number of pages
- 20
- Language
- English
- Date published
- 02/01/2021
- Academic Unit
- Mathematics
- Record Identifier
- 9984241156802771
Metrics
2 Record Views