Implicit two-derivative Runge–Kutta collocation methods for systems of initial value problems

We introduce a new class of implicit two-derivative Runge–Kutta collocation methods designed for the numerical solution of systems of equations and show how they have been implemented in an efficient parallel computing environment. We also discuss the difficulty associated with large systems and how, in this case, one must take advantage of the second derivative terms in the methods. We consider two modified versions of the methods which are suitable for solving stable systems. The first modification involves the introduction of collocation at the two end points of the integration interval in addition to the Gaussian interior collocation points and the second involves the introduction of a different class of basic second derivative methods. With these modifications, fewer function evaluations per step are achieved, resulting into methods that are cheap and easy to implement. The stability properties of these methods are investigated and numerical results are given for each of the modified version to illustrate the computational efficiency of the modified methods.