Bollerslev and Mikkelson(1996) FIEGARCH Model
This is an example of estimating a FIEGARCH (Fractionally Integrated EGARCH) model from Bollerslev and Mikkelson(1996), "Modeling and pricing long memory in stock market volatility", Journal of Econometrics, vol 73, pp 151-184. The first example file does a FIGARCH, though in a bit more complicated setting than for the Baillie, Bollerslev, Mikkelson example (http://www.estima.com/forum/viewtopic.php?f=8&t=1593), since it also includes a shift variable for the variance; the second does the FIEGARCH.
Note that the FIEGARCH estimates take a very long time with a data set this size. The FIGARCH estimates, by contrast, are quite quick because the fractional integration is applied to the observable eps^2, which depends only upon the data and the mean parameters. As a result, that can be computed once at the start of each function evaluation. The DIFF instruction with FRACTION executes very quickly because it works in the frequency domain; as a result, the time requirement is on the order of T log2 T. FIEGARCH applies fractional integration to a function of eps/sqrt(h). Since the h needs to be computed recursively, there is no good alternative to crunching out the long lag filter at each data point. As a result, the time requirement is on the order of T(T+1)/2. When T is 9000, the timing ratio between FIEGARCH and FIGARCH is on the order of 100's.
Note that the FIEGARCH estimates take a very long time with a data set this size. The FIGARCH estimates, by contrast, are quite quick because the fractional integration is applied to the observable eps^2, which depends only upon the data and the mean parameters. As a result, that can be computed once at the start of each function evaluation. The DIFF instruction with FRACTION executes very quickly because it works in the frequency domain; as a result, the time requirement is on the order of T log2 T. FIEGARCH applies fractional integration to a function of eps/sqrt(h). Since the h needs to be computed recursively, there is no good alternative to crunching out the long lag filter at each data point. As a result, the time requirement is on the order of T(T+1)/2. When T is 9000, the timing ratio between FIEGARCH and FIGARCH is on the order of 100's.