Reducibility and characterization of symplectic Runge-Kutta methods
zbMATH Open0852.65061MaRDI QIDQ1920168FDOQ1920168
Authors: Peter Görtz, Rudolf Scherer
Publication date: 20 August 1996
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/118947
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Hamiltonian systemssymplectic integrationsymplectic methodsorder conditionspartitioned Runge-Kutta methodsorder barrierDJ-irreducibility
Nonlinear ordinary differential equations and systems (34A34) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Numerical methods for initial value problems involving ordinary differential equations (65L05) Dynamical systems and ergodic theory (37-XX)
Cited In (6)
- Gauss-Runge-Kutta-Nyström methods
- The existence of symplectic general linear methods
- Further reduction in the number of independent order conditions for symplectic, explicit partitioned Runge-Kutta and Runge-Kutta-Nyström methods
- Hamiltonian systems and symplectic integrators
- On quadratic invariants and symplectic structure
- Some properties of symplectic Runge-Kutta methods
This page was built for publication: Reducibility and characterization of symplectic Runge-Kutta methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920168)