### Abstract

The large number of parameters in subset vector autoregressive models often leads one to procure fast, simple, and efficient alternatives or precursors to maximum likelihood estimation. We present the solution of the multivariate subset Yule-Walker equations as one such alternative. In recent work, Brockwell, Dahlhaus, and Trindade (2002), show that the Yule-Walker estimators can actually be obtained as a special case of a general recursive Burg-type algorithm. We illustrate the structure of this Algorithm, and discuss its implementation in a high-level programming language. Applications of the Algorithm in univariate and bivariate modeling are showcased in examples. Univariate and bivariate versions of the Algorithm written in Fortran 90 are included in the appendix, and their use illustrated.

Original language | English |
---|---|

Pages (from-to) | 1-68 |

Number of pages | 68 |

Journal | Journal of Statistical Software |

Volume | 8 |

State | Published - 2003 |

### Keywords

- Binary tree
- Fortran 90
- Pointer linked list
- Recursive algorithm
- Yule-Walker estimation