No label defined (Q4036847)
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 177011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 177011 |
Statements
18 May 1993
0 references
parallel methods
0 references
\(A\)-stability
0 references
\(A\)-stable methods
0 references
directed graphs
0 references
digraphs
0 references
explicit Runge-Kutta methods
0 references
implicit Runge-Kutta methods
0 references
0.9110536575317384
0 references
0.8816290497779846
0 references
0.8816289305686951
0 references
0.860617458820343
0 references
[For the entire collection see Zbl 0755.00007.] Parallel Runge-Kutta schemes are studied by using the theory of directed graphs which is used in proving the connection between the potential for parallelism and order. Theorem 1 shows that the maximal order of an explicit Runge-Kutta method that can be implemented in \(\mu\) parallel stages is \(\mu\), irrespective of the number of processors. The virtue of the proof is in demonstrating the potential of digraphs as an analytic tool. A clear implication of the theorem is that the potential for parallelism of the explicit Runge-Kutta methods is limited. The attention is shifted to the class of singly-diagonally implicit Runge-Kutta methods. Some parallelisable singly diagonally implicit Runge-Kutta schemes with 4-stage and 4th order are investigated. The proposed methods are \(A\)-stable.
0 references