### Abstract

How can small-scale parallelism best be exploited in the solution of nonstiff initial value problems? It is generally accepted that only modest gains inefficiency are possible, and it is often the case that ldquofastrdquo parallel algorithms have quite crude error control and stepsize selection components. In this paper we consider the possibility of using parallelism to improvereliability andfunctionality rather than efficiency. We present an algorithm that can be used with any explicit Runge-Kutta formula. The basic idea is to take several smaller substeps in parallel with the main step. The substeps provide an interpolation facility that is essentially free, and the error control strategy can then be based on a defect (residual) sample. If the number of processors exceeds (p - 1)/2, wherep is the order of the Runge-Kutta formula, then the interpolant and the error control scheme satisfy very strong reliability conditions. Further, for a given orderp, the asymptotically optimal values for the substep lengths are independent of the problem and formula and hence can be computed a priori. Theoretical comparisons between the parallel algorithm and optimal sequential algorithms at various orders are given. We also report on numerical tests of the reliability and efficiency of the new algorithm, and give some parallel timing statistics from a 4-processor machine.

Original language | English |
---|---|

Pages (from-to) | 647-663 |

Number of pages | 16 |

Journal | BIT Numerical Mathematics |

Volume | 31 |

Issue number | 4 |

DOIs | |

Publication status | Published - Dec 1991 |

### Keywords

- Runge-Kutta
- parallelism
- defect-interpolation
- numerical mathematics

## Fingerprint Dive into the research topics of 'Parallel defect control'. Together they form a unique fingerprint.

## Cite this

Enright, W. H., & Higham, D. J. (1991). Parallel defect control.

*BIT Numerical Mathematics*,*31*(4), 647-663. https://doi.org/10.1007/BF01933179