Explicit, high-order Runge-Kutta-Nyström methods for parallel computers

  • Sommeijer B
  • 4

    Readers

    Mendeley users who have this article in their library.
  • 39

    Citations

    Citations of this article.

Abstract

The paper describes the construction of explicit Runge-Kutta-Nyström (RKN) methods of arbitrarily high order. The order is borrowed from an underlying implicit RKN method. For the approximate solution of this method, an iteration scheme is defined. Prescribing a fixed number of iterations, the resulting scheme is an explicit RKN method. The iteration scheme is defined in such a way that many of the right-hand side evaluations can be done concurrently. As a result, explicit RKN schemes of order p are obtained which require, on a parallel computer, approximately p/2 right-hand side evaluations per step. Both in fixed- and variable-step mode, the schemes are compared with existing (sequentiasl) high-order RKN methods from the literature and are shown to demonstrate superior behaviour. © 1993.

Author-supplied keywords

  • Explicit Runge-Kutta-Nyström methods
  • error control
  • parallelism
  • predictor-corrector methods

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • B. P. Sommeijer

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free