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...

Generalized Runge-Kutta Processes for stiff systems of ordinary differential equations usually require an accurate evaluation of a Jacobian at every step. However, it is possible to derive processes which are Internally S-stable when an accurate Jacobian is used but still remain consistent and highly stable if an approximate Jacobian is used. It is shown that these processes require at least as...

We study Runge{Kutta methods for the integration of ordinary diierential equations and their retention of algebraic invariants. As a general rule, we derive two conditions for the retention of such invariants. The rst is a condition on the co-eecients of the methods, the second is a pair of partial diierential equations that otherwise must be obeyed by the invariant. The cases related to the re...

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....

Citation A comparison of high-order explicit Runge–Kutta, extrapolation, and deferred correction methods in serial and We compare the three main types of high-order one-step initial value solvers: extrapolation, spectral deferred correction, and embedded Runge–Kutta pairs. We consider orders four through twelve, including both serial and parallel implementations. We cast extrapolation and defer...

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...

‎Second derivative general linear methods (SGLMs) as an extension‎ ‎of general linear methods (GLMs) have been introduced to improve‎ ‎the stability and accuracy properties of GLMs‎. ‎The coefficients of‎ ‎SGLMs are given by six matrices‎, ‎instead of four matrices for‎ ‎GLMs‎, ‎which are obtained by solving nonlinear systems of order and‎ ‎usually Runge--Kutta stability conditions‎. ‎In this p...