A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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 thearXiv:1601.02245v1 fatcat:f6yesf5fdbgnthjkf6pybwzsli