Parallel iteration across the steps of high-order Runge-Kutta methods for nonstiff initial value problems (Q1903642): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 14:01, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Parallel iteration across the steps of high-order Runge-Kutta methods for nonstiff initial value problems |
scientific article |
Statements
Parallel iteration across the steps of high-order Runge-Kutta methods for nonstiff initial value problems (English)
0 references
21 May 1996
0 references
One of the methods used in parallel integration of nonstiff initial value problems is the parallel iteration across the steps, where the solver is based on predictor-corrector iteration. The authors deal with a parallel iterated Runge-Kutta method. Although their method has less parallelism as other known algorithms based on across steps parallel iteration, numerical experiments show that it can be up to 15 times faster.
0 references
parallel computation
0 references
numerical example
0 references
nonstiff initial value problems
0 references
predictor-corrector iteration
0 references
Runge-Kutta method
0 references