We provide a fast algorithm for calculating the fractional difference of a time series. In standard implementations, the calculation speed (complexity) is of order T 2, where T is the length of the time series. Our algorithm allows calculation speed of order T log2 T . For moderate and large sample sizes, the difference in computation time is substantial.
Circular convolution theorem fast Fourier transform fractional difference