These methods use a transformation to a spherical coordinate
system.
First, let
,
where
is the
Cholesky decomposition of
.
Then
so
Next let
with
,
so
where Km is a normalization constant,
with
,
and
with Hm chosen so that
.
is the distance, in the
direction, from the origin to
the boundary of the integration region. The definition given here assumes
bi > 0 for all i, but this can been generalized (see Deák, 1986) to
include negative bi's.
Deák's methods all compute
using points
that are randomly chosen from the surface of
m-sphere. His simplest method uses uniformly random
from the surface of m-sphere.
Better methods improve the sampling by using antithetic variates.
Let Z be an
random orthogonal matrix with columns
and let
where
and the outer
sum is taken over the 2n possible sign combinations for the components
of
.
The sample points used by Sn(Z) are very evenly spread over
the surface of the unit m-sphere.
Final estimates for
are given by
The standard error for the sample can be used to provide an error
estimate.
Alan C Genz
1999-10-21