hide long namesshow long names
hide short namesshow short names
Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

NAG Toolbox: nag_rand_field_2d_generate (g05zs)


    1  Purpose
    2  Syntax
    7  Accuracy
    9  Example


nag_rand_field_2d_generate (g05zs) produces realizations of a stationary Gaussian random field in two dimensions, using the circulant embedding method. The square roots of the eigenvalues of the extended covariance matrix (or embedding matrix) need to be input, and can be calculated using nag_rand_field_2d_user_setup (g05zq) or nag_rand_field_2d_predef_setup (g05zr).


[state, z, ifail] = g05zs(ns, s, m, lam, rho, state)
[state, z, ifail] = nag_rand_field_2d_generate(ns, s, m, lam, rho, state)


A two-dimensional random field Zx in 2 is a function which is random at every point x2, so Zx is a random variable for each x. The random field has a mean function μx=𝔼Zx and a symmetric positive semidefinite covariance function Cx,y=𝔼Zx-μxZy-μy. Zx is a Gaussian random field if for any choice of n and x1,,xn2, the random vector Zx1,,ZxnT follows a multivariate Normal distribution, which would have a mean vector μ~ with entries μ~i=μxi and a covariance matrix C~ with entries C~ij=Cxi,xj. A Gaussian random field Zx is stationary if μx is constant for all x2 and Cx,y=Cx+a,y+a for all x,y,a2 and hence we can express the covariance function Cx,y as a function γ of one variable: Cx,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_2d_user_setup (g05zq) or nag_rand_field_2d_predef_setup (g05zr) along with nag_rand_field_2d_generate (g05zs) are used to simulate a two-dimensional stationary Gaussian random field, with mean function zero and variogram γx, over a domain xmin,xmax×ymin,ymax, using an equally spaced set of N1×N2 points; N1 points in the x-direction and N2 points in the y-direction. The problem reduces to sampling a Gaussian random vector X of size N1×N2, with mean vector zero and a symmetric covariance matrix A, which is an N2 by N2 block Toeplitz matrix with Toeplitz blocks of size N1 by N1. 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 matrix B, which is an M2 by M2 block circulant matrix with circulant bocks of size M1 by M1, where M12N1-1 and M22N2-1. B can now be factorized as B=WΛW*=R*R, where W is the two-dimensional Fourier matrix (W* is the complex conjugate of W), Λ is the diagonal matrix containing the eigenvalues of B and R=Λ12W*. 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 M1×M2, and so only the first row (or column) of B is needed – the whole matrix does not need to be formed.
The symmetry of A as a block matrix, and the symmetry of each block of A, depends on whether the covariance function γ is even or not. γ is even if γx=γ-x for all x2, and uneven otherwise (in higher dimensions, γ can be even in some coordinates and uneven in others, but in two dimensions γ is either even in both coordinates or uneven in both coordinates). If γ is even then A is a symmetric block matrix and has symmetric blocks; if γ is uneven then A is not a symmetric block matrix and has non-symmetric blocks. In the uneven case, M1 and M2 are set to be odd in order to guarantee symmetry in B.
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 which has M2 ‘blocks’ of size M1. Two samples of Y can now be simulated from the real and imaginary parts of R*U+iV, where U and V have elements from the standard Normal distribution. Since R*U+iV=WΛ12U+iV, this calculation can be done using a discrete Fourier transform of the vector Λ12U+iV. Two samples of the random vector X can now be recovered by taking the first N1 elements of the first N2 blocks of each sample of Y – because the original covariance matrix A is embedded in B, X will have the correct distribution.
If 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. See the documentation of nag_rand_field_2d_user_setup (g05zq) or nag_rand_field_2d_predef_setup (g05zr) for details of the approximation procedure.
nag_rand_field_2d_generate (g05zs) takes the square roots of the eigenvalues of the embedding matrix B, and its size vector M, as input and outputs S realizations of the random field in Z.
One of the initialization functions nag_rand_init_repeat (g05kf) (for a repeatable sequence if computed sequentially) or nag_rand_init_nonrepeat (g05kg) (for a non-repeatable sequence) must be called prior to the first call to nag_rand_field_2d_generate (g05zs).


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,1d Journal of Computational and Graphical Statistics 3(4) 409–432


Compulsory Input Parameters

1:     ns2 int64int32nag_int array
The number of sample points to use in each direction, with ns1 sample points in the x-direction and ns2 sample points in the y-direction. The total number of sample points on the grid is therefore ns1 × ns2 . This must be the same value as supplied to nag_rand_field_2d_user_setup (g05zq) or nag_rand_field_2d_predef_setup (g05zr) when calculating the eigenvalues of the embedding matrix.
  • ns11;
  • ns21.
2:     s int64int32nag_int scalar
S, the number of realizations of the random field to simulate.
Constraint: s1.
3:     m2 int64int32nag_int array
Indicates the size, M, of the embedding matrix as returned by nag_rand_field_2d_user_setup (g05zq) or nag_rand_field_2d_predef_setup (g05zr). The embedding matrix is a block circulant matrix with circulant blocks. m1 is the size of each block, and m2 is the number of blocks.
  • m1max1,2ns1-1;
  • m2max1,2ns2-1.
4:     lamm1×m2 – double array
Contains the square roots of the eigenvalues of the embedding matrix, as returned by nag_rand_field_2d_user_setup (g05zq) or nag_rand_field_2d_predef_setup (g05zr).
Constraint: lami0, i=1,2,,m1×m2.
5:     rho – double scalar
Indicates the scaling of the covariance matrix, as returned by nag_rand_field_2d_user_setup (g05zq) or nag_rand_field_2d_predef_setup (g05zr).
Constraint: 0.0<rho1.0.
6:     state: int64int32nag_int array
Note: the actual argument supplied must be the array state supplied to the initialization routines nag_rand_init_repeat (g05kf) or nag_rand_init_nonrepeat (g05kg).
Contains information on the selected base generator and its current state.

Optional Input Parameters


Output Parameters

1:     state: int64int32nag_int array
Contains updated information on the state of the generator.
2:     zns1×ns2s – double array
Contains the realizations of the random field. The kth realization (where k=1,2,,s) of the random field on the two-dimensional grid xi,yj is stored in z j-1× ns1 +i k, for i=1,2,,ns1 and for j=1,2,,ns2. The points are returned in xx and yy by nag_rand_field_2d_user_setup (g05zq) or nag_rand_field_2d_predef_setup (g05zr).
3:     ifail int64int32nag_int scalar
ifail=0 unless the function detects an error (see Error Indicators and Warnings).

Error Indicators and Warnings

Errors or warnings detected by the function:
Constraint: ns11, ns21.
Constraint: s1.
Constraints: mimax1,2nsi-1, for i=1,2.
On entry, at least one element of lam was negative.
Constraint: all elements of lam must be non-negative.
Constraint: 0.0<rho1.0.
On entry, state vector has been corrupted or not initialized.
An unexpected error has been triggered by this routine. Please contact NAG.
Your licence key may have expired or may not have been installed correctly.
Dynamic memory allocation failed.


Not applicable.

Further Comments

Because samples are generated in pairs, calling this routine k times, with s=s, say, will generate a different sequence of numbers than calling the routine once with s=ks, unless s is even.


This example calls nag_rand_field_2d_generate (g05zs) to generate 5 realizations of a two-dimensional random field on a 5 by 5 grid. This uses eigenvalues of the embedding covariance matrix for a symmetric stable variogram as calculated by nag_rand_field_2d_predef_setup (g05zr) with icov2=1.
function g05zs_example

fprintf('g05zs example results\n\n');

% Use symmetric stable variogram
icov2 = int64(1); 
params = [0.1; 0.15; 1.2];

% Random Field variance
var = 0.5;
% Domain endpoints
xmin = -1;
xmax =  1;
ymin = -0.5;
ymax =  0.5;
% Number of sample points in x and y
ns = [int64(5), 5];
% maximum dimensions for circulant matrix
maxm = [int64(64), 64];
% Scaling factor, rho = 1.
icorr = int64(2);

% Get square roots of the eigenvalues of the embedding matrix
[lam, xx, yy, m, approx, rho, icount, eig, ifail] = ...
  g05zr( ...
         ns, xmin, xmax, ymin, ymax, maxm, var, ...
         icov2, params, 'icorr', icorr);

fprintf('\nSize of embedding matrix = %d\n\n', m(1)*m(2));

% Display approximation information if approximation used
if approx == 1
  fprintf('Approximation required\n\n');
  fprintf('rho = %10.5f\n', rho);
  fprintf('eig = %10.5f%10.5f%10.5f\n', eig(1:3));
  fprintf('icount = %d\n', icount);
  fprintf('Approximation not required\n\n');

% Initialize state array
genid = int64(1);
subid = int64(1);
seed  = [int64(14965)];
[state, ifail] = g05kf( ...
                        genid, subid, seed);

% Compute s random field realisations
s = int64(5);
[state, z, ifail] = g05zs( ...
                           ns, s, m, lam, rho, state);

% Display realisations

% Set row labels to grid points (column label is realisation number).
rlabs = cell(ns(1)*ns(2), 1);
for j=1:ns(2)
  for i=1:ns(1)
    if i == 1
      rlabs{(j-1)*ns(1)+i} = sprintf('%6.1f%6.1f', xx(i), yy(j));
      rlabs{(j-1)*ns(1)+i} = sprintf('%6.1f     .', xx(i));

% Matrix printing parameters
mtitle = 'Random field realisations (x,y coordinates first):';
matrix = 'General';
diag   = 'Non-unit';
fmt    = 'f10.5';
rlabel = 'Character';
clabel = 'Integer';
clabs  = {' '};
ncols  = int64(80);
indent = int64(0);

[ifail] = x04cb( ...
                 matrix, diag, z, fmt, mtitle, rlabel, rlabs, clabel, ...
                 clabs, ncols, indent);

g05zs example results

Size of embedding matrix = 64

Approximation not required

 Random field realisations (x,y coordinates first):
                     1         2         3         4         5
 -0.8  -0.4   -0.61951  -0.93149  -0.32975  -0.51201   1.38877
 -0.4     .    0.74779   1.33518  -0.51237   0.26595   0.30051
  0.0     .   -0.30579   0.51819   0.50961   0.10379   0.36815
  0.4     .    0.53797  -0.53992  -0.86589  -0.37098   0.21571
  0.8     .   -0.61221  -1.04262   0.00007  -1.22614  -0.06650
 -0.8  -0.2    0.01853   0.64126  -0.42978  -0.79178  -0.55728
 -0.4     .   -0.77912   0.81079  -0.60613   0.07280   1.61511
  0.0     .   -0.23198   1.48744  -0.78145   0.10347   0.07053
  0.4     .    0.32356   0.58676   0.05846   0.34828   1.40522
  0.8     .   -1.24085  -0.92512   0.27247  -0.66965   0.67073
 -0.8   0.0   -1.18183  -0.99775   0.03888   0.01789  -0.65746
 -0.4     .    0.26155  -0.01734  -0.14924   0.28886   0.25940
  0.0     .    1.14960   0.48850  -0.59023   0.22795  -0.60773
  0.4     .   -0.32684  -0.09616  -0.63497  -1.06753  -0.64594
  0.8     .    0.10064   1.06148   0.15020  -0.53168  -0.29251
 -0.8   0.2   -1.30595  -0.03899  -0.35549  -0.20589  -0.35956
 -0.4     .   -0.01776   0.84501   0.20406   0.89039  -0.58338
  0.0     .    0.41898   0.93435  -1.10725   0.76913  -0.74579
  0.4     .   -1.37738   1.72404  -0.20558  -1.41877   1.21816
  0.8     .    0.77866   0.84922  -0.65055   0.83518  -0.26425
 -0.8   0.4   -0.65163   0.50492  -0.52463  -1.12816   1.12817
 -0.4     .    0.15437   0.20739  -0.12675   1.27782  -0.26157
  0.0     .    0.20324   0.54670  -1.73909   0.61580   0.17551
  0.4     .   -1.09470   0.83967   0.70226  -0.34259   0.29368
  0.8     .    1.08452   1.23097  -0.36003   1.06884   0.23594

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015