The fast iterated bootstrap - Aix-Marseille Université Access content directly
Journal Articles Journal of Econometrics Year : 2020

The fast iterated bootstrap


The standard forms of bootstrap iteration are very computationally demanding. As a result, there have been several attempts to alleviate the computational burden by use of approximations. In this paper, we extend the fast double bootstrap of Davidson and MacKinnon (2007) to higher orders of iteration, and provide algorithms for their implementation. The new methods make computational demands that increase only linearly with the level of iteration, unlike standard procedures, whose demands increase exponentially. In a series of simulation experiments, we show that the fast triple bootstrap improves on both the standard and fast double bootstraps, in the sense that it suffers from less size distortion under the null with no accompanying loss of power.
Fichier principal
Vignette du fichier
The fast iterated bootstrap.pdf (424.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02965001 , version 1 (09-02-2021)


Attribution - NonCommercial - NoDerivatives



Russell Davidson, Mirza Trokić. The fast iterated bootstrap. Journal of Econometrics, 2020, 218 (2), pp.451-475. ⟨10.1016/j.jeconom.2020.04.025⟩. ⟨hal-02965001⟩
40 View
36 Download



Gmail Facebook Twitter LinkedIn More