Integer, Intent (In)	::	mode, n, m, ldc, lr, ldx
Integer, Intent (Inout)	::	state(*), ifail
Real (Kind=nag_wp), Intent (In)	::	xmu(m), c(ldc,m)
Real (Kind=nag_wp), Intent (Inout)	::	r(lr), x(ldx,*)

C Header Interface

#include <nag.h>

void	g05rzf_ (const Integer mode, const Integer n, const Integer m, const double xmu[], const double c[], const Integer ldc, double r[], const Integer lr, Integer state[], double x[], const Integer ldx, Integer *ifail)

The routine may be called by the names g05rzf or nagf_rand_multivar_normal.

3 Description

When the covariance matrix is nonsingular (i.e., strictly positive definite), the distribution has probability density function

f (x) = \sqrt{\frac{|C^{- 1}|}{{(2 π)}^{m}}} \exp (- \frac{1}{2} {(x - a)}^{T} C^{- 1} (x - a))

where

m

is the number of dimensions,

C

is the covariance matrix,

a

is the vector of means and

x

is the vector of positions.

Covariance matrices are symmetric and positive semidefinite. Given such a matrix

C

, there exists a lower triangular matrix

L

such that

L L^{T} = C

L

is not unique, if

C

is singular.

g05rzf decomposes

C

to find such an

L

. It then stores

m

a

and

L

in the reference vector

r

which is used to generate a vector

x

of independent standard Normal pseudorandom numbers. It then returns the vector

a + L x

, which has the required multivariate Normal distribution.

It should be noted that this routine will work with a singular covariance matrix

C

, provided

C

is positive semidefinite, despite the fact that the above formula for the probability density function is not valid in that case. Wilkinson (1965) should be consulted if further information is required.

One of the initialization routines g05kff (for a repeatable sequence if computed sequentially) or g05kgf (for a non-repeatable sequence) must be called prior to the first call to g05rzf.

4 References

Knuth D E (1981) The Art of Computer Programming (Volume 2) (2nd Edition) Addison–Wesley

Wilkinson J H (1965) The Algebraic Eigenvalue Problem Oxford University Press, Oxford

5 Arguments

1: $mode$ – Integer Input

On entry: a code for selecting the operation to be performed by the routine.

$mode = 0$: Set up reference vector only.
$mode = 1$ or $3$: Generate variates using reference vector set up in a prior call to g05rzf.
$mode = 2$ or $4$: Set up reference vector and generate variates.

The variates are stored differently in x for

mode = 1

2

compared with

mode = 3

4

Constraint:

mode = 0

1

2

3

4

2: $n$ – Integer Input

On entry:

n

, the number of random variates required.

Constraint:

n \geq 0

3: $m$ – Integer Input

On entry:

m

, the number of dimensions of the distribution.

Constraint:

m > 0

4: $xmu (m)$ – Real (Kind=nag_wp) array Input

On entry:

a

, the vector of means of the distribution.

5: $c (ldc, m)$ – Real (Kind=nag_wp) array Input

On entry: the covariance matrix of the distribution. Only the upper triangle need be set.

Constraint:

C

must be positive semidefinite to machine precision.

6: $ldc$ – Integer Input

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

Constraint:

ldc \geq m

7: $r (lr)$ – Real (Kind=nag_wp) array Input/Output

On entry: if

mode = 1

3

, the reference vector as set up by g05rzf in a previous call with

mode = 0

2

4

On exit: if

mode = 0

2

, the reference vector that can be used in subsequent calls to g05rzf with

mode = 1

3

8: $lr$ – Integer Input

On entry: the dimension of the array r as declared in the (sub)program from which g05rzf is called. If

mode = 1

3

, it must be the same as the value of lr specified in the prior call to g05rzf with

mode = 0

2

4

Constraint:

lr \geq m \times (m + 1) + 1

9: $state (*)$ – Integer array Communication Array

Note: the actual argument supplied must be the array state supplied to the initialization routines g05kff or g05kgf.

On entry: contains information on the selected base generator and its current state.

On exit: contains updated information on the state of the generator.

10: $x (ldx *)$ – Real (Kind=nag_wp) array Output

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

m

mode = 1

2

and at least

n

mode = 3

4

On exit: the array of pseudorandom multivariate Normal vectors generated by the routine.

Two possible storage orders are available. If

mode = 1

2

then

x (i, j)

holds the

j

th dimension for the

i

th variate. If

mode = 3

4

this ordering is reversed and

x (j, i)

holds the

j

th dimension for the

i

th variate.

11: $ldx$ – Integer Input

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

Constraints:

if $mode = 1$ or $2$ , $ldx \geq n$ ;
if $mode = 3$ or $4$ , $ldx \geq m$ .

12: $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

0

is recommended. 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, invalid value for mode.
Constraint: $mode = 0$ , $1$ , $2$ , $3$ or $4$ .

$ifail = 2$: On entry, $n = 〈value〉$ .
Constraint: $n \geq 0$ .

$ifail = 3$: On entry, $m = 〈value〉$ .
Constraint: $m > 0$ .

$ifail = 5$: On entry, the covariance matrix $C$ is not positive semidefinite to machine precision.

$ifail = 6$: On entry, $ldc = 〈value〉$ and $m = 〈value〉$ .
Constraint: $ldc \geq m$ .

$ifail = 7$: m is not the same as when r was set up in a previous call.
Previous value of $m = 〈value〉$ and $m = 〈value〉$ .

$ifail = 8$: On entry, lr is not large enough, $lr = 〈value〉$ : minimum length required $= 〈value〉$ .

$ifail = 9$: On entry, state vector has been corrupted or not initialized.

$ifail = 11$: On entry, $ldx = 〈value〉$ and $m = 〈value〉$ .
Constraint: $ldx \geq m$ .

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

$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

Not applicable.

8 Parallelism and Performance

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

g05rzf 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 by g05rzf is of order

n m^{3}

It is recommended that the diagonal elements of

C

should not differ too widely in order of magnitude. This may be achieved by scaling the variables if necessary. The actual matrix decomposed is

C + E = L L^{T}

, where

E

is a diagonal matrix with small positive diagonal elements. This ensures that, even when

C

is singular, or nearly singular, the Cholesky factor

L

corresponds to a positive definite covariance matrix that agrees with

C

within machine precision.

10 Example

This example prints ten pseudorandom observations from a multivariate Normal distribution with means vector

[\begin{matrix} 1.0 \\ 2.0 \\ - 3.0 \\ 0.0 \end{matrix}]

and covariance matrix

[\begin{matrix} 1.69 & 0.39 & - 1.86 & 0.07 \\ 0.39 & 98.01 & - 7.07 & - 0.71 \\ - 1.86 & - 7.07 & 11.56 & 0.03 \\ 0.07 & - 0.71 & 0.03 & 0.01 \end{matrix}],

generated by g05rzf. All ten observations are generated by a single call to g05rzf with

mode = 2

. The random number generator is initialized by g05kff.

g05rz: FL CL CPP AD

NAG FL Interfaceg05rzf (multivar_​normal)

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

NAG FL Interface
g05rzf (multivar_normal)