Regular Runge-Kutta pairs

D.J. Higham

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)229-241
Number of pages12
JournalApplied Numerical Mathematics
Volume25
DOIs
Publication statusPublished - 1997

Keywords

  • Error control
  • Spurious fixed point
  • Variable time-stepping
  • mathematics
  • computer science

Fingerprint

Dive into the research topics of 'Regular Runge-Kutta pairs'. Together they form a unique fingerprint.

Cite this