Integer, Intent (In)	::	k, n, m, kmax
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	w(kmax,n)
Real (Kind=nag_wp), Intent (Inout)	::	r0(kmax,k), r(kmax,kmax,m)
Real (Kind=nag_wp), Intent (Out)	::	wmean(k)
Character (1), Intent (In)	::	matrix

C Header Interface

#include nagmk26.h

void	g13dmf_ ( const char matrix, const Integer k, const Integer n, const Integer m, const double w[], const Integer kmax, double wmean[], double r0[], double r[], Integer ifail, const Charlen length_matrix)

3

Description

Let

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

, for

t = 1, 2, \dots, n

, denote

n

observations of a vector of

k

time series. The sample cross-covariance matrix at lag

l

is defined to be the

k

k

matrix

\hat{C} (l)

, whose (

i, j

)th element is given by

{\hat{C}}_{i j} (l) = \frac{1}{n} \sum_{t = l + 1}^{n} (w_{i (t - l)} - {\bar{w}}_{i}) (w_{j t} - {\bar{w}}_{j}), l = 0, 1, 2, \dots, m, ​ i = 1, 2, \dots, k ​ and ​ j = 1, 2, \dots, k,

where

{\bar{w}}_{i}

and

{\bar{w}}_{j}

denote the sample means for the

i

th and

j

th series respectively. The sample cross-correlation matrix at lag

l

is defined to be the

k

k

matrix

\hat{R} (l)

, whose

(i, j)

th element is given by

{\hat{R}}_{i j} (l) = \frac{{\hat{C}}_{i j} (l)}{\sqrt{{\hat{C}}_{i i} (0) {\hat{C}}_{j j} (0)}}, l = 0, 1, 2, \dots, m, ​ i = 1, 2, \dots, k ​ and ​ j = 1, 2, \dots, k .

The number of lags,

m

, is usually taken to be at most

n / 4

W_{t}

follows a vector moving average model of order

q

, then it can be shown that the theoretical cross-correlation matrices

(R (l))

are zero beyond lag

q

. In order to help spot a possible cut-off point, the elements of

\hat{R} (l)

are usually compared to their approximate standard error of 1/

\sqrt{n}

. For further details see, for example, Wei (1990).

The routine uses a single pass through the data to compute the means and the cross-covariance matrix at lag zero. The cross-covariance matrices at further lags are then computed on a second pass through the data.

4

References

Wei W W S (1990) Time Series Analysis: Univariate and Multivariate Methods Addison–Wesley

West D H D (1979) Updating mean and variance estimates: An improved method Comm. ACM 22 532–555

5

Arguments

1: $matrix$ – Character(1)Input

On entry: indicates whether the cross-covariance or cross-correlation matrices are to be computed.

$matrix ='V'$: The cross-covariance matrices are computed.
$matrix ='R'$: The cross-correlation matrices are computed.

Constraint:

matrix ='V'

'R'

2: $k$ – IntegerInput

On entry:

k

, the dimension of the multivariate time series.

Constraint:

k \geq 1

3: $n$ – IntegerInput

On entry:

n

, the number of observations in the series.

Constraint:

n \geq 2

4: $m$ – IntegerInput

On entry:

m

, the number of cross-correlation (or cross-covariance) matrices to be computed. If in doubt set

m = 10

. However it should be noted that m is usually taken to be at most

n / 4

Constraint:

1 \leq m < n

5: $w (kmax, n)$ – Real (Kind=nag_wp) arrayInput

On entry:

w (i, t)

must contain the observation

w_{i t}

, for

i = 1, 2, \dots, k

and

t = 1, 2, \dots, n

6: $kmax$ – IntegerInput

On entry: the first dimension of the arrays w, r0 and r and the second dimension of the array r as declared in the (sub)program from which g13dmf is called.

Constraint:

kmax \geq k

7: $wmean (k)$ – Real (Kind=nag_wp) arrayOutput

On exit: the means,

{\bar{w}}_{i}

, for

i = 1, 2, \dots, k

8: $r0 (kmax, k)$ – Real (Kind=nag_wp) arrayOutput

On exit: if

i \neq j

, then

r0 (i, j)

contains an estimate of the

(i, j)

th element of the cross-correlation (or cross-covariance) matrix at lag zero,

{\hat{R}}_{i j} (0)

; if

i = j

, then if

matrix ='V'

r0 (i, i)

contains the variance of the

i

th series,

{\hat{C}}_{i i} (0)

, and if

matrix ='R'

r0 (i, i)

contains the standard deviation of the

i

th series,

\sqrt{{\hat{C}}_{i i} (0)}

ifail = 2

and

matrix ='R'

, then on exit all the elements in r0 whose computation involves the zero variance are set to zero.

9: $r (kmax, kmax, m)$ – Real (Kind=nag_wp) arrayOutput

On exit:

r (i, j, l)

contains an estimate of the (

i, j

)th element of the cross-correlation (or cross-covariance) at lag

l

{\hat{R}}_{i j} (l)

, for

l = 1, 2, \dots, m

i = 1, 2, \dots, k

and

j = 1, 2, \dots, k

ifail = 2

and

matrix ='R'

, then on exit all the elements in r whose computation involves the zero variance are set to zero.

10: $ifail$ – IntegerInput/Output

On entry: ifail must be set to

0

- 1 ​ or ​ 1

. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value

- 1 ​ or ​ 1

is recommended. If the output of error messages is undesirable, then the value

1

is recommended. Otherwise, if you are not familiar with this argument, the recommended value is

0

. 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:

$ifail = 1$

On entry,	$matrix \neq'V'$ or $'R'$ ,
or	$k < 1$ ,
or	$n < 2$ ,
or	$m < 1$ ,
or	$m \geq n$ ,
or	$kmax < k$ .

$ifail = 2$: On entry, at least one of the $k$ series is such that all its elements are practically equal giving zero (or near zero) variance. In this case if $matrix ='R'$ all the correlations in r0 and r involving this variance are set to zero.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

For a discussion of the accuracy of the one-pass algorithm used to compute the sample cross-covariances at lag zero see West (1979). For the other lags a two-pass algorithm is used to compute the cross-covariances; the accuracy of this algorithm is also discussed in West (1979). The accuracy of the cross-correlations will depend on the accuracy of the computed cross-covariances.

8

Parallelism and Performance

g13dmf 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

The time taken is roughly proportional to

m n k^{2}

10

Example

This program computes the sample cross-correlation matrices of two time series of length

48

, up to lag

10

. It also prints the cross-correlation matrices together with plots of symbols indicating which elements of the correlation matrices are significant. Three * represent significance at the

0.5

% level, two * represent significance at the 1% level and a single * represents significance at the 5% level. The * are plotted above or below the line depending on whether the elements are significant in the positive or negative direction.

NAG Library Routine Document

g13dmf (multi_corrmat_cross)

▸▿ 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

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results