Page 1

Displaying 1 – 10 of 10

Showing per page

Energy-preserving Runge-Kutta methods

Elena Celledoni, Robert I. McLachlan, David I. McLaren, Brynjulf Owren, G. Reinout W. Quispel, William M. Wright (2009)

ESAIM: Mathematical Modelling and Numerical Analysis

We show that while Runge-Kutta methods cannot preserve polynomial invariants in general, they can preserve polynomials that are the energy invariant of canonical Hamiltonian systems.

Euler scheme for SDEs with non-Lipschitz diffusion coefficient : strong convergence

Abdel Berkaoui, Mireille Bossy, Awa Diop (2008)

ESAIM: Probability and Statistics

We consider one-dimensional stochastic differential equations in the particular case of diffusion coefficient functions of the form | x | α , α [ 1 / 2 , 1 ) . In that case, we study the rate of convergence of a symmetrized version of the Euler scheme. This symmetrized version is easy to simulate on a computer. We prove its strong convergence and obtain the same rate of convergence as when the coefficients are Lipschitz.

Euler scheme for SDEs with non-Lipschitz diffusion coefficient: strong convergence

Abdel Berkaoui, Mireille Bossy, Awa Diop (2007)

ESAIM: Probability and Statistics

We consider one-dimensional stochastic differential equations in the particular case of diffusion coefficient functions of the form |x|α, α ∈ [1/2,1). In that case, we study the rate of convergence of a symmetrized version of the Euler scheme. This symmetrized version is easy to simulate on a computer. We prove its strong convergence and obtain the same rate of convergence as when the coefficients are Lipschitz.

Explicit two-step Runge-Kutta methods

Zdzisław Jackiewicz, Rosemary Anne Renaut, Marino Zennaro (1995)

Applications of Mathematics

The explicit two-step Runge-Kutta (TSRK) formulas for the numerical solution of ordinary differential equations are analyzed. The order conditions are derived and the construction of such methods based on some simplifying assumptions is described. Order barriers are also presented. It turns out that for order p 5 the minimal number of stages for explicit TSRK method of order p is equal to the minimal number of stages for explicit Runge-Kutta method of order p - 1 . Numerical results are presented which...

Currently displaying 1 – 10 of 10

Page 1