The numerical solution of fractional differential equations: Speed versus accuracy

This paper is concerned with the development of efficient algorithms for the approximate solution of fractional differential equations of the form D(alpha)y(t) = f(t, y(t)), alpha is an element ofR(+)-N. (dagger) We briefly review standard numerical techniques for the solution of (t) and we consider how the computational cost may be reduced by taking into account the structure of the calculations to be undertaken. We analyse the fixed memory principle and present an alternative nested mesh variant that gives a good approximation to the true solution at reasonable computational cost. We conclude with some numerical examples.