A special family of Runge-Kutta methods for solving stiff differential equations

An efficient way of implementing Implicit Runge-Kutta Methods was proposed by Butcher [3]. He showed that the most efficient methods when using this implementation are those whose characteristic polynomial of the Runge-Kutta matrix has a single reals-fold zero. In this paper we will construct such a family of methods and give some results concerning their maximum attainable order and stability properties. Some consideration is also given to showing how these methods can be efficiently implemented and, in particular, how local error estimates can be obtained by the use of embedding techniques.