The subject matter of this paper is the recovery of invariants and conservation laws of ordinary diierential systems by numerical methods. We prove that the most likely candidates for this task, Runge{Kutta schemes, fail to stay on manifolds deened by r-tensors with r 3. As an alternative, we suggest diieomorphically mapping complicated man-ifolds to simpler ones. This procedure allows for reco...

This paper presents a family of Runge{Kutta type integration schemes of arbitrarily high order for di erential equations evolving on manifolds. We prove that any classical Runge{Kutta method can be turned into an invariant method of the same order on a general homogeneous manifold, and present a family of algorithms that are relatively simple to implement.

The space-time discontinuous Galerkin discretization of the compressible NavierStokes equations results in a non-linear system of algebraic equations, which we solve with a local pseudo-time stepping method. Explicit Runge-Kutta methods developed for the Euler equations are unsuitable for this purpose as a severe stability constraint linked to the viscous part of the equations must be satisfied...

The Kinetic PreProcessor (KPP) is a widely used software environment which generates Fortran90, Fortran77, Matlab, or C code for the simulation of chemical kinetic systems. High computational efficiency is attained by exploiting the sparsity pattern of the Jacobian and Hessian. In this paper we report on the implementation of two new families of stiff numerical integrators in the new version 2....

A Runge–Kutta method takes small time steps, to approximate the solution to an initial value problem. How accurate is this approximation? If the error is asymptotically proportional to hp, where h is the stepsize, the Runge–Kutta method is said to have “order” p. To find p, write the exact solution, after a single time-step, as a Taylor series, and compare with the Taylor series for the approxi...

Introduction PACT Abstract A parallel implementation for multi-implicit Runge-Kutta methods with real eigen-values is described. The parallel method is analysed and the algorithm is devised. For the problem with d domains, the amount within the s-stage Runge-Kutta method, associated with the solution of system, is proportional to (sd) 3. The proposed parallelisation transforms the above system ...