NAG Library Routine Document

Integer, Intent (In)	::	n, lda, ldb, ldc, ldsig, l1, l2
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	lmax
Real (Kind=nag_wp), Intent (In)	::	a(lda,n), b(ldb,n), c(ldc,), ela(), emu(*), sigma(ldsig,n), eps
Real (Kind=nag_wp), Intent (Out)	::	rmom(l2-l1+1), abserr, wk(3nn+(8+l2)*n)
Character (1), Intent (In)	::	case, mean

C Header Interface

#include <nagmk26.h>

void

g01nbf_ (const char *cas, const char *mean, const Integer *n, const double a[], const Integer *lda, const double b[], const Integer *ldb, const double c[], const Integer *ldc, const double ela[], const double emu[], const double sigma[], const Integer *ldsig, const Integer *l1, const Integer *l2, Integer *lmax, double rmom[], double *abserr, const double *eps, double wk[], Integer *ifail, const Charlen length_cas, const Charlen length_mean)

3

Description

Let

x

have an

n

-dimensional multivariate Normal distribution with mean

μ

and variance-covariance matrix

Σ

. Then for a symmetric matrix

A

and symmetric positive semidefinite matrix

B

, g01nbf computes a subset,

l_{1}

l_{2}

, of the first

12

moments of the ratio of quadratic forms

R = x^{T} A x / x^{T} B x .

The

s

th moment (about the origin) is defined as

E (R^{s}),

(1)

where

E

denotes the expectation. Alternatively, this routine will compute the following expectations:

E (R^{s} (a^{T} x))

(2)

and

E (R^{s} (x^{T} C x)),

(3)

where

a

is a vector of length

n

and

C

is a

n

n

symmetric matrix, if they exist. In the case of (2) the moments are zero if

μ = 0

The conditions of theorems 1, 2 and 3 of Magnus (1986) and Magnus (1990) are used to check for the existence of the moments. If all the requested moments do not exist, the computations are carried out for those moments that are requested up to the maximum that exist,

l_{MAX}

This routine is based on the routine QRMOM written by Magnus and Pesaran (1993a) and based on the theory given by Magnus (1986) and Magnus (1990). The computation of the moments requires first the computation of the eigenvectors of the matrix

L^{T} B L

, where

L L^{T} = Σ

. The matrix

L^{T} B L

must be positive semidefinite and not null. Given the eigenvectors of this matrix, a function which has to be integrated over the range zero to infinity can be computed. This integration is performed using d01amf.

4

References

Magnus J R (1986) The exact moments of a ratio of quadratic forms in Normal variables Ann. Économ. Statist. 4 95–109

Magnus J R (1990) On certain moments relating to quadratic forms in Normal variables: Further results Sankhyā, Ser. B 52 1–13

Magnus J R and Pesaran B (1993a) The evaluation of cumulants and moments of quadratic forms in Normal variables (CUM): Technical description Comput. Statist. 8 39–45

Magnus J R and Pesaran B (1993b) The evaluation of moments of quadratic forms and ratios of quadratic forms in Normal variables: Background, motivation and examples Comput. Statist. 8 47–55

5

Arguments

1: $case$ – Character(1)Input

On entry: indicates the moments of which function are to be computed.

$case ='R'$ (Ratio): $E (R^{s})$ is computed.
$case ='L'$ (Linear with ratio): $E (R^{s} (a^{T} x))$ is computed.
$case ='Q'$ (Quadratic with ratio): $E (R^{s} (x^{T} C x))$ is computed.

Constraint:

case ='R'

'L'

'Q'

2: $mean$ – Character(1)Input

On entry: indicates if the mean,

μ

, is zero.

$mean ='Z'$: $μ$ is zero.
$mean ='M'$: The value of $μ$ is supplied in emu.

Constraint:

mean ='Z'

'M'

3: $n$ – IntegerInput

On entry:

n

, the dimension of the quadratic form.

Constraint:

n > 1

4: $a (lda, n)$ – Real (Kind=nag_wp) arrayInput

On entry: the

n

n

symmetric matrix

A

. Only the lower triangle is referenced.

5: $lda$ – IntegerInput

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

Constraint:

lda \geq n

6: $b (ldb, n)$ – Real (Kind=nag_wp) arrayInput

On entry: the

n

n

positive semidefinite symmetric matrix

B

. Only the lower triangle is referenced.

Constraint: the matrix

B

must be positive semidefinite.

7: $ldb$ – IntegerInput

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

Constraint:

ldb \geq n

8: $c (ldc *)$ – Real (Kind=nag_wp) arrayInput

Note: the second dimension of the array c must be at least

n

case ='Q'

On entry: if

case ='Q'

, c must contain the

n

n

symmetric matrix

C

; only the lower triangle is referenced.

case \neq'Q'

, c is not referenced.

9: $ldc$ – IntegerInput

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

Constraint: if

case ='Q'

ldc \geq n

10: $ela (*)$ – Real (Kind=nag_wp) arrayInput

Note: the dimension of the array ela must be at least

n

case ='L'

, and at least

1

otherwise.

On entry: if

case ='L'

, ela must contain the vector

a

of length

n

, otherwise ela is not referenced.

11: $emu (*)$ – Real (Kind=nag_wp) arrayInput

Note: the dimension of the array emu must be at least

n

mean ='M'

, and at least

1

otherwise.

On entry: if

mean ='M'

, emu must contain the

n

elements of the vector

μ

mean ='Z'

, emu is not referenced.

12: $sigma (ldsig, n)$ – Real (Kind=nag_wp) arrayInput

On entry: the

n

n

variance-covariance matrix

Σ

. Only the lower triangle is referenced.

Constraint: the matrix

Σ

must be positive definite.

13: $ldsig$ – IntegerInput

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

Constraint:

ldsig \geq n

14: $l1$ – IntegerInput

On entry: the first moment to be computed,

l_{1}

Constraint:

0 < l1 \leq l2

15: $l2$ – IntegerInput

On entry: the last moment to be computed,

l_{2}

Constraint:

l1 \leq l2 \leq 12

16: $lmax$ – IntegerOutput

On exit: the highest moment computed,

l_{MAX}

. This will be

l_{2}

ifail = 0

on exit.

17: $rmom (l2 - l1 + 1)$ – Real (Kind=nag_wp) arrayOutput

On exit: the

l_{1}

l_{MAX}

moments.

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

On exit: the estimated maximum absolute error in any computed moment.

19: $eps$ – Real (Kind=nag_wp)Input

On entry: the relative accuracy required for the moments, this value is also used in the checks for the existence of the moments.

eps = 0.0

, a value of

\sqrt{ε}

where

ε

is the machine precision used.

Constraint:

eps = 0.0

eps \geq machine precision

20: $wk (3 \times n \times n + (8 + l2) \times n)$ – Real (Kind=nag_wp) arrayWorkspace

21: $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, because for this routine the values of the output arguments may be useful even if

ifail \neq 0

on exit, the recommended value is

- 1

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

Note: g01nbf may return useful information for one or more of the following detected errors or warnings.

Errors or warnings detected by the routine:

$ifail = 1$: On entry, $case = 〈value〉$ .
Constraint: $case ='R'$ , $'L'$ or $'Q'$ .

On entry, $eps = 〈value〉$ .
Constraint: if $eps \neq 0.0$ , $eps \geq machine precision$ .

On entry, $l1 = 〈value〉$ .
Constraint: $l1 \geq 1$ .

On entry, $l1 = 〈value〉$ and $l2 = 〈value〉$ .
Constraint: $l2 \geq l1$ .

On entry, $l2 = 〈value〉$ .
Constraint: $l2 \leq 12$ .

On entry, $lda = 〈value〉$ and $n = 〈value〉$ .
Constraint: $lda \geq n$ .

On entry, $ldb = 〈value〉$ and $n = 〈value〉$ .
Constraint: $ldb \geq n$ .

On entry, $ldc = 〈value〉$ and $n = 〈value〉$ .
Constraint: $ldc \geq n$ .

On entry, $ldsig = 〈value〉$ and $n = 〈value〉$ .
Constraint: $ldsig \geq n$ .

On entry, $mean = 〈value〉$ .
Constraint: $mean ='Z'$ or $'M'$ .

On entry, $n = 〈value〉$ .
Constraint: $n > 1$ .

$ifail = 2$: On entry, b is not positive semidefinite or is null.

On entry, sigma is not positive definite.

$ifail = 3$: Only $〈value〉$ moments exist, less than $l1 = 〈value〉$ , therefore none of the required moments can be computed.

$ifail = 4$: The matrix $L^{T} B L$ is not positive semidefinite or is null.

$ifail = 5$: The computation to compute the eigenvalues required in the calculation of moments has failed to converge: this is an unlikely error exit.

$ifail = 6$: Only some of the required moments have been computed, the highest is given by lmax.

$ifail = 7$: The required accuracy has not been achieved in the integration. An estimate of the accuracy is returned in abserr.

$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

The relative accuracy is specified by eps and an estimate of the maximum absolute error for all computed moments is returned in abserr.

8

Parallelism and Performance

g01nbf 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

None.

10

Example

This example is given by Magnus and Pesaran (1993b) and considers the simple autoregression:

y_{t} = β y_{t - 1} + u_{t}, t = 1, 2, \dots, n,

where

\{u_{t}\}

is a sequence of independent Normal variables with mean zero and variance one, and

y_{0}

is known. The least squares estimate of

β

\hat{β}

, is given by

\hat{β} = \frac{\sum_{t = 2}^{n} y_{t} y_{t - 1}}{\sum_{t = 2}^{n} y_{t}^{2}} .

Thus

\hat{β}

can be written as a ratio of quadratic forms and its moments computed using g01nbf. The matrix

A

is given by

\begin{matrix} A (i + 1, i) = \frac{1}{2}, & i = 1, 2, \dots n - 1; \\ A (i, j) = 0, & otherwise, \end{matrix}

and the matrix

B

is given by

\begin{matrix} B (i, i) = 1, & i = 1, 2, \dots n - 1; \\ B (i, j) = 0, & otherwise. \end{matrix}

The value of

Σ

can be computed using the relationships

var (y_{t}) = β^{2} var (y_{t - 1}) + 1

and

cov (y_{t} y_{t + k}) = β cov (y_{t} y_{t + k - 1})

for

k \geq 0

and

var (y_{1}) = 1

The values of

β

y_{0}

n

, and the number of moments required are read in and the moments computed and printed.

NAG Library Routine Document

g01nbf (moments_ratio_quad_forms)

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