×

A fast fractional difference algorithm. (English) Zbl 1311.65009

Summary: 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\log T\). For moderate and large sample sizes, the difference in computation time is substantial.

MSC:

65C60 Computational problems in statistics (MSC2010)
62M10 Time series, auto-correlation, regression, etc. in statistics (GARCH)

Software:

R; Matlab; Ox; longmemo; fracdiff

References:

[1] BeranJ. 1994. Statistics for Long‐Memory Processes. London, England: Chapman and Hall. · Zbl 0869.60045
[2] BollerslevT, OsterreiderD, SizovaN, TauchenG. 2013. Risk and return: long‐run relations, fractional cointegration, and return predictability. Journal of Financial Economics108: 409-424.
[3] CarliniF, ManzoniM, MosconiR.2010. The impact of supply and demand imbalance on stock prices: An analysis based on fractional cointegration using Borsa Italiana ultra high frequency data. Working paper, Politecnico di Milano.
[4] ChenWW, HurvichCM, LuY. 2006. On the correlation matrix of the discrete Fourier transform and the fast solution of large Toeplitz systems for long‐memory time series. Journal of the American Statistical Association101: 812-822. · Zbl 1119.62358
[5] CooleyJW, LewisPAW, WelchPD. 1969. The fast Fourier transform and its applications. IEEE Transactions on Education12: 27-34.
[6] CooleyJW, TukeyJW. 1965. An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation19: 297-301. · Zbl 0127.09002
[7] CraigmilePF. 2003. Simulating a class of stationary Gaussian processes using the Davies-Harte algorithm, with application to long memory processes. Journal of Time Series Analysis24: 505-511. · Zbl 1035.68131
[8] DaviesRB, HarteDS. 1987. Tests for Hurst effect. Biometrika74: 95-101. · Zbl 0612.62123
[9] DoornikJA. 2006. Efficient ARFIMA modelling when the sample size is large, Unpublished manuscript: University of Oxford.
[10] DoornikJA. 2007.Object‐oriented Matrix Programming Using Ox, 3rd edn. London, England:Timberlake Consultants Press.
[11] DoornikJA, OomsM. 2003. Computational aspects of maximum likelihood estimation of autoregressive fractionally integrated moving average models. Computational Statistics and Data Analysis41: 333-348. · Zbl 1429.62391
[12] HaslettJ, RafteryAE. 1989. Space‐time modelling with long‐memory dependence: assessing Ireland’s wind power resource (with discussion). Journal of the Royal Statistical Society Series C38: 1-21.
[13] JohansenS, NielsenMØ. 2012. Likelihood inference for a fractionally cointegrated vector autoregressive model. Econometrica80: 2667-2732. · Zbl 1274.62598
[14] JohansenS, NielsenMØ. 2014. The role of initial values in conditional sum‐of‐squares estimation of nonstationary fractional time series models. QED working paper 1300: Queen’s University.
[15] MaechlerM. 2012. The fracdiff package for R, version 1.4‐2. http://cran.r‐project.org/web/packages/fracdiff/.
[16] MarinucciD, RobinsonPM. 1999. Alternative forms of fractional Brownian motion. Journal of Statistical Planning and Inference80: 111-122. · Zbl 0934.60071
[17] MathWorks. 2013. MATLAB 2013b. Natick, MA: The MathWorks Inc..
[18] OppenheimAV, SchaferRW, BuckJR. 1999.Discrete‐Time Signal Processing, 2nd edn. New Jersey: Prentice Hall.
[19] PalmaW. 2007. Long‐Memory Time Series: Theory and Methods, New Jersey: John Wiley and Sons. · Zbl 1183.62153
[20] R Core Team. 2013. R: A Language and Environment for Statistical Computing, Vienna, Austria: R Foundation for Statistical Computing. http://www.R‐project.org.
[21] SowellF. 1992. Maximum likelihood estimation of stationary univariate fractionally integrated time series models. Journal of Econometrics. 53: 165-188.
[22] StockhamTG. 1966. High‐speed convolution and correlation. Proceedings of the Spring Joint Computer Conference.28: 229-233.
[23] ZygmundA. 2003. Trigonometric Series, vol. I and II, 3rd rev. ed. Cambridge, England: Cambridge University Press.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.