ON THE RECURSIVE FITTING OF SUBSET AUTOREGRESSIONS

Jack H. W. Penm and R. D. Terrell

Journal of Time Series Analysis, 1982, vol. 3, issue 1, 43-59

Abstract: Abstract. In fitting a vector autoregressive process which may include lags up to and including lag K, we may wish to search for the subset vector autoregressive process of size k (where k is the number of lags with non‐zero coefficient matrices, k= 1, 2, K) which has the minimum generalized residual variance. This paper provides a recursive procedure, which is initialized by evaluating all‘forwardand’‘backward’ autoregressions in which k= 1. The recursion then allows one to develop successively all subsets of size k= 2, k= 3 up to k=K. The optimum subset vector autoregression is found by employing the proposed recursive procedures in conjunction with model selection criteria. This approach is used on simulated data to assess its performance and to re‐examine the annual trappings of the Canadian lynx investigated by Tong (1977).

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
https://doi.org/10.1111/j.1467-9892.1982.tb00329.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jtsera:v:3:y:1982:i:1:p:43-59

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0143-9782

Access Statistics for this article

Journal of Time Series Analysis is currently edited by M.B. Priestley

More articles in Journal of Time Series Analysis from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().