Generalized linear multistep methods for ordinary differential equations

In this paper we use the theoretical framework of General Linear Methods (GLMs) to analyze and generalize the class of Cash's Modified Extended Backward Differentiation Formulae (MEBDF). Keeping the structure of MEBDF and their computational cost we propose a more general class of methods that can be viewed as a composition of modified linear multistep methods. These new methods are characterized by smaller error constants and possibly larger angles of A(α)-stability. Numerical experiments which confirm the good performance of these methods on a set of stiff problems are also reported.