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

Citations of this article
Mendeley users who have this article in their library.
Get full text


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.




Sommeijer, B. P. (1993). Explicit, high-order Runge-Kutta-Nyström methods for parallel computers. Applied Numerical Mathematics, 13(1–3), 221–240. https://doi.org/10.1016/0168-9274(93)90145-H

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free