Although Runge–Kutta and partitioned Runge–Kutta methods are known to formally satisfy discrete multisymplectic conservation laws when applied to multi-Hamiltonian PDEs, they do not always lead to well-defined numerical methods. We consider the case study of the nonlinear Schrödinger equation in detail, for which the previously known multisymplectic integrators are fully implicit and based on t...

This paper investigates numerical methods for direct decoupled sensitivity and discrete adjoint sensitivity analysis of stiff systems based on implicit Runge Kutta schemes. Efficient implementations of tangent linear and adjoint schemes are discussed for two families of methods: fully implicit three-stage Runge Kutta and singly diagonally-implicit Runge Kutta. High computational efficiency is a...

Strong stability preserving (SSP) high order Runge–Kutta time discretizations were developed for use with semi-discrete method of lines approximations of hyperbolic partial differential equations, and have proven useful in many other applications. These high order time discretization methods preserve the strong stability properties of first order explicit Euler time stepping. In this paper we a...

Block Runge-Kutta formulae suitable for the approximate numerical integration of initial value problems for first order systems of ordinary differential equations are derived. Considered in detail are the problems of varying both order and stepsize automatically. This leads to a class of variable order block explicit Runge-Kutta formulae for the integration of nonstiff problems and a class of v...

Practical, structure-preserving methods for integrating classical Heisenberg spin systems are discussed. Two new integrators are derived and compared, including (1) a symmetric energy and spin-length preserving integrator based on a Red-Black splitting of the spin sites combined with a staggered timestepping scheme and (2) a (Lie-Poisson) symplectic integrator based on Hamiltonian splitting. Th...

Although Runge–Kutta and partitioned Runge–Kutta methods are known to formally satisfy discrete multisymplectic conservation laws when applied to multi-Hamiltonian PDEs, they do not always lead to well-defined numerical methods. We consider the case study of the nonlinear Schrödinger equation in detail, for which the previously known multisymplectic integrators are fully implicit and based on t...

Abstract— General linear methods (GLM) apply to a large family of numerical methods for ordinary differential equations, with RungeKutta (RK) and Almost Runge-Kutta (ARK) methods as two out of a number of special cases. In this paper, we have investigated the efficacy of Richardson extrapolation (RE) technique as a means of obtaining viable and acceptable estimates of the local truncation error...

In this paper we develop a technique for avoiding the order reduction caused by nonconstant boundary conditions in the methods called splitting, alternating direction or, more generally, fractional step methods. Such methods can be viewed as the combination of a semidiscrete in time procedure with a special type of additive Runge–Kutta method, which is called the fractional step Runge–Kutta met...

This study utilized combination of phase plots,time steps distribution and adaptive time steps Runge-Kutta and f if th order algorithms to investigate a harmonically Duff ing oscillator.The object is to visually compare fourth and f if th order Runge-Kutta algorithms performance as tools for seeking the chaotic solutions of a harmonically excited Duffing oscillator.Though fif th order algorithm...

Recently, the Runge-Kutta methods, obtained via Taylor’s expansion is exist in the literature. In this study, we have derived explicit methods for problems of the form y′ = f(y) including second and third derivatives , by considering available Two-Derivative Runge-Kutta methods (TDRK). The methods use one evaluation of first derivative, one evaluation of second derivative and many evaluations o...