ardlBoundOrders {dLagM} | R Documentation |
Find optimal orders (lag structure) for ARDL bounds test
Description
Computes optimal orders (lag structure) for the short-run relationships and autoregressive part of the ARDL model prior to ARDL bounds test with the approach of Pesaran et al. (2001).
Usage
ardlBoundOrders(data = NULL , formula = NULL, ic = c("AIC", "BIC", "MASE",
"GMRAE"), max.p = 15, max.q = 15, FullSearch = FALSE )
Arguments
data |
A |
formula |
A |
ic |
Information criterion to be used in the serach for optimal orders. |
max.p |
Maximum order for the short-run coefficients. |
max.q |
Maximum auto-regressive order. |
FullSearch |
If |
Details
If FullSearch = FALSE
, this function first assumes that all p-orders are equal for the short-run relationships and finds the optimal p-order and autoregressive orders. Then, it finds the best subset of p-orders allowing them to change for each series in the short-run relationship part of the ARDL model under alternative hypothesis of ARDL bounds test.
Value
p |
An |
q |
The autoregressive order. |
Stat.table |
The selected statistic of all the considered models where all short-run relationship orders (p-orders) are equal. |
Stat.p |
The selected statistic of all possible combinations of short-run relationship orders (p-orders). The reported lag structure is the one that gives the minimum value to the chosen statistic among these combinations. |
Author(s)
Haydar Demirhan
Maintainer: Haydar Demirhan <haydar.demirhan@rmit.edu.au>