Short-term recursions for fractional differential equations

This paper deals with the numerical solution of Fractional Differential Equations by means of m-step recursions. For the construction of such formulas, we study a technique based on a rational approximation of the generating functions of Fractional Backward Differentiation Formulas (FBDFs). The so-defined methods simulate very well the properties of the underlying FBDFs with important computational advantages. This fact becomes particularly evident especially in the case when they are used for solving problems arising from the semi-discretization of fractional partial differential equations.