Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/97464 
Year of Publication: 
2013
Series/Report no.: 
Queen's Economics Department Working Paper No. 1307
Publisher: 
Queen's University, Department of Economics, Kingston (Ontario)
Abstract: 
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.
Subjects: 
Circular convolution theorem
fast Fourier transform
fractional difference
JEL: 
C22
C63
C87
Document Type: 
Working Paper

Files in This Item:
File
Size
179.15 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.