Abstract

The BDS statistic has proved to be one of several useful nonlinear diagnostics. It has been shown to have good power against many nonlinear alternatives, and its asymptotic properties as a residual diagnostic are well understood. Furthermore, extensive Monte Carlo results have proved it useful in relatively small samples. However, the BDS test is not trivial to calculate, and is even more difficult to deal with if one wants the speed necessary to make bootstrap resampling feasible. This short paper presents a fast algorithm for the BDS statistic, and outlines how these speed improvements are achieved. Source code in the C programming language is included.

Recommended Citation

Blake LeBaron (1997) "A Fast Algorithm for the BDS Statistic ", Studies in Nonlinear Dynamics & Econometrics: Vol. 2: No. 2, Algorithm 1.
http://www.bepress.com/snde/vol2/iss2/algorithm1

Related Files

lebaron_code.zip (8 kB)
Code