Starting algorithms for Gauss Runge-Kutta methods for Hamiltonian systems.
From MaRDI portal
(Redirected from Publication:1416396)
Recommendations
- Construction of starting algorithms for the RK-Gauss methods
- Starting algorithms for low stage order RKN methods
- Starting algorithms for the iterations of the RKN-Gauss methods
- Two-step high order starting values for implicit Runge--Kutta methods
- Initializers for RK-Gauss methods based on pseudo-symplecticity
Cites work
- scientific article; zbMATH DE number 50395 (Why is no real title available?)
- scientific article; zbMATH DE number 702482 (Why is no real title available?)
- Backward Error Analysis for Numerical Integrators
- Comparing Numerical Methods for Ordinary Differential Equations
- Construction of starting algorithms for the RK-Gauss methods
- Solving Ordinary Differential Equations I
- Starting algorithms for IRK methods
- Variable step implementation of geometric integrators
- Variable steps for reversible integration methods
- Variable time step integration with symplectic methods
Cited in
(8)- Approximate preservation of quadratic first integrals by explicit Runge-Kutta methods
- Two-step high order starting values for implicit Runge--Kutta methods
- Starting algorithms for low stage order RKN methods
- Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems.
- High order starting iterates for implicit Runge-Kutta methods: An improvement for variable-step symplectic integrators
- Stage value predictors for additive and partitioned Runge-Kutta methods
- Starting algorithms for a class of RK methods for index-2 DAEs
- Initializers for RK-Gauss methods based on pseudo-symplecticity
This page was built for publication: Starting algorithms for Gauss Runge-Kutta methods for Hamiltonian systems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1416396)