Global error versus tolerance for explicit Runge-Kutta methods

Desmond J. Higham

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

Initial value solvers typically input a problem specification and an error tolerance, and output an approximate solution. Faced with this situation many users assume, or hope for, a linear relationship between the global error and the tolerance. In this paper we examine the potential for such 'tolerance proportionality' in existing explicit Runge-Kutta algorithms. We take account of recent developments in the derivation of high-order formulae, defect control strategies, and interpolants for continuous solution and first derivative approximations. Numerical examples are used to verify the theoretical predictions. The analysis draws on the work of Stetter, and the numerical testing makes use of the nonstiff DETEST package of Enright and Pryce.
LanguageEnglish
Pages457-480
Number of pages23
JournalIMA Journal of Numerical Analysis
Volume11
Issue number4
DOIs
Publication statusPublished - Oct 1991

Fingerprint

Runge Kutta methods
Explicit Methods
Runge-Kutta Methods
Tolerance
Continuous Solution
Interpolants
Runge-Kutta
Control Strategy
Approximate Solution
Defects
Higher Order
Specification
Verify
Derivatives
Specifications
Derivative
Numerical Examples
Testing
Prediction
Output

Keywords

  • Runge-Kutta Methods
  • numerical mathematics
  • high-order formulae
  • DETEST package

Cite this

Higham, Desmond J. / Global error versus tolerance for explicit Runge-Kutta methods. In: IMA Journal of Numerical Analysis. 1991 ; Vol. 11, No. 4. pp. 457-480.
@article{1445ddc7b03a49dfb59e9a67107556b7,
title = "Global error versus tolerance for explicit Runge-Kutta methods",
abstract = "Initial value solvers typically input a problem specification and an error tolerance, and output an approximate solution. Faced with this situation many users assume, or hope for, a linear relationship between the global error and the tolerance. In this paper we examine the potential for such 'tolerance proportionality' in existing explicit Runge-Kutta algorithms. We take account of recent developments in the derivation of high-order formulae, defect control strategies, and interpolants for continuous solution and first derivative approximations. Numerical examples are used to verify the theoretical predictions. The analysis draws on the work of Stetter, and the numerical testing makes use of the nonstiff DETEST package of Enright and Pryce.",
keywords = "Runge-Kutta Methods, numerical mathematics, high-order formulae, DETEST package",
author = "Higham, {Desmond J.}",
year = "1991",
month = "10",
doi = "10.1093/imanum/11.4.457",
language = "English",
volume = "11",
pages = "457--480",
journal = "IMA Journal of Numerical Analysis",
issn = "0272-4979",
number = "4",

}

Global error versus tolerance for explicit Runge-Kutta methods. / Higham, Desmond J.

In: IMA Journal of Numerical Analysis, Vol. 11, No. 4, 10.1991, p. 457-480.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Global error versus tolerance for explicit Runge-Kutta methods

AU - Higham, Desmond J.

PY - 1991/10

Y1 - 1991/10

N2 - Initial value solvers typically input a problem specification and an error tolerance, and output an approximate solution. Faced with this situation many users assume, or hope for, a linear relationship between the global error and the tolerance. In this paper we examine the potential for such 'tolerance proportionality' in existing explicit Runge-Kutta algorithms. We take account of recent developments in the derivation of high-order formulae, defect control strategies, and interpolants for continuous solution and first derivative approximations. Numerical examples are used to verify the theoretical predictions. The analysis draws on the work of Stetter, and the numerical testing makes use of the nonstiff DETEST package of Enright and Pryce.

AB - Initial value solvers typically input a problem specification and an error tolerance, and output an approximate solution. Faced with this situation many users assume, or hope for, a linear relationship between the global error and the tolerance. In this paper we examine the potential for such 'tolerance proportionality' in existing explicit Runge-Kutta algorithms. We take account of recent developments in the derivation of high-order formulae, defect control strategies, and interpolants for continuous solution and first derivative approximations. Numerical examples are used to verify the theoretical predictions. The analysis draws on the work of Stetter, and the numerical testing makes use of the nonstiff DETEST package of Enright and Pryce.

KW - Runge-Kutta Methods

KW - numerical mathematics

KW - high-order formulae

KW - DETEST package

UR - http://dx.doi.org/10.1093/imanum/11.4.457

U2 - 10.1093/imanum/11.4.457

DO - 10.1093/imanum/11.4.457

M3 - Article

VL - 11

SP - 457

EP - 480

JO - IMA Journal of Numerical Analysis

T2 - IMA Journal of Numerical Analysis

JF - IMA Journal of Numerical Analysis

SN - 0272-4979

IS - 4

ER -