Note on explicit parallel multistep Runge-Kutta methods (Q1825004)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4119523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Note on explicit parallel multistep Runge-Kutta methods |
scientific article; zbMATH DE number 4119523 |
Statements
Note on explicit parallel multistep Runge-Kutta methods (English)
0 references
1989
0 references
The authors propose a class of explicit multistep, multistage Runge-Kutta methods which is designed in such a way that all stages in each step can be computed in parallel and the computation time is comparable with that of linear multistep methods, that is, they require effectively only one right-hand side evaluation per step. In some detail a family of two-step, two-stage Runge-Kutta methods of Adams type is analyzed. Numerical examples are presented.
0 references
stability
0 references
parallel computation
0 references
explicit multistep, multistage Runge- Kutta methods
0 references
linear multistep methods
0 references
two-step, two-stage Runge-Kutta methods of Adams type
0 references
Numerical examples
0 references
0.9024895429611206
0 references
0.8766582608222961
0 references
