We propose an implementation of symplectic implicit Runge-Kutta schemes for highly accurate numerical integration of non-stiff Hamiltonian systems based on fixed point iteration. Provided that the computations are done in a given floating point arithmetic, the precision of the results is limited by round-off error propagation. We claim that our implementation with fixed point iteration is near-optimal with respect to round-off error propagation under the assumption that the function that evaluates the right-hand side of the differential equations is implemented with machine numbers (of the prescribed floating point arithmetic) as input and output. In addition, we present a simple procedure to estimate the round-off error propagation by mean...
AbstractWe consider implementations of a variable step size (and, separately, constant step size), f...
Symplectic Runge-Kutta schemes for integration of general Hamiltonian systems are implicit. In pract...
International audienceOrdinary differential equations are ubiquitous in scientific computing. Solvin...
Symplectic Runge-Kutta schemes for the integration of general Hamiltonian systems are implicit. In p...
Symplectic Runge-Kutta schemes for the integration of general Hamiltonian systems are implicit. In p...
In high accuracy long-time integration of differential equations, round-off errors may dominate trun...
International audienceNumerical integration schemes are mandatory to understand complex behaviors of...
International audienceNumerical integration schemes are mandatory to understand complex behaviors of...
AbstractWe consider implementations of a variable step size (and, separately, constant step size), f...
We are concerned with the efficient implementation of symplectic implicit Runge-Kutta (IRK) methods...
International audienceOrdinary differential equations are ubiquitous in scientific computing. Solvin...
In high accuracy long-time integration of differential equations, round-off errors may dominate trun...
International audienceNumerical integration schemes are mandatory to understand complex behaviors of...
International audienceNumerical integration schemes are mandatory to understand complex behaviors of...
International audienceNumerical integration schemes are mandatory to understand complex behaviors of...
AbstractWe consider implementations of a variable step size (and, separately, constant step size), f...
Symplectic Runge-Kutta schemes for integration of general Hamiltonian systems are implicit. In pract...
International audienceOrdinary differential equations are ubiquitous in scientific computing. Solvin...
Symplectic Runge-Kutta schemes for the integration of general Hamiltonian systems are implicit. In p...
Symplectic Runge-Kutta schemes for the integration of general Hamiltonian systems are implicit. In p...
In high accuracy long-time integration of differential equations, round-off errors may dominate trun...
International audienceNumerical integration schemes are mandatory to understand complex behaviors of...
International audienceNumerical integration schemes are mandatory to understand complex behaviors of...
AbstractWe consider implementations of a variable step size (and, separately, constant step size), f...
We are concerned with the efficient implementation of symplectic implicit Runge-Kutta (IRK) methods...
International audienceOrdinary differential equations are ubiquitous in scientific computing. Solvin...
In high accuracy long-time integration of differential equations, round-off errors may dominate trun...
International audienceNumerical integration schemes are mandatory to understand complex behaviors of...
International audienceNumerical integration schemes are mandatory to understand complex behaviors of...
International audienceNumerical integration schemes are mandatory to understand complex behaviors of...
AbstractWe consider implementations of a variable step size (and, separately, constant step size), f...
Symplectic Runge-Kutta schemes for integration of general Hamiltonian systems are implicit. In pract...
International audienceOrdinary differential equations are ubiquitous in scientific computing. Solvin...