Picture of a sphere with binary code

Making Strathclyde research discoverable to the world...

The Strathprints institutional repository is a digital archive of University of Strathclyde research outputs. It exposes Strathclyde's world leading Open Access research to many of the world's leading resource discovery tools, and from there onto the screens of researchers around the world.

Explore Strathclyde Open Access research content

Regular Runge-Kutta pairs

Higham, D.J. (1997) Regular Runge-Kutta pairs. Applied Numerical Mathematics, 25. pp. 229-241. ISSN 0168-9274

Full text not available in this repository. (Request a copy from the Strathclyde author)

Abstract

Time-stepping methods that guarantee to avoid spurious fixed points are said to be regular. For fixed stepsize Runge-Kutta formulas, this concept has been well studied. Here, the theory of regularity is extended to the case of embedded Runge-Kutta pairs used in variable stepsize mode with local error control. First, the limiting case of a zero error tolerance is considered. A recursive regularity test, based on the folding technique of Hairer, Iserles and Sanz-Serna (1990), is developed. It is then shown how regularity at zero tolerance carries through to the case of small tolerances. Finally, the property of regularity for all tolerances is characterized.