Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/171904 
Year of Publication: 
2017
Citation: 
[Journal:] Econometrics [ISSN:] 2225-1146 [Volume:] 5 [Issue:] 1 [Publisher:] MDPI [Place:] Basel [Year:] 2017 [Pages:] 1-16
Publisher: 
MDPI, Basel
Abstract: 
This paper considers the algorithmic implementation of the heteroskedasticity and autocorrelation consistent (HAC) estimation problem for covariance matrices of parameter estimators. We introduce a new algorithm, mainly based on the fast Fourier transform, and show via computer simulation that our algorithm is up to 20 times faster than well-established alternative algorithms. The cumulative effect is substantial if the HAC estimation problem has to be solved repeatedly. Moreover, the bandwidth parameter has no impact on this performance. We provide a general description of the new algorithm as well as code for a reference implementation in R.
Subjects: 
GMM
HAC estimation
Newey-West estimator
Toeplitz matrices
discrete Fourier transformation (DFT)
R
JEL: 
C01
C55
C58
C63
G17
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article

Files in This Item:
File
Size
311.14 kB





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