A parallel matrix-free implementation of a Runge-Kutta code (1997)
| Venue: | IN NUMERICAL MATHEMATICS |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Burrage97aparallel,
author = {Kevin Burrage and Craig Eldershaw and Roger Sidje},
title = {A parallel matrix-free implementation of a Runge-Kutta code},
booktitle = {IN NUMERICAL MATHEMATICS},
year = {1997},
pages = {45--50},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
It is known that matrix-free numerical implementations for solving stiff ordinary differential equations (ODEs) can be considerably more effective than implementations which rely on direct linear algebra techniques to solve the implicit equations governing the stage values. In this paper it will be shown how fully implicit, high order Runge-Kutta methods can be efficiently implemented in a matrix-free, parallel environment. The advantage of this is that no new parallel algorithms need be developed and that existing sequential methods that are adpated using these techniques need have no special structure (such as singly implicitness). This is demonstrated by the conversion of an existing Radau IIA method (RADAU5) to a matrix-free implementation using a dynamically pre-conditioned GMRES algorithm to solve the appropriate linear systems. Numerical results are presented for an implementation on a shared memory SGI Power Challenge and show the efficacy of this approach.
Keyphrases
parallel matrix-free implementation runge-kutta code shared memory sgi power challenge direct linear algebra technique implicit equation numerical result stage value stiff ordinary differential equation sequential method new parallel algorithm parallel environment matrix-free implementation matrix-free numerical implementation radau iia method pre-conditioned gmres algorithm special structure high order runge-kutta method appropriate linear system
