A note on the efficient implementation of implicit methods for ODEs

The use of implicit methods for ODEs, e.g. implicit Runge-Kutta schemes, requires the solution of nonlinear systems of algebraic equations of dimension s.m, where m is the size of the continuous differential problem to be approximated. Usually, the solution of this system represents the most time-consuming section in the implementation of such methods. Consequently, the efficient solution of this section would improve their performance. In this paper, we propose a new iterative procedure to solve such equations on sequential computers.