scientific article; zbMATH DE number 177011

From MaRDI portal
Publication:4036847





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036847)