Abstract
In this paper the performance of a parallel iterated Runge-Kutta method is compared versus those of the serial fouth order Runge-Kutta and Dormand-Prince methods. It was found that, typically, the runtime for the parallel method is comparable to that of the serial versions, thought it uses considerably more computational resources. A new algorithm is proposed where full parallelization is used to estimate the best stepsize for integration. It is shown that this new method outperforms the others, notably, in the integration of very large systems.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.