On the construction and properties of m-step methods for FDEs

In this paper we consider the numerical solution of fractional differential equations by means of $m$-step recursions. The construction of such formulas can be obtained in many ways. Here we study a technique based on the rational approximation of the generating functions of fractional backward differentiation formulas (FBDFs). Accurate approximations lead to the definition of methods which simulate the underlying FBDF, with important computational advantages. Numerical experiments are presented.