A new method for derivation of continuous Runge-Kutta formulas

Derivation of Efficient, Continuous, Explicit Runge-Kutta Methods

Continuous Explicit Runge-Kutta methods with the minimal number of stages are considered. These methods are continuously diierentiable if and only if one of the stages is the FSAL evaluation. A characterization of a subclass of these methods is developed for order 3,4 and 5. It is shown how the free parameters of these methods can be used either to minimize the continuous truncation error coeec...

Some Practical Runge-Kutta Formulas*

A new selection is made of the most practical of the many explicit Runge-Kutta formulas of order 4 which have been proposed. A new formula is considered, formulas are modified to improve their quality and efficiency in agreement with improved understanding of the issues, and formulas are derived which permit interpolation. It is possible to do a lot better than the pair of Fehlberg currently re...

Symbolic derivation of Runge-Kutta order conditions

Tree theory, partitions of integer numbers, combinatorial mathematics and computer algebra are the basis for the construction of a powerful and efficient symbolic package for the derivation of Runge Kutta order conditions and principal truncation error terms.

Continuous Explicit Runge-Kutta methods

A new type of singly-implicit Runge-Kutta method

Implicit Runge-Kutta methods are considered which combine the single-implicitness or diagonal-implicitness property with a zero first row in the coefficient matrix. Acceptable stability for stiff problems is retained by requiring the last stage of a step to be identical to the output value. This requirement, which corresponds to the FSAL property for explicit Runge-Kutta methods, allows the met...