zbMATH — the first resource for mathematics

A parallel matrix-free implementation of a Runge-Kutta code. (English) Zbl 1193.65118
Cranny, Tim (ed.) et al., Joint Australian-Taiwanese workshop on analysis and applications, Brisbane, Australia, March 31–April 04, 1997. Canberra: Australian National University, Centre for Mathematics and its Applications (ISBN 0-7315-5201-6/pbk). Proceedings of the Centre for Mathematics and its Applications, Australian National University 37, 83-88 (1999).
Summary: 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.
For the entire collection see [Zbl 1127.00307].

65L06 Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations