A Fast Fractional Difference Algorithm

Andreas Noack Jensen, Morten Ørregaard Nielsen

Abstract

We provide a fast algorithm for calculating the fractional difference of a time series.
In standard implementations, the calculation speed (number of arithmetic operations) is of order T 2, where T is the length of the time series. Our algorithm allows calculation speed of order T logT . For moderate and large sample sizes, the difference in computation time is substantial.
Original languageEnglish
Place of PublicationKbh.
PublisherØkonomisk institut, Københavns Universitet
Number of pages10
Publication statusPublished - 2013
SeriesUniversity of Copenhagen. Institute of Economics. Discussion Papers (Online)
Number4
Volume13
ISSN1601-2461

Keywords

  • Faculty of Science
  • Circular convolution theorem
  • fast Fourier transform
  • fractional difference

Cite this