Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Starting algorithms for IRK methods
Journal of Computational and Applied Mathematics
Construction of starting algorithms for the RK-Gauss methods
Journal of Computational and Applied Mathematics
Are high order variable step equistage initializers better than standard starting algorithms?
Journal of Computational and Applied Mathematics
Original article: Error growth in the numerical integration of periodic orbits
Mathematics and Computers in Simulation
| Hi-index | 7.29 |
Symplectic Runge-Kutta (RK) methods for general Hamiltonian systems are implicit and an iterative scheme must be used to obtain the solution at each step. In this paper the classical order and the pseudo-symplecticity order [Pseudo-symplectic Runge-Kutta methods, BIT 38 (1998) 439-461] of the one step method that results after @s fixed point iterations for solving the implicit equations of stages in an implicit RK method are studied. In the numerical experiments with some RK-Gauss methods, @s is chosen so that the pseudo-symplecticity order is twice the classical order. Thus, the pseudo-symplectic method retains some important properties of the original symplectic one. Further, new starting algorithms are constructed taking into account their pseudo-symplecticity properties and are compared with other initializers existing in the literature.