Starting algorithms for implicit Runge-Kutta-Nyström methods
From MaRDI portal
The author presents a theoretical study on some algorithms for obtaining initial values to solve the algebraic system of internal stages of some implicit Runge-Kutta-Nyström methods. Order conditions for these algorithms, using Butcher-series, are obtained. The algorithms either require additional function evaluations or do not require new function evaluations. Special attention is devoted to starting algorithms for Runge-Kutta-Nyström methods induced by implicit Runge-Kutta formulas and for collocation Runge-Kutta methods.
Recommendations
Cites work
- Construction of starting algorithms for the RK-Gauss methods
- scientific article; zbMATH DE number 4041188 (Why is no real title available?)
- scientific article; zbMATH DE number 3700141 (Why is no real title available?)
- scientific article; zbMATH DE number 702482 (Why is no real title available?)
- Perturbed collocation and symplectic RKN methods
- Starting algorithms for IRK methods
Cited in
(10)- Starting algorithms for IRK methods
- Two-step high order starting values for implicit Runge--Kutta methods
- Stabilized starting algorithms for collocation Runge-Kutta methods.
- Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems.
- Starting algorithms for some DIRK methods
- On the starting algorithms for fully implicit Runge-Kutta methods
- Starting algorithms for low stage order RKN methods
- scientific article; zbMATH DE number 5696744 (Why is no real title available?)
- scientific article; zbMATH DE number 176990 (Why is no real title available?)
- scientific article; zbMATH DE number 1744811 (Why is no real title available?)
This page was built for publication: Starting algorithms for implicit Runge-Kutta-Nyström methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294475)