PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_rand_field_2d_user_setup (g05zq)
Purpose
nag_rand_field_2d_user_setup (g05zq) performs the setup required in order to simulate stationary Gaussian random fields in two dimensions, 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_2d_generate (g05zs), which simulates the random field.
Syntax
[
lam,
xx,
yy,
m,
approx,
rho,
icount,
eig,
user,
ifail] = g05zq(
ns,
xmin,
xmax,
ymin,
ymax,
maxm,
var,
cov2,
even, 'pad',
pad, 'icorr',
icorr, 'user',
user)
[
lam,
xx,
yy,
m,
approx,
rho,
icount,
eig,
user,
ifail] = nag_rand_field_2d_user_setup(
ns,
xmin,
xmax,
ymin,
ymax,
maxm,
var,
cov2,
even, 'pad',
pad, 'icorr',
icorr, 'user',
user)
Description
A two-dimensional random field in is a function which is random at every point , so is a random variable for each . The random field has a mean function and a symmetric positive semidefinite covariance function . is a Gaussian random field if for any choice of and , the random vector follows a multivariate Normal distribution, which would have a mean vector with entries and a covariance matrix with entries . A Gaussian random field is stationary if is constant for all and for all and hence we can express the covariance function as a function of one variable: . is known as a variogram (or more correctly, a semivariogram) and includes the multiplicative factor representing the variance such that .
The functions
nag_rand_field_2d_user_setup (g05zq) and
nag_rand_field_2d_generate (g05zs) are used to simulate a two-dimensional stationary Gaussian random field, with mean function zero and variogram
, over a domain
, using an equally spaced set of
points;
points in the
-direction and
points in the
-direction. The problem reduces to sampling a Normal random vector
of size
, with mean vector zero and a symmetric covariance matrix
, which is an
by
block Toeplitz matrix with Toeplitz blocks of size
by
. Since
is in general expensive to factorize, a technique known as the
circulant embedding method is used.
is embedded into a larger, symmetric matrix
, which is an
by
block circulant matrix with circulant blocks of size
by
, where
and
.
can now be factorized as
, where
is the two-dimensional Fourier matrix (
is the complex conjugate of
),
is the diagonal matrix containing the eigenvalues of
and
.
is known as the embedding matrix. The eigenvalues can be calculated by performing a discrete Fourier transform of the first row (or column) of
and multiplying by
, and so only the first row (or column) of
is needed – the whole matrix does not need to be formed.
The symmetry of as a block matrix, and the symmetry of each block of , depends on whether the variogram is even or not. is even in its first coordinate if , even in its second coordinate if , and even if it is even in both coordinates (in two dimensions it is impossible for to be even in one coordinate and uneven in the other). If is even then is a symmetric block matrix and has symmetric blocks; if is uneven then is not a symmetric block matrix and has non-symmetric blocks. In the uneven case, and are set to be odd in order to guarantee symmetry in .
As long as all of the values of are non-negative (i.e., is positive semidefinite), is a covariance matrix for a random vector which has blocks of size . Two samples of can now be simulated from the real and imaginary parts of , where and have elements from the standard Normal distribution. Since , this calculation can be done using a discrete Fourier transform of the vector . Two samples of the random vector can now be recovered by taking the first elements of the first blocks of each sample of – because the original covariance matrix is embedded in , will have the correct distribution.
If
is not positive semidefinite, larger embedding matrices
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
respectively. Then
is replaced by
where
and
is a scaling factor. The error
in approximating the distribution of the random field is given by
Three choices for
are available, and are determined by the input argument
icorr:
- setting sets
- setting sets
- setting sets .
nag_rand_field_2d_user_setup (g05zq) finds a suitable positive semidefinite embedding matrix
and outputs its sizes in the vector
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
is actually formed and stored.
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 Journal of Computational and Graphical Statistics 3(4) 409–432
Parameters
Compulsory Input Parameters
- 1:
– int64int32nag_int array
-
The number of sample points to use in each direction, with sample points in the -direction, and sample points in the -direction, . The total number of sample points on the grid is therefore .
- 2:
– double scalar
-
The lower bound for the -coordinate, for the region in which the random field is to be simulated.
Constraint:
.
- 3:
– double scalar
-
The upper bound for the -coordinate, for the region in which the random field is to be simulated.
Constraint:
.
- 4:
– double scalar
-
The lower bound for the -coordinate, for the region in which the random field is to be simulated.
Constraint:
.
- 5:
– double scalar
-
The upper bound for the -coordinate, for the region in which the random field is to be simulated.
Constraint:
.
- 6:
– int64int32nag_int array
-
Determines the maximum size of the circulant matrix to use – a maximum of elements in the -direction, and a maximum of elements in the -direction. The maximum size of the circulant matrix is thus .
Constraints:
- if , , where is the smallest integer satisfying , for ;
- if , , where is the smallest integer satisfying , for .
- 7:
– double scalar
-
The multiplicative factor of the variogram .
Constraint:
.
- 8:
– function handle or string containing name of m-file
-
cov2 must evaluate the variogram
for all
if
, and for all
with non-negative entries if
. The value returned in
gamma is multiplied internally by
var.
[gamma, user] = cov2(x, y, user)
Input Parameters
- 1:
– double scalar
-
The coordinate at which the variogram is to be evaluated.
- 2:
– double scalar
-
The coordinate at which the variogram is to be evaluated.
- 3:
– Any MATLAB object
cov2 is called from
nag_rand_field_2d_user_setup (g05zq) with the object supplied to
nag_rand_field_2d_user_setup (g05zq).
Output Parameters
- 1:
– double scalar
-
The value of the variogram .
- 2:
– Any MATLAB object
- 9:
– int64int32nag_int scalar
-
Indicates whether the covariance function supplied is even or uneven.
- The covariance function is uneven.
- The covariance function is even.
Constraint:
or .
Optional Input Parameters
- 1:
– int64int32nag_int scalar
Default:
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.
- The embedding matrix is padded with zeros.
- The embedding matrix is padded with values of the variogram.
Constraint:
or .
- 2:
– int64int32nag_int scalar
Default:
Determines which approximation to implement if required, as described in
Description.
Constraint:
, or .
- 3:
– Any MATLAB object
user is not used by
nag_rand_field_2d_user_setup (g05zq), but is passed to
cov2. Note that for large objects it may be more efficient to use a global variable which is accessible from the m-files than to use
user.
Output Parameters
- 1:
– double array
-
Contains the square roots of the eigenvalues of the embedding matrix.
- 2:
– double array
-
The points of the -coordinates at which values of the random field will be output.
- 3:
– double array
-
The points of the -coordinates at which values of the random field will be output.
- 4:
– int64int32nag_int array
-
contains , the size of the circulant blocks and contains , the number of blocks, resulting in a final square matrix of size .
- 5:
– int64int32nag_int scalar
-
Indicates whether approximation was used.
- No approximation was used.
- Approximation was used.
- 6:
– double scalar
-
Indicates the scaling of the covariance matrix. unless approximation was used with or .
- 7:
– int64int32nag_int scalar
-
Indicates the number of negative eigenvalues in the embedding matrix which have had to be set to zero.
- 8:
– double array
-
Indicates information about the negative eigenvalues in the embedding matrix which have had to be set to zero. contains the smallest eigenvalue, contains the sum of the squares of the negative eigenvalues, and contains the sum of the absolute values of the negative eigenvalues.
- 9:
– Any MATLAB object
- 10:
– int64int32nag_int scalar
unless the function detects an error (see
Error Indicators and Warnings).
Error Indicators and Warnings
Errors or warnings detected by the function:
-
-
Constraint: , .
-
-
Constraint: .
-
-
Constraint: .
-
-
Constraint: the minima for
maxm are
.
Where, if
, the minimum calculated value of
is given by
, where
is the smallest integer satisfying
, and if
, the minimum calculated value of
is given by
, where
is the smallest integer satisfying
, for
.
-
-
Constraint: .
-
-
Constraint: or .
-
-
Constraint: or .
-
-
Constraint: , or .
-
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.
Accuracy
If on exit
, see the comments in
Description regarding the quality of approximation; increase the values in
maxm to attempt to avoid approximation.
Further Comments
None.
Example
This example calls
nag_rand_field_2d_user_setup (g05zq) to calculate the eigenvalues of the embedding matrix for
sample points on a
by
grid of a two-dimensional random field characterized by the symmetric stable variogram:
where
, 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_2d_predef_setup (g05zr). It is used here purely for illustrative purposes.
Open in the MATLAB editor:
g05zq_example
function g05zq_example
fprintf('g05zq example results\n\n');
var = 0.5;
xmin = -1;
xmax = 1;
ymin = -0.5;
ymax = 0.5;
ns = [int64(5), 5];
maxm = [int64(81), 81];
icorr = int64(2);
norm_p = int64(2);
l1 = 0.1;
l2 = 0.15;
nu = 1.2;
user = {norm_p; l1; l2; nu};
even = int64(1);
[lam, xx, yy, m, approx, rho, icount, eig, user, ifail] = ...
g05zq( ...
ns, xmin, xmax, ymin, ymax, maxm, var, ...
@cov2, even, 'icorr', icorr, 'user', user);
fprintf('Size of embedding matrix = %d\n\n', m(1)*m(2));
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);
else
fprintf('Approximation not required\n\n');
end
fprintf('Square roots of eigenvalues of embedding matrix:\n');
mm = m(1)*m(2);
mlam = reshape(lam(1:mm), m(1), m(2));
for i = 1:m(1)
fprintf('%8.4f',mlam(i,:));
fprintf('\n');
end
function [gam, user] = cov2(x, y, user)
norm_p = user{1};
l1 = user{2};
l2 = user{3};
nu = user{4};
tl1 = abs(x)/l1;
tl2 = abs(y)/l2;
if norm_p == 1
rnorm = tl1 + tl2;
else
rnorm = sqrt(tl1^2+tl2^2);
end
gam = exp(-(rnorm^nu));
g05zq example results
Size of embedding matrix = 64
Approximation not required
Square roots of eigenvalues of embedding matrix:
0.8966 0.8234 0.6810 0.5757 0.5391 0.5757 0.6810 0.8234
0.8940 0.8217 0.6804 0.5756 0.5391 0.5756 0.6804 0.8217
0.8877 0.8175 0.6792 0.5754 0.5391 0.5754 0.6792 0.8175
0.8813 0.8133 0.6780 0.5751 0.5390 0.5751 0.6780 0.8133
0.8787 0.8116 0.6774 0.5750 0.5390 0.5750 0.6774 0.8116
0.8813 0.8133 0.6780 0.5751 0.5390 0.5751 0.6780 0.8133
0.8877 0.8175 0.6792 0.5754 0.5391 0.5754 0.6792 0.8175
0.8940 0.8217 0.6804 0.5756 0.5391 0.5756 0.6804 0.8217
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015