NAG Library Function Document

nag_rand_field_1d_user_setup (g05zmc)

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

nag_rand_field_1d_user_setup (g05zmc) performs the setup required in order to simulate stationary Gaussian random fields in one dimension, for a user-defined variogram, using the circulant embedding method. Specifically, the eigenvalues of the extended covariance matrix (or embedding matrix) are calculated, and their square roots output, for use by nag_rand_field_1d_generate (g05zpc), which simulates the random field.

2 Specification

#include <nag.h>

#include <nagg05.h>

void

nag_rand_field_1d_user_setup (Integer ns, double xmin, double xmax, Integer maxm, double var,

void	(cov1)(double x, double gamma, Nag_Comm *comm),

Nag_EmbedPad pad, Nag_EmbedScale corr, double lam[], double xx[], Integer *m, Integer *approx, double *rho, Integer *icount, double eig[], Nag_Comm *comm, NagError *fail)

3 Description

A one-dimensional random field

Z (x)

ℝ

is a function which is random at every point

x \in ℝ

, so

Z (x)

is a random variable for each

x

. The random field has a mean function

μ (x) = 𝔼 [Z (x)]

and a symmetric positive semidefinite covariance function

C (x, y) = 𝔼 [(Z (x) - μ (x)) (Z (y) - μ (y))]

Z (x)

is a Gaussian random field if for any choice of

n \in ℕ

and

x_{1}, \dots, x_{n} \in ℝ

, the random vector

{[Z (x_{1}), \dots, Z (x_{n})]}^{T}

follows a multivariate Normal distribution, which would have a mean vector

\tilde{μ}

with entries

{\tilde{μ}}_{i} = μ (x_{i})

and a covariance matrix

\tilde{C}

with entries

{\tilde{C}}_{i j} = C (x_{i}, x_{j})

. A Gaussian random field

Z (x)

is stationary if

μ (x)

is constant for all

x \in ℝ

and

C (x, y) = C (x + a, y + a)

for all

x, y, a \in ℝ

and hence we can express the covariance function

C (x, y)

as a function

γ

of one variable:

C (x, y) = γ (x - y)

γ

is known as a variogram (or more correctly, a semivariogram) and includes the multiplicative factor

σ^{2}

representing the variance such that

γ (0) = σ^{2}

The functions nag_rand_field_1d_user_setup (g05zmc) and nag_rand_field_1d_generate (g05zpc) are used to simulate a one-dimensional stationary Gaussian random field, with mean function zero and variogram

γ (x)

, over an interval

[x_{\min}, x_{\max}]

, using an equally spaced set of

N

points on the interval. The problem reduces to sampling a Normal random vector

X

of size

N

, with mean vector zero and a symmetric Toeplitz covariance matrix

A

. Since

A

is in general expensive to factorize, a technique known as the circulant embedding method is used.

A

is embedded into a larger, symmetric circulant matrix

B

of size

M \geq 2 (N - 1)

, which can now be factorized as

B = W Λ W^{*} = R^{*} R

, where

W

is the Fourier matrix (

W^{*}

is the complex conjugate of

W

Λ

is the diagonal matrix containing the eigenvalues of

B

and

R = Λ^{\frac{1}{2}} W^{*}

B

is known as the embedding matrix. The eigenvalues can be calculated by performing a discrete Fourier transform of the first row (or column) of

B

and multiplying by

M

, and so only the first row (or column) of

B

is needed – the whole matrix does not need to be formed.

As long as all of the values of

Λ

are non-negative (i.e.,

B

is positive semidefinite),

B

is a covariance matrix for a random vector

Y

, two samples of which can now be simulated from the real and imaginary parts of

R^{*} (U + i V)

, where

U

and

V

have elements from the standard Normal distribution. Since

R^{*} (U + i V) = W Λ^{\frac{1}{2}} (U + i V)

, this calculation can be done using a discrete Fourier transform of the vector

Λ^{\frac{1}{2}} (U + i V)

. Two samples of the random vector

X

can now be recovered by taking the first

N

elements of each sample of

Y

– because the original covariance matrix

A

is embedded in

B

X

will have the correct distribution.

B

is not positive semidefinite, larger embedding matrices

B

can be tried; however if the size of the matrix would have to be larger than maxm, an approximation procedure is used. We write

Λ = Λ_{+} + Λ_{-}

, where

Λ_{+}

and

Λ_{-}

contain the non-negative and negative eigenvalues of

B

respectively. Then

B

is replaced by

ρ B_{+}

where

B_{+} = W Λ_{+} W^{*}

and

ρ \in (0, 1]

is a scaling factor. The error

ε

in approximating the distribution of the random field is given by

ε = \sqrt{\frac{{(1 - ρ)}^{2} trace Λ + ρ^{2} trace Λ_{-}}{M}} .

Three choices for

ρ

are available, and are determined by the input argument corr:

setting $corr = Nag_EmbedScaleTraces$ sets
$ρ = \frac{trace Λ}{trace Λ_{+}},$
setting $corr = Nag_EmbedScaleSqrtTraces$ sets
$ρ = \sqrt{\frac{trace Λ}{trace Λ_{+}}},$
setting $corr = Nag_EmbedScaleOne$ sets $ρ = 1$ .

nag_rand_field_1d_user_setup (g05zmc) finds a suitable positive semidefinite embedding matrix

B

and outputs its size, m, and the square roots of its eigenvalues in lam. If approximation is used, information regarding the accuracy of the approximation is output. Note that only the first row (or column) of

B

is actually formed and stored.

4 References

Dietrich C R and Newsam G N (1997) Fast and exact simulation of stationary Gaussian processes through circulant embedding of the covariance matrix SIAM J. Sci. Comput. 18 1088–1107

Schlather M (1999) Introduction to positive definite functions and to unconditional simulation of random fields Technical Report ST 99–10 Lancaster University

Wood A T A and Chan G (1994) Simulation of stationary Gaussian processes in

{[0, 1]}^{d}

Journal of Computational and Graphical Statistics 3(4) 409–432

5 Arguments

1: $ns$ – IntegerInput

On entry: the number of sample points to be generated in realizations of the random field.

Constraint:

ns \geq 1

2: $xmin$ – doubleInput

On entry: the lower bound for the interval over which the random field is to be simulated.

Constraint:

xmin < xmax

3: $xmax$ – doubleInput

On entry: the upper bound for the interval over which the random field is to be simulated.

Constraint:

xmin < xmax

4: $maxm$ – IntegerInput

On entry: the maximum size of the circulant matrix to use. For example, if the embedding matrix is to be allowed to double in size three times before the approximation procedure is used, then choose

maxm = 2^{k + 2}

where

k = 1 + ⌈\log_{2} (ns - 1)⌉

Suggested value:

2^{k + 2} ​ where ​ k = 1 + ⌈\log_{2} (ns - 1)⌉

Constraint:

maxm \geq 2^{k}

, where

k

is the smallest integer satisfying

2^{k} \geq 2 (ns - 1)

5: $var$ – doubleInput

On entry: the multiplicative factor

σ^{2}

of the variogram

γ (x)

Constraint:

var \geq 0.0

6: $cov1$ – function, supplied by the userExternal Function

cov1 must evaluate the variogram

γ (x)

, without the multiplicative factor

σ^{2}

, for all

x \geq 0

. The value returned in gamma is multiplied internally by var.

The specification of cov1 is:

void	cov1 (double x, double gamma, Nag_Comm comm)

1: $x$ – doubleInput

On entry: the value

x

at which the variogram

γ (x)

is to be evaluated.

2: $gamma$ – double *Output

On exit: the value of the variogram

\frac{γ (x)}{σ^{2}}

3: $comm$ – Nag_Comm *

Pointer to structure of type Nag_Comm; the following members are relevant to cov1.

user – double *
iuser – Integer *
p – Pointer: The type Pointer will be void *. Before calling nag_rand_field_1d_user_setup (g05zmc) you may allocate memory and initialize these pointers with various quantities for use by cov1 when called from nag_rand_field_1d_user_setup (g05zmc) (see Section 3.2.1.1 in the Essential Introduction).

7: $pad$ – Nag_EmbedPadInput

On entry: determines whether the embedding matrix is padded with zeros, or padded with values of the variogram. The choice of padding may affect how big the embedding matrix must be in order to be positive semidefinite.

$pad = Nag_EmbedPadZeros$: The embedding matrix is padded with zeros.
$pad = Nag_EmbedPadValues$: The embedding matrix is padded with values of the variogram.

Suggested value:

pad = Nag_EmbedPadValues

Constraint:

pad = Nag_EmbedPadZeros

Nag_EmbedPadValues

8: $corr$ – Nag_EmbedScaleInput

On entry: determines which approximation to implement if required, as described in Section 3.

Suggested value:

corr = Nag_EmbedScaleTraces

Constraint:

corr = Nag_EmbedScaleTraces

Nag_EmbedScaleSqrtTraces

Nag_EmbedScaleOne

9: $lam [maxm]$ – doubleOutput

On exit: contains the square roots of the eigenvalues of the embedding matrix.

10: $xx [ns]$ – doubleOutput

On exit: the points at which values of the random field will be output.

11: $m$ – Integer *Output

On exit: the size of the embedding matrix.

12: $approx$ – Integer *Output

On exit: indicates whether approximation was used.

$approx = 0$: No approximation was used.
$approx = 1$: Approximation was used.

13: $rho$ – double *Output

On exit: indicates the scaling of the covariance matrix.

rho = 1.0

unless approximation was used with

corr = Nag_EmbedScaleTraces

Nag_EmbedScaleSqrtTraces

14: $icount$ – Integer *Output

On exit: indicates the number of negative eigenvalues in the embedding matrix which have had to be set to zero.

15: $eig [3]$ – doubleOutput

On exit: indicates information about the negative eigenvalues in the embedding matrix which have had to be set to zero.

eig [0]

contains the smallest eigenvalue,

eig [1]

contains the sum of the squares of the negative eigenvalues, and

eig [2]

contains the sum of the absolute values of the negative eigenvalues.

16: $comm$ – Nag_Comm *

The NAG communication argument (see Section 3.2.1.1 in the Essential Introduction).

17: $fail$ – NagError *Input/Output

The NAG error argument (see Section 3.6 in the Essential Introduction).

6 Error Indicators and Warnings

NE_ALLOC_FAIL: Dynamic memory allocation failed.
See Section 3.2.1.2 in the Essential Introduction for further information.
NE_BAD_PARAM: On entry, argument $〈value〉$ had an illegal value.
NE_INT: On entry, $maxm = 〈value〉$ .
Constraint: the minimum calculated value for maxm is $〈value〉$ .
Where the minimum calculated value is given by $2^{k}$ , where $k$ is the smallest integer satisfying $2^{k} \geq 2 (ns - 1)$ .

On entry, $ns = 〈value〉$ .
Constraint: $ns \geq 1$ .
NE_INTERNAL_ERROR: An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.

An unexpected error has been triggered by this function. Please contact NAG.
See Section 3.6.6 in the Essential Introduction for further information.
NE_NO_LICENCE: Your licence key may have expired or may not have been installed correctly.
See Section 3.6.5 in the Essential Introduction for further information.
NE_REAL: On entry, $var = 〈value〉$ .
Constraint: $var \geq 0.0$ .
NE_REAL_2: On entry, $xmin = 〈value〉$ and $xmax = 〈value〉$ .
Constraint: $xmin < xmax$ .

7 Accuracy

If on exit

approx = 1

, see the comments in Section 3 regarding the quality of approximation; increase the value of maxm to attempt to avoid approximation.

8 Parallelism and Performance

Not applicable.

9 Further Comments

None.

10 Example

This example calls nag_rand_field_1d_user_setup (g05zmc) to calculate the eigenvalues of the embedding matrix for

8

sample points of a random field characterized by the symmetric stable variogram:

γ (x) = σ^{2} \exp (- {(x^{'})}^{ν}),

where

x^{'} = \frac{x}{ℓ}

, and

ℓ

and

ν

are parameters.

It should be noted that the symmetric stable variogram is one of the pre-defined variograms available in nag_rand_field_1d_predef_setup (g05znc). It is used here purely for illustrative purposes.

NAG Library Function Documentnag_rand_field_1d_user_setup (g05zmc)

▸▿ 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 Library Function Document

nag_rand_field_1d_user_setup (g05zmc)