loading...
Iterated Runge-Kutta methods on distributed memory multiprocessors
San Remo, Italy January 25-January 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EMPDP.1995.3891593rd Euromicro Workshop on Parallel an ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
T. Rauber, Comput. Sci. Dept., Saarlandes Univ., Saarbrucken, Germany
G. Runger, Comput. Sci. Dept., Saarlandes Univ., Saarbrucken, Germany
In this article, we consider the iterated Runge-Kutta (IRK) method which is an iteration method based on a predictor-corrector scheme for the solution of ordinary differential equations. The method uses embedded formulae to control the stepsize. We present different algorithms of the IRK method on distributed memory multiprocessors using appropriate communication primitives. The theoretical performance analysis and a runtime simulation allow us to value the presented algorithms. An implementation on the Intel iPSC/860 confirms the predicted runtimes.
Index Terms:
differential equations; Runge-Kutta methods; iterative methods; distributed memory systems; parallel algorithms; Runge-Kutta methods; distributed memory multiprocessors; iterated Runge-Kutta; iteration method; predictor-corrector scheme; ordinary differential equations; embedded formulae; performance analysis
Citation:
T. Rauber, G. Runger, "Iterated Runge-Kutta methods on distributed memory multiprocessors," pdp, pp.12, 3rd Euromicro Workshop on Parallel and Distributed Processing, 1995
Usage of this product signifies your acceptance of the Terms of Use.