g13ddf fits a vector autoregressive moving average (VARMA) model to an observed vector of time series using the method of Maximum Likelihood (ML). Standard errors of parameter estimates are computed along with their appropriate correlation matrix. The routine also calculates estimates of the residual series.

2 Specification

Fortran Interface

Subroutine g13ddf (

k, n, ip, iq, mean, par, npar, qq, kmax, w, parhld, exact, iprint, cgetol, maxcal, ishow, niter, rlogl, v, g, cm, ldcm, ifail)

Integer, Intent (In)	::	k, n, ip, iq, npar, kmax, iprint, maxcal, ishow, ldcm
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	niter
Real (Kind=nag_wp), Intent (In)	::	w(kmax,n), cgetol
Real (Kind=nag_wp), Intent (Inout)	::	par(npar), qq(kmax,k), v(kmax,n), cm(ldcm,npar)
Real (Kind=nag_wp), Intent (Out)	::	rlogl, g(npar)
Logical, Intent (In)	::	mean, parhld(npar), exact

C Header Interface

#include <nag.h>

void

g13ddf_ (const Integer *k, const Integer *n, const Integer *ip, const Integer *iq, const logical *mean, double par[], const Integer *npar, double qq[], const Integer *kmax, const double w[], const logical parhld[], const logical *exact, const Integer *iprint, const double *cgetol, const Integer *maxcal, const Integer *ishow, Integer *niter, double *rlogl, double v[], double g[], double cm[], const Integer *ldcm, Integer *ifail)

The routine may be called by the names g13ddf or nagf_tsa_multi_varma_estimate.

3 Description

Let

W_{t} = {(w_{1 t}, w_{2 t}, \dots, w_{k t})}^{T}

, for

t = 1, 2, \dots, n

, denote a vector of

k

time series which is assumed to follow a multivariate ARMA model of the form

\begin{array}{l} W_{t} - μ = & ϕ_{1} (W_{t - 1} - μ) + ϕ_{2} (W_{t - 2} - μ) + \dots + ϕ_{p} (W_{t - p} - μ) \\ + ε_{t} - θ_{1} ε_{t - 1} - θ_{2} ε_{t - 2} - \dots - θ_{q} ε_{t - q} \end{array}

(1)

where

ε_{t} = {(ε_{1 t}, ε_{2 t}, \dots, ε_{k t})}^{T}

, for

t = 1, 2, \dots, n

, is a vector of

k

residual series assumed to be Normally distributed with zero mean and positive definite covariance matrix

Σ

. The components of

ε_{t}

are assumed to be uncorrelated at non-simultaneous lags. The

ϕ_{i}

and

θ_{j}

are

k \times k

matrices of parameters.

{ϕ_{i}}

, for

i = 1, 2, \dots, p

, are called the autoregressive (AR) parameter matrices, and

{θ_{i}}

, for

i = 1, 2, \dots, q

, the moving average (MA) parameter matrices. The parameters in the model are thus the

p

(

k \times k

)

ϕ

-matrices, the

q

(

k \times k

)

θ

-matrices, the mean vector,

μ

, and the residual error covariance matrix

Σ

. Let

A (ϕ) = {[\begin{array}{l} ϕ_{1} & I & 0 & . & . & . & 0 \\ ϕ_{2} & 0 & I & 0 & . & . & 0 \\ . & . \\ . & . \\ . & . \\ ϕ_{p - 1} & 0 & . & . & . & 0 & I \\ ϕ_{p} & 0 & . & . & . & 0 & 0 \end{array}]}_{p k \times p k} and B (θ) = {[\begin{array}{l} θ_{1} & I & 0 & . & . & . & 0 \\ θ_{2} & 0 & I & 0 & . & . & 0 \\ . & . \\ . & . \\ . & . \\ θ_{q - 1} & 0 & . & . & . & . & I \\ θ_{q} & 0 & . & . & . & . & 0 \end{array}]}_{q k \times q k}

where

I

denotes the

k \times k

identity matrix.

The ARMA model (1) is said to be stationary if the eigenvalues of

A (ϕ)

lie inside the unit circle. Similarly, the ARMA model (1) is said to be invertible if the eigenvalues of

B (θ)

lie inside the unit circle.

The method of computing the exact likelihood function (using a Kalman filter algorithm) is discussed in Shea (1987). A quasi-Newton algorithm (see Gill and Murray (1972)) is then used to search for the maximum of the log-likelihood function. Stationarity and invertibility are enforced on the model using the reparameterisation discussed in Ansley and Kohn (1986). Conditional on the maximum likelihood estimates being equal to their true values the estimates of the residual series are uncorrelated with zero mean and constant variance

Σ

You have the option of setting an argument (exact to .FALSE.) so that g13ddf calculates conditional maximum likelihood estimates (conditional on

W_{0} = W_{−1} = \dots = W_{1 - p} = ε_{0} = ε_{−1} = \dots = ε_{1 - q} = 0

). This may be useful if the exact maximum likelihood estimates are close to the boundary of the invertibility region.

You also have the option (see Section 5) of requesting g13ddf to constrain elements of the

ϕ

and

θ

matrices and

μ

vector to have pre-specified values.

4 References

Ansley C F and Kohn R (1986) A note on reparameterising a vector autoregressive moving average model to enforce stationarity J. Statist. Comput. Simulation 24 99–106

Gill P E and Murray W (1972) Quasi-Newton methods for unconstrained optimization J. Inst. Math. Appl. 9 91–108

Shea B L (1987) Estimation of multivariate time series J. Time Ser. Anal. 8 95–110

5 Arguments

1: $k$ – Integer Input

On entry:

k

, the number of observed time series.

Constraint:

k \geq 1

2: $n$ – Integer Input

On entry:

n

, the number of observations in each time series.

3: $ip$ – Integer Input

On entry:

p

, the number of AR parameter matrices.

Constraint:

ip \geq 0

4: $iq$ – Integer Input

On entry:

q

, the number of MA parameter matrices.

Constraint:

iq \geq 0

ip = iq = 0

is not permitted.

5: $mean$ – Logical Input

On entry:

mean = .TRUE.

, if components of

μ

have been estimated and

mean = .FALSE.

, if all elements of

μ

are to be taken as zero.

Constraint:

mean = .TRUE.

.FALSE.

6: $par (npar)$ – Real (Kind=nag_wp) array Input/Output

On entry: initial parameter estimates read in row by row in the order

ϕ_{1}, ϕ_{2}, \dots, ϕ_{p}

θ_{1}, θ_{2}, \dots, θ_{q}, μ

Thus,

if $ip > 0$ , $par ((l - 1) \times k \times k + (i - 1) \times k + j)$ must be set equal to an initial estimate of the $(i, j)$ th element of $ϕ_{l}$ , for $l = 1, 2, \dots, p$ , $i = 1, 2, \dots, k$ and $j = 1, 2, \dots, k$ ;
if $iq > 0$ , $par (p \times k \times k + (l - 1) \times k \times k + (i - 1) \times k + j)$ must be set equal to an initial estimate of the $(i, j)$ th element of $θ_{l}$ , $l = 1, 2, \dots, q$ and $i, j = 1, 2, \dots, k$ ;
if $mean = .TRUE.$ , $par ((p + q) \times k \times k + i)$ should be set equal to an initial estimate of the $i$ th component of $μ$ ( $μ (i)$ ). (If you set $par ((p + q) \times k \times k + i)$ to $0.0$ then g13ddf will calculate the mean of the $i$ th series and use this as an initial estimate of $μ (i)$ .)

The first

p \times k \times k

elements of par must satisfy the stationarity condition and the next

q \times k \times k

elements of par must satisfy the invertibility condition.

If in doubt set all elements of par to

0.0

On exit: if

ifail = 0

ifail \geq 4

then all the elements of par will be overwritten by the latest estimates of the corresponding ARMA parameters.

7: $npar$ – Integer Input

On entry: the dimension of the arrays par, parhld and g and the second dimension of the array cm as declared in the (sub)program from which g13ddf is called. npar is the number of initial parameter estimates.

Constraints:

if $mean = .FALSE.$ , npar must be set equal to $(p + q) \times k \times k$ ;
if $mean = .TRUE.$ , npar must be set equal to $(p + q) \times k \times k + k$ .

The total number of observations

(n \times k)

must exceed the total number of parameters in the model (

npar + k (k + 1) / 2

8: $qq (kmax, k)$ – Real (Kind=nag_wp) array Input/Output

On entry:

qq (i, j)

must be set equal to an initial estimate of the

(i, j)

th element of

Σ

. The lower triangle only is needed. qq must be positive definite. It is strongly recommended that on entry the elements of qq are of the same order of magnitude as at the solution point. If you set

qq (i, j) = 0.0

, for

i = 1, 2, \dots, k

and

j = 1, 2, \dots, i

, then g13ddf will calculate the covariance matrix between the

k

time series and use this as an initial estimate of

Σ

On exit: if

ifail = 0

ifail \geq 4

then

qq (i, j)

will contain the latest estimate of the

(i, j)

th element of

Σ

. The lower triangle only is returned.

9: $kmax$ – Integer Input

On entry: the first dimension of the arrays qq, w and v as declared in the (sub)program from which g13ddf is called.

Constraint:

kmax \geq k

10: $w (kmax, n)$ – Real (Kind=nag_wp) array Input

On entry:

w (i, t)

must be set equal to the

i

th component of

W_{t}

, for

i = 1, 2, \dots, k

and

t = 1, 2, \dots, n

11: $parhld (npar)$ – Logical array Input

On entry:

parhld (i)

must be set to .TRUE. if

par (i)

is to be held constant at its input value and .FALSE. if

par (i)

is a free parameter, for

i = 1, 2, \dots, npar

If in doubt try setting all elements of parhld to .FALSE..

12: $exact$ – Logical Input

On entry: must be set equal to .TRUE. if you wish g13ddf to compute exact maximum likelihood estimates. exact must be set equal to .FALSE. if only conditional likelihood estimates are required.

13: $iprint$ – Integer Input

On entry: the frequency with which the automatic monitoring routine is to be called.

$iprint > 0$: The ML search procedure is monitored once every iprint iterations and just before exit from the search routine.
$iprint = 0$: The search routine is monitored once at the final point.
$iprint < 0$: The search routine is not monitored at all.

14: $cgetol$ – Real (Kind=nag_wp) Input

On entry: the accuracy to which the solution in par and qq is required.

If cgetol is set to

10^{- l}

and on exit

ifail = 0

ifail \geq 6

, then all the elements in par and qq should be accurate to approximately

l

decimal places. For most practical purposes the value

10^{−4}

should suffice. You should be wary of setting cgetol too small since the convergence criteria may then have become too strict for the machine to handle.

If cgetol has been set to a value which is less than the machine precision,

ε

, then g13ddf will use the value

10.0 \times \sqrt{ε}

instead.

15: $maxcal$ – Integer Input

On entry: the maximum number of likelihood evaluations to be permitted by the search procedure.

Suggested value:

maxcal = 40 \times npar \times (npar + 5)

Constraint:

maxcal \geq 1

16: $ishow$ – Integer Input

On entry: specifies which of the following two quantities are to be printed.

(i)table of maximum likelihood estimates and their standard errors (as returned in the output arrays par, qq and cm);
(ii)table of residual series (as returned in the output array v).

$ishow = 0$: None of the above are printed.
$ishow = 1$: (i) only is printed.
$ishow = 2$: (i) and (ii) are printed.

Constraint:

0 \leq ishow \leq 2

17: $niter$ – Integer Output

On exit: if

ifail = 0

ifail \geq 4

then niter contains the number of iterations performed by the search routine.

18: $rlogl$ – Real (Kind=nag_wp) Output

On exit: if

ifail = 0

ifail \geq 4

then rlogl contains the value of the log-likelihood function corresponding to the final point held in par and qq.

19: $v (kmax, n)$ – Real (Kind=nag_wp) array Output

On exit: if

ifail = 0

ifail \geq 4

then

v (i, t)

will contain an estimate of the

i

th component of

ε_{t}

, for

i = 1, 2, \dots, k

and

t = 1, 2, \dots, n

, corresponding to the final point held in par and qq.

20: $g (npar)$ – Real (Kind=nag_wp) array Output

On exit: if

ifail = 0

ifail \geq 4

then

g (i)

will contain the estimated first derivative of the log-likelihood function with respect to the

i

th element in the array par. If the gradient cannot be computed then all the elements of g are returned as zero.

21: $cm (ldcm, npar)$ – Real (Kind=nag_wp) array Output

On exit: if

ifail = 0

ifail \geq 4

then

cm (i, j)

will contain an estimate of the correlation coefficient between the

i

th and

j

th elements in the par array for

1 \leq i \leq npar

1 \leq j \leq npar

. If

i = j

, then

cm (i, j)

will contain the estimated standard error of

par (i)

. If the

l

th component of par has been held constant, i.e.,

parhld (l)

was set to .TRUE., then the

l

th row and column of cm will be set to zero. If the second derivative matrix cannot be computed then all the elements of cm are returned as zero.

22: $ldcm$ – Integer Input

On entry: the first dimension of the array cm as declared in the (sub)program from which g13ddf is called.

Constraint:

ldcm \geq npar

23: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

−1

1

to set behaviour on detection of an error; these values have no effect when no error is detected.

A value of

0

causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of

−1

means that an error message is printed while a value of

1

means that it is not.

If halting is not appropriate, the value

−1

1

is recommended. If message printing is undesirable, then the value

1

is recommended. Otherwise, the value

−1

is recommended since useful values can be provided in some output arguments even when

ifail \neq 0

on exit. When the value $- 1$ or $1$ is used it is essential to test the value of ifail on exit.

On exit:

ifail = 0

unless the routine detects an error or a warning has been flagged (see Section 6).

6 Error Indicators and Warnings

If on entry

ifail = 0

−1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

Note: in some cases g13ddf may return useful information.

$ifail = 1$: On entry, $ip = ⟨ value ⟩$ .
Constraint: $ip \geq 0$ .

On entry, $ip = 0$ and $iq = 0$ .

On entry, $iq = ⟨ value ⟩$ .
Constraint: $iq \geq 0$ .

On entry, $ishow = ⟨ value ⟩$ .
Constraint: $0 \leq ishow \leq 2$ .

On entry, $k = ⟨ value ⟩$ .
Constraint: $k \geq 1$ .

On entry, $kmax = ⟨ value ⟩$ and $k = ⟨ value ⟩$ .
Constraint: $kmax \geq k$ .

On entry, $ldcm = ⟨ value ⟩$ and $npar = ⟨ value ⟩$ .
Constraint: $ldcm \geq npar$ .

On entry, $maxcal = ⟨ value ⟩$ .
Constraint: $maxcal \geq 1$ .

On entry, $n = ⟨ value ⟩$ , $k = ⟨ value ⟩$ and $npar = ⟨ value ⟩$ .
Constraint: $n \times k > npar + k \times (k + 1) / 2$ .

On entry, $npar = ⟨ value ⟩$ .
Constraint: $npar = ⟨ value ⟩$ .

On entry, $npar = ⟨ value ⟩$ .
Constraint: $npar \geq 0$ .

$ifail = 2$: The initial AR parameter estimates are outside the stationarity region. To proceed you must try a different starting point.

The initial estimate of $Σ$ is not positive definite. To proceed you must try a different starting point.

The initial MA parameter estimates are outside the invertibility region. To proceed you must try a different starting point.

The starting point is too close to the boundary of the admissibility region. To proceed you must try a different starting point.

$ifail = 3$: The routine cannot compute a sufficiently accurate estimate of the gradient vector at the user-supplied starting point. This usually occurs if either the initial parameter estimates are very close to the ML parameter estimates, or you have supplied a very poor estimate of $Σ$ , or the starting point is very close to the boundary of the stationarity or invertibility region. To proceed you must try a different starting point.

$ifail = 4$: There have been maxcal log-likelihood evaluations made in the routine.

If steady increases in the log-likelihood function were monitored up to the point where this exit occurred, then the exit probably simply occurred because maxcal was set too small, so the calculations should be restarted from the final point held in par and qq. This type of exit may also indicate that there is no maximum to the likelihood surface. Output quantities were computed at the final point held in par and qq, except that if g or cm could not be computed, in which case they are set to zero.

$ifail = 5$: The conditions for a solution have not all been met, but a point at which the log-likelihood took a larger value could not be found.
Provided that the estimated first derivatives are sufficiently small, and that the estimated condition number of the second derivative (Hessian) matrix, as printed when $iprint \geq 0$ , is not too large, this error exit may simply mean that, although it has not been possible to satisfy the specified requirements, the algorithm has in fact found the solution as far as the accuracy of the machine permits.

Such a condition can arise, for instance, if cgetol has been set so small that rounding error in evaluating the likelihood function makes attainment of the convergence conditions impossible.

If the estimated condition number at the final point is large, it could be that the final point is a solution but that the smallest eigenvalue of the Hessian matrix is so close to zero at the solution that it is not possible to recognize it as a solution. Output quantities were computed at the final point held in par and qq, except that if g or cm could not be computed, in which case they are set to zero.

$ifail = 6$: The ML solution is so close to the boundary of either the stationarity region or the invertibility region that g13ddf cannot evaluate the Hessian matrix. The elements of cm are set to zero, as are the elements of g. All other output quantities are correct.

$ifail = 7$: An estimate of the second derivative matrix and the gradient vector at the solution point was computed. Either the Hessian matrix was found to be too ill-conditioned to be evaluated accurately or the gradient vector could not be computed to an acceptable degree of accuracy. The elements of cm are set to zero, as are the elements of g. All other output quantities are correct.

$ifail = 8$: The second-derivative matrix at the solution point is not positive definite. The elements of cm are set to zero. All other output quantities are correct.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

On exit from g13ddf, if

ifail = 0

ifail \geq 6

and cgetol has been set to

10^{- l}

, then all the parameters should be accurate to approximately

l

decimal places. If cgetol was set equal to a value less than the machine precision,

ε

, then all the parameters should be accurate to approximately

10.0 \times \sqrt{ε}

ifail = 4

on exit (i.e., maxcal likelihood evaluations have been made but the convergence conditions of the search routine have not been satisfied), then the elements in par and qq may still be good approximations to the ML estimates. Inspection of the elements of g may help you determine whether this is likely.

8 Parallelism and Performance

g13ddf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

g13ddf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

9.1 Memory Usage

Let

r = \max (ip, iq)

and

s = npar + k \times (k + 1) / 2

. Local workspace arrays of fixed lengths are allocated internally by g13ddf. The total size of these arrays amounts to

s + k \times r + 52

integer elements and

2 \times s^{2} + s \times (s - 1) / 2 + 15 \times s + k^{2} \times (2 \times ip + iq + {(r + 3)}^{2}) + k \times (2 \times r^{2} + 2 \times r + 3 \times n + 4) + 10

real elements.

9.2 Timing

The number of iterations required depends upon the number of parameters in the model and the distance of the user-supplied starting point from the solution.

9.3 Constraining for Stationarity and Invertibility

If the solution lies on the boundary of the admissibility region (stationarity and invertibility region) then g13ddf may get into difficulty and exit with

ifail = 5

. If this exit occurs you are advised to either try a different starting point or a different setting for exact. If this still continues to occur then you are urged to try fitting a more parsimonious model.

9.4 Over-parameterisation

You are advised to try and avoid fitting models with an excessive number of parameters since over-parameterisation can cause the maximization problem to become ill-conditioned.

9.5 Standardizing the Residual Series

The standardized estimates of the residual series

ε_{t}

(denoted by

{\hat{e}}_{t}

) can easily be calculated by forming the Cholesky decomposition of

Σ

, e.g.,

G G^{T}

and setting

{\hat{e}}_{t} = G^{- 1} {\hat{ε}}_{t}

. f07fdf may be used to calculate the array g. The components of

{\hat{e}}_{t}

which are now uncorrelated at all lags can sometimes be more easily interpreted.

9.6 Assessing the Fit of the Model

If your time series model provides a good fit to the data then the residual series should be approximately white noise, i.e., exhibit no serial cross-correlation. An examination of the residual cross-correlation matrices should confirm whether this is likely to be so. You are advised to call g13dsf to provide information for diagnostic checking. g13dsf returns the residual cross-correlation matrices along with their asymptotic standard errors. g13dsf also computes a portmanteau statistic and its asymptotic significance level for testing model adequacy. If

ifail = 0

5 \leq ifail \leq 8

on exit from g13ddf then the quantities output k, n, v, kmax, ip, iq, par, parhld, and qq will be suitable for input to g13dsf.

10 Example

This example shows how to fit a bivariate AR(1) model to two series each of length

48

μ

will be estimated and

ϕ_{1} (2, 1)

will be constrained to be zero.

g13dd: FL CL CPP AD

NAG FL Interfaceg13ddf (multi_​varma_​estimate)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

9.1 Memory Usage

9.2 Timing

9.3 Constraining for Stationarity and Invertibility

9.4 Over-parameterisation

9.5 Standardizing the Residual Series

9.6 Assessing the Fit of the Model

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

NAG FL Interface
g13ddf (multi_varma_estimate)