Parallel iteration across the steps of high order Runge-Kutta methods forn onstiff initial value problems:

Abstract: "For the parallel integration of nonstiff initial value problems (IVPs), three main approaches can be distinguished: approaches based on 'parallelism across the problem', 'parallelism across the method' and on 'parallelism across the steps'. The first typ...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Houwen, Pieter J. van der (VerfasserIn), Sommeijer, Ben P. ca. 20. Jh (VerfasserIn), Veen, W. A. van der (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Amsterdam 1993
Schriftenreihe:Centrum voor Wiskunde en Informatica <Amsterdam> / Afdeling Numerieke Wiskunde: Report NM 1993,13
Schlagworte:
Zusammenfassung:Abstract: "For the parallel integration of nonstiff initial value problems (IVPs), three main approaches can be distinguished: approaches based on 'parallelism across the problem', 'parallelism across the method' and on 'parallelism across the steps'. The first type of parallelism does not require special integration methods and can be exploited within any available IVP solver. The method-parallelism approach received much attention, particularly within the class of explicit Runge-Kutta methods originating from fixed point iteration of implicit Runge-Kutta methods of Gaussian type. The construction and implementation on a parallel machine of such methods is extremely simple
Since the computational work per processor is modest with respect to the number of data to be exchanged between the various processors, this type of parallelism is most suitable for shared memory systems. The required number of processors is roughly half the order of the generating Runge-Kutta method and the speed-up with respect to a good sequential IVP solver is about a factor of 2. The third type of parallelism (step- parallelism) can be achieved in any IVP solver based on predictor-corrector iteration and requires the processors to communicate after each full iteration. If the iterations have sufficient computational volume, then the step-parallel approach may be suitable for implementation on distributed memory systems
Most step-parallel methods proposed so far employ a large number of processors, but lack the property of robustness, due to a poor convergence behaviour in the iteration process. Hence, the effective speed-up is rather poor. The dynamic step-parallel iteration process proposed in the present paper is less massively parallel, but turns out to be sufficiently robust to achieve speed-up factors up to 15.
Beschreibung:15 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!