On the construction of m-step methods for FDEs
classification
🧮 math.NA
cs.NA
keywords
constructionformulasfractionalmethodsnumericalstepaccurateadvantages
read the original abstract
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 allow to define methods which simulate the theoretical properties of the underlying FBDF with important computational advantages. Numerical experiments are presented.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.