Stochastic Simulation in Java

Highly Uniform Point Sets. More...
Classes  
class  AntitheticPointSet 
This container class provides antithetic points. More...  
class  BakerTransformedPointSet 
This container class embodies a point set to which a Baker transformation is applied (see, e.g., [82] ). More...  
class  CachedPointSet 
This container class caches a point set by precomputing and storing its points locally in an array. More...  
class  ContainerPointSet 
This acts as a generic base class for all container classes that contain a point set and apply some kind of transformation to the coordinates to define a new point set. More...  
class  CycleBasedLFSR 
LFSR generators produce numbers by generating a sequence of bits from a linear recurrence modulo 2, and forming fractional numbers by taking blocks of successive bits. More...  
class  CycleBasedPointSet 
This abstract class provides the basic structures for storing and manipulating a highly uniform point set defined by a set of cycles. More...  
class  CycleBasedPointSetBase2 
Similar to CycleBasedPointSet, except that the successive values in the cycles are stored as integers in the range \(\{0,…,2^k1\}\), where \(1\le k \le31\). More...  
class  DigitalNet 
This class provides the basic structures for storing and manipulating linear digital nets in base \(b\), for an arbitrary base \(b\ge2\). More...  
class  DigitalNetBase2 
A special case of DigitalNet for the base \(b=2\). More...  
class  DigitalNetBase2FromFile 
This class allows us to read the parameters defining a digital net in base 2 either from a file, or from a URL address on the World Wide Web. More...  
class  DigitalNetFromFile 
This class allows us to read the parameters defining a digital net either from a file, or from a URL address on the World Wide Web. More...  
class  DigitalSequence 
This abstract class describes methods specific to digital sequences. More...  
class  DigitalSequenceBase2 
This abstract class describes methods specific to digital sequences in base 2. More...  
class  EmptyRandomization 
This class implements an empty umontreal.ssj.hups.PointSetRandomization. More...  
class  F2wCycleBasedLFSR 
This class creates a point set based upon a linear feedback shift register sequence. More...  
class  F2wCycleBasedPolyLCG 
This class creates a point set based upon a linear congruential sequence in the finite field \(\mathbb F_{2^w}[z]/P(z)\). More...  
class  F2wNetLFSR 
This class implements a digital net in base 2 starting from a linear feedback shift register generator. More...  
class  F2wNetPolyLCG 
This class implements a digital net in base 2 starting from a polynomial LCG in \(\mathbb F_{2^w}[z]/P(z)\). More...  
class  F2wStructure 
This class implements methods and fields needed by the classes umontreal.ssj.hups.F2wNetLFSR, umontreal.ssj.hups.F2wNetPolyLCG, umontreal.ssj.hups.F2wCycleBasedLFSR and umontreal.ssj.hups.F2wCycleBasedPolyLCG. More...  
class  FaureSequence 
This class implements digital nets or digital sequences formed by the first \(n = b^k\) points of the Faure sequence in base \(b\). More...  
class  HaltonSequence 
This class implements the sequence of Halton [74] , which is essentially a modification of Hammersley nets for producing an infinite sequence of points having low discrepancy. More...  
class  HammersleyPointSet 
This class implements Hammersley point sets, which are defined as follows. More...  
class  IndependentPointsCached 
Similar to IndependentPoints, but the points are all generated and stored (cached) when the point set is randomized. More...  
class  KorobovLattice 
This class implements Korobov lattices, which represents the same point sets as in class LCGPointSet, but implemented differently. More...  
class  KorobovLatticeSequence 
class  LatinHypercube 
Implements Latin Hypercube Sampling (LHS) with \(n\) points in the \(s\)dimensional unit hypercube. More...  
class  LCGPointSet 
Implements a recurrencebased point set defined via a linear congruential recurrence of the form \(x_i = a x_{i1} \mod n\) and \(u_i = x_i / n\). More...  
class  LMScrambleShift 
This class implements a umontreal.ssj.hups.PointSetRandomization that performs a left matrix scrambling and adds a random digital shift. More...  
class  NestedUniformScrambling 
This class implements a PointSetRandomization that performs Owen's nested uniform scrambling [180], [184] . More...  
class  NiedSequenceBase2 
This class implements digital sequences constructed from the Niederreiter sequence in base 2. More...  
class  NiedXingSequenceBase2 
This class implements digital sequences based on the NiederreiterXing sequence in base 2. More...  
class  PaddedPointSet 
This container class realizes padded point sets, constructed by taking some coordinates from a point set \(P_1\), other coordinates from a point set \(P_2\), and so on. More...  
class  PointSet 
This abstract class defines the basic methods for accessing and manipulating point sets. More...  
interface  PointSetIterator 
Objects of classes that implement this interface are iterators that permit one to enumerate (or observe) the successive points of a point set and the successive coordinates of these points. More...  
interface  PointSetRandomization 
This interface is used to randomize a umontreal.ssj.hups.PointSet. More...  
class  RadicalInverse 
This class implements basic methods for working with radical inverses of integers in an arbitrary basis \(b\). More...  
class  RandomShift 
This class implements a umontreal.ssj.hups.PointSetRandomization. More...  
class  RandomStart 
This class implements a umontreal.ssj.hups.PointSetRandomization that randomizes a sequence with a random starting point. More...  
class  RandShiftedPointSet 
class  Rank1Lattice 
This class implements point sets specified by integration lattices of rank. More...  
class  RQMCPointSet 
This class is used for randomized quasiMonte Carlo (RQMC) simulations [123], [124], [181], [182] . More...  
class  SMScrambleShift 
This class implements a umontreal.ssj.hups.PointSetRandomization that performs a striped matrix scrambling and adds a random digital shift. More...  
class  SobolSequence 
This class implements digital nets or digital sequences in base 2 formed by the first \(n = 2^k\) points of a Sobol’ sequence [210], [211] . More...  
class  SortedAndCutPointSet 
class  StratifiedUnitCube 
This class implements a stratification of the unit cube in rectangular boxes of same size and orientation. More...  
class  StratifiedUnitCubeAnti 
This class implements a stratification of the unit cube in rectangular boxes of same size and orientation, similar to StratifiedUnitCube. More...  
class  SubsetOfPointSet 
This container class permits one to select a subset of a point set. More...  
Highly Uniform Point Sets.
This package provides classes implementing highly uniform point sets (HUPS) over the \(s\)dimensional unit hypercube \([0,1)^s\), and tools for their randomization. The terminology lowdiscrepancy sequence (LDS) is often used for infinite sequences of points such that the discrepancy between the distribution of the first \(n\) points of the sequence and the uniform distribution converges to zero at a certain rate when \(n\to\infty\) [177] . HUPS and LDS are used for quasiMonte Carlo integration, as we now briefly explain. See, e.g., [62], [67], [77], [124], [146], [183], [177], [208], [219] for further details.
Suppose we want to estimate the integral of a function \(f\) defined over the \(s\)dimensional unit hypercube,
\[ \mu= \int_{[0,1)^s} f(\mathbf{u}) d\mathbf{u}. \tag{mu} \]
Practically any mathematical expectation that can be estimated by simulation can be written in this way, usually for a very complicated \(f\) and sometimes for \(s=\infty\). Indeed, the source of randomness of stochastic simulations is usually a stream of real numbers \(\mathbf{u}= (u_0,u_1,u_2,…)\) whose purpose is to imitate i.i.d. \(U(0,1)\) random variables. These real numbers are transformed in complicated ways to produce the estimator. Thus, the dimension \(s\) of the integral ( mu ) represents the number of calls to the uniform random number generator if that number is deterministic. If it is random and unbounded, we take \(s = \infty\). In the latter case, however, we can assume that the actual number of calls is finite with probability one (otherwise the simulation may never end).
We consider an estimator of \(\mu\) of the form
\[ Q_n = \frac{1}{n} \sum_{i=0}^{n1} f(\mathbf{u}_i), \tag{Qn} \]
which is the average of \(f\) over the point set \(P_n = \{\mathbf{u}_0,…,\mathbf{u}_{n1}\} \subset[0,1)^s\).
With the Monte Carlo (MC) method, the \(\mathbf{u}_i\)’s are i.i.d. random vectors uniformly distributed over \([0,1)^s\). Then, \(Q_n\) is an unbiased estimator of \(\mu\) with variance \(\sigma^2/n\), where
\[ \sigma^2 = \int_{[0,1)^s} f^2(\mathbf{u}) d\mathbf{u} \mu^2, \]
and it obeys a centrallimit theorem if \(\sigma^2 < \infty\).
QuasiMonte Carlo (QMC) methods use point sets \(P_n\) that are more evenly distributed over the unit hypercube than typical random points. We call them highly uniform point sets (HUPS). The aim is to reduce the size of the integration error \(Q_n  \mu\). Two important classes of methods for constructing such point sets are digital nets and integration lattices [177], [208], [124], [67] . Both are implemented in this package, in various flavors.
To give an idea of how HUPS and LDS can be constructed, we start with a simple onedimensional example. If \(s=1\) and \(n\) is fixed, very simple highly uniform constructions are the point sets \(P_n = \{0, 1/n, …, (n1)/n\}\) and the shifted version \(P’_n = \{1/(2n), 3/(2n), …, (2n1)/(2n)\}\).
In \(s > 1\) dimensions, the simplest extensions would be as follows. Let \(n = d^s\) for some integer \(d\) and define \(P_n\) as the Cartesian product of \(s\) copies of the onedimensional sets \(P_d\); that is, \(P_n = \{(u_0,…,u_{s1}) : u_j \in\{0, 1/d, …, (d1)/d\}\) for each \(j\}\), and similarly for \(P’_n\). The point sets thus obtained are regular rectangular grids. Unfortunately, this approach breaks down rapidly when \(s\) gets large, because \(n\) must increase exponentially fast with \(s\) for fixed \(d\). Another important drawback is that when \(P_n\) is projected over lowerdimensional subspaces, several points are projected onto each other and become redundant [124] .
A better idea is to construct a point set \(P_n\) in \(s\) dimensions such that each onedimensional projection of \(P_n\) is the set of values \(\{0, 1/n, …, (n1)/n\}\). Of course, these values should not be visited in the same order for all coordinates, because otherwise all the points would lie on the diagonal line going from \((0,…,0)\) to \((1,…,1)\). In other words, for each coordinate \(j\), \(0\le j < s\), we must define a different permutation of the integers \(\{0,…,n1\}\) and visit the values \(\{0, 1/n, …, (n1)/n\}\) in the order determined by that permutation. The trick is to select those permutations in a way that \(P_n\) itself is highly uniform over \([0,1)^s\) in a welldefined sense (to be determined). This is what most construction methods attempt to achieve. Before looking at concrete ways of defining such permutations, we introduce a related issue: what to do if \(n\) is not fixed.
For \(s=1\), a simple way of filling up the unit interval \([0,1)\) uniformly is via the lowdiscrepancy sequence 0, 1/2, 1/4, 3/4, 1/8, 5/8, 3/8, 7/8, 1/16, 9/16, …, called the van der Corput sequence in base 2. More generally, select an integer \(b \ge2\), called the base. The radical inverse function in base \(b\), \(\psi_b : \mathbb{N}\to[0,1)\), is defined as follows. If \(i\) is a \(k\)digit integer in base \(b\) with digital \(b\)ary expansion
\[ i = a_0 + a_1 b + …+ a_{k1} b^{k1}, \]
then
\[ \psi_b(i) = a_0 b^{1} + a_1 b^{2} + \cdots+ a_{k1} b^{k}. \]
For a given \(b\), \(\psi_b(0), \psi_b(1), \psi_b(2), …\) is called the van der Corput sequence in base \(b\). This sequence fills up the unit interval \([0,1)\) quite uniformly. For example, for \(b=2\) we obtain the sequence mentioned above and for \(b=3\) we obtain 0, 1/3, 2/3, 1/9, 4/9, 7/9, 2/9, 5/9, 8/9, 1/27, 10/27, 19/27, …. Moreover, for two relatively prime bases \(b_1\) and \(b_2\), the two sequences have no value in common except 0.
For \(s > 1\), one could either take different (relatively prime) bases for the different coordinates, or take the same basis \(b\) but permute the successive values using a different permutation for each coordinate. These permutations are usually selected in a way that for every integer \(k\), the first \(b^k\) values that are enumerated remain the same (they are the values of \(\psi_b(i)\) for \(i=0,…,b^k1\)), but they are enumerated in a different order. Several digital net constructions (to be defined later) fit this framework.
If we decide to take different bases, the most natural choice is to take the \(j\)th smallest prime, \(b_j\), as a base for coordinate \(j1\); that is, base 2 for coordinate 0, base 3 for coordinate 1, base 5 for coordinate 2, and so on. The infinite sequence thus defined, where point \(i\) is
\[ \mathbf{u}_i = (\psi_{b_1}(i),\psi_{b_2}(i),…, \psi_{b_s}(i)) \tag{Haltonpoint} \]
for \(i \ge0\), was proposed in [74] and is called the Halton sequence. One drawback of this sequence is that for large \(s\), the base \(b_s\) becomes quite large.
In the case where \(n\) is fixed, we can always take \(i/n\) as the first coordinate of point \(i\). In particular, the Hammersley point set with \(n\) points in \(s\) dimensions contains the points
\[ \mathbf{u}_i = (i/n,\psi_{b_1}(i),\psi_{b_2}(i),…, \psi_{b_{s1}}(i)), \tag{Hammersleypoint} \]
for \(i=0,…,n1\) [76] . Historically, Halton sequences were defined as extensions of Hammersley point sets.
Digital nets and sequences are an important class of HUPS and LDS constructions. Most concrete implementations, e.g., those proposed by Sobol’, Faure, Niederreiter, and Niederreiter and Xing, are linear digital nets and sequences, defined as follows (see also [177], [219], [124] ).
Let \(b\ge2\) be an arbitrary integer (usually a prime number), called the base. A net that contains \(n = b^k\) points in \(s\) dimensions is defined via \(s\) generator matrices \(\mathbf{C}_0,…,\mathbf{C}_{s1}\), which are (in theory) \(\infty\times k\) matrices whose elements are in \(\mathbb{Z}_b = \{0,…,b1\}\). The matrix \(\mathbf{C}_j\) is used for coordinate \(j\) of all the points, for \(j\ge0\). To define the \(i\)th point \(\mathbf{u}_i\), for \(i=0,…,b^k1\), write the digital expansion of \(i\) in base \(b\) and multiply the vector of its digits by \(\mathbf{C}_j\) to obtain the digits of the expansion of \(u_{i,j}\), the \(j\)th coordinate of \(\mathbf{u}_i\). That is,
\begin{align} i & = \sum_{\ell=0}^{k1} a_{i,\ell} b^{\ell}, \tag{digitali} \\ \begin{pmatrix} u_{i,j,1} \\ u_{i,j,2} \\ \vdots \end{pmatrix} & = \mathbf{C}_j \begin{pmatrix} a_{i,0} \\ a_{i,1} \\ \vdots \\ a_{i,k1} \end{pmatrix} , \tag{digitalCj} \\ u_{i,j} & = \sum_{\ell=1}^{\infty}u_{i,j,\ell} b^{\ell}, \tag{digitaluij} \\ \mathbf{u}_i & = (u_{i,0},…,u_{i,s1}). \tag{digitalui} \end{align}
In practice, the expansion in ( digitaluij ) is truncated to the first \(r\) digits for some positive integer \(r\), so each matrix \(\mathbf{C}_j\) is actually truncated to a \(r\times k\) matrix. Typically \(r\) is equal to \(k\), or is slightly larger, or is selected so that \(b^r\) is near \(2^{31}\).
Usually, the first \(k\) lines of each \(\mathbf{C}_j\) form a nonsingular \(k\times k\) matrix. Then, the \(n\) output values for coordinate \(j\), \(u_{0,j},…, u_{n1,j}\), when truncated to their first \(k\) fractional digits in base \(b\), are a permutation of the numbers \(0, 1/n, …, (n1)/n\). Different coordinates simply use different permutations, implemented via the matrices \(\mathbf{C}_j\).
When the first \(k\) lines of \(\mathbf{C}_j\) form the identity and the other lines are zero, the first \(n\) output values are the first \(n\) elements of the van der Corput sequence in base \(b\). If we reverse the order of the columns of that matrix \(\mathbf{C}_j\) (i.e., column \(c\) will contain a one in line \(kc+1\) and zeros elsewhere, for \(0\le c < k\)), we obtain the output values \(0, 1/n, …, (n1)/n\) in that order. With a slight abuse of language, we shall call this first matrix (with the identity followed by lines of zeros) the identity and the second one (with the columns in reverse order) the reflected identity. It is customary to take \(\mathbf{C}_0\) as the identity for digital sequences, and often for digital nets as well. But for digital nets (where \(n\) is fixed in advance), one can take \(\mathbf{C}_0\) as the reflected identity instead, then \(\mathbf{C}_1\) as the identity, and so on. That is, the matrix \(\mathbf{C}_j\) for the digital net is taken as the matrix \(\mathbf{C}_{j1}\) of the digital sequence. Our package often gives the choice.
For digital sequences, the matrices \(\mathbf{C}_j\) actually have an infinite number of columns, although only the first \(k\) columns are needed to generate the first \(b^k\) points. So in practice, we never need to store more than a finite number of columns at a time. Whenever we find that we need more than \(b^k\) points for the current value of \(k\), we can simply increase \(k\) and add the corresponding columns to the matrices \(\mathbf{C}_j\).
The classes umontreal.ssj.hups.DigitalNet and umontreal.ssj.hups.DigitalSequence implement generic digital nets and sequences. Specific instances are constructed in subclasses of these two classes.
An integration lattice is a discrete (but infinite) subset of \(\mathbb{R}^s\) of the form
\[ L_s = \left\{\mathbf{v}= \sum_{j=1}^s h_j {\mathbf{v}_j} \mbox{ such that each } h_j\in\mathbb{Z}\right\}, \]
where \(\mathbf{v}_1,…,\mathbf{v}_s \in\mathbb{R}^s\) are linearly independent over \(\mathbb{R}\) and \(\mathbb{Z}^s \subseteq L_s\). This last condition means that \(L_s\) must contain all integer vectors, and this implies that \(L_s\) is periodic with period 1 along each of the \(s\) coordinates. The approximation of \(\mu\) by \(Q_n\) with the point set \(P_n = L_s \cap[0,1)^s\) is called a lattice rule [111], [208] . The value of \(n\) is the number of points of the lattice that are in the unit hypercube \([0,1)^s\).
Let \(\mathbf{V}\) be the matrix whose rows are the basis vectors \(\mathbf{v}_1,\cdots,\mathbf{v}_s\) and \(\mathbf{V}^{1}\) its inverse. One has \(\mathbb{Z}^s\subseteq L_s\) if and only if all entries of \(\mathbf{V}^{1}\) are integer. When this holds, \(n = \det(\mathbf{V}^{1})\) and all entries of \(\mathbf{V}\) are multiples of \(1/n\).
The rank of the lattice is the smallest \(r\) such that one can find a basis of the form \(\mathbf{v}_1,…, \mathbf{v}_r,\mathbf{e}_{r+1},\cdots,\mathbf{e}_s\), where \(\mathbf{e}_j\) is the \(j\)th unit vector in \(s\) dimensions. In particular, a lattice rule of rank 1 has a basis of the form \(\mathbf{v}_1 = (a_1, …, a_s)/n\) and \(\mathbf{v}_j = \mathbf{e}_j\) for \(j>1\), where \(a_j \in\mathbb{Z}_n\) for each \(j\). It is a Korobov rule if \(\mathbf{v}_1\) has the special form \(\mathbf{v}_1 = (1,\; a,\; a^2 \mod n,\; …,\; a^{s1} \mod n)/n\) for some \(a\in\mathbb{Z}_n\). The point set \(P_n\) of a Korobov lattice rule can also be written as \(P_n = \{(x_1,…,x_s)/n \mbox{ such that } x_1\in\mathbb{Z}_n \mbox{ and } x_j = a x_{j1} \mod n \mbox{ for all } j > 1\}\). This is the set of all vectors of successive values produced by a linear congruential generator (LCG) with modulus \(n\) and multiplier \(a\), from all possible initial states, including 0. In this case, the points are easy to enumerate by using the recurrence.
Certain types of point sets are defined pretty much like random number generators: choose a finite state space \(\mathcal{S}\), a transition function \(f : \mathcal{S}\to\mathcal{S}\), an output function \(g : \mathcal{S}\to[0,1)\), and define
\[ P_n = \{\mathbf{u}= (u_0,u_1,…) : s_0\in\mathcal{S}, s_j = f(s_{j1}), \mbox{ and } u_j = g(s_j) \mbox{ for all } j\}. \]
This is the set of all vectors of successive output values produced by the recurrence defined by \(f\) and the output function \(g\), from all possible initial states. The value of \(n\) is the cardinality of \(\mathcal{S}\) and the dimension \(s\) is infinite. We could also have \(n = \infty\) (an infinite sequence) if \(\mathcal{S}\) is infinite but denumerable and ordered (so we know in which order to enumerate the points).
Let us assume that \(n\) is finite and that for each \(s_0\in\mathcal{S}\), the recurrence \(s_j = f(s_{j1})\) is purely periodic, i.e., there is always an integer \(j\) such that \(s_j = s_0\). The smallest such \(j\), called the period length, depends in general on \(s_0\). Thus, the state space \(\mathcal{S}\) is partitioned into a finite number of cycles. The successive coordinates of any point \(\mathbf{u}\in P_n\) are periodic with period length equal to the length of the cycle that contains \(s_0\) (and the following \(s_j\)’s).
One way of implementing such a point set while avoiding to recompute \(f\) and \(g\) each time a coordinate is needed is to store explicitly all the cycles of the recurrence, in the form of a list of cycles. We can store either the successive \(u_j\)’s directly, or the successive \(s_j\)’s, over each cycle. The class umontreal.ssj.hups.CycleBasedPointSet provides the framework for doing that.
For example, a Korobov lattice point set is defined via the recurrence \(x_j = a x_{j1} \mod n\) and output function \(u_j = x_j/n\). If \(n\) is prime and \(a\) is a primitive element modulo \(n\), then there are two cycles: one of period 1 that contains only 0, and the other of period \(n1\). For more general \(n\) and \(a\), there will be more cycles. The class umontreal.ssj.hups.LCGPointSet constructs this type of point set and stores explicitly the successive values of \(u_j\) over the different cycles.
There are cases where \(n\) is a power of two, say \(n = 2^k\), and where the state \(s_j\) is represented as a \(k\)bit string. In that context, it is often more convenient to store the successive \(s_j\)’s instead of the successive \(u_j\)’s, over the set of cycles (e.g., if a random digital shift in base 2 is to be applied to randomize the points, it can be performed by applying a bitwise xor directly to \(s_j\)). When generating the coordinates, the \(s_j\)’s can be interpreted as \(2^k\)bit integers and multiplied by \(2^{k}\) to produce the output. This is supported by the class umontreal.ssj.hups.CycleBasedPointSetBase2. Special instances of this class are usually based on linear recurrences modulo 2 and they include the Korobovtype polynomial lattice rules [144], [122], [126], [153], [185] .
In their original versions, these HUPS are deterministic, and the corresponding QMC methods give a deterministic integration error that is difficult to estimate. In randomized QMC methods, \(P_n\) is randomized, preferably in a way that it retains its high uniformity over \([0,1)^s\) when taken as a set, while each of its points has the uniform distribution over \([0,1)^s\) when taken individually. Then, \(Q_n\) becomes an unbiased estimator of \(\mu\), hopefully with smaller variance than the standard MC estimator. To estimate the variance and compute a confidence interval on \(\mu\), one can apply \(m\) independent randomizations to the same \(P_n\), and compute \({\bar{X}_m}\) and \({S_{m,x}^2}\), the sample mean and sample variance of the \(m\) corresponding (independent) copies of \(Q_n\). Then, \(E[\bar{X}_m] = \mu\) and \(E[S_{m,x}^2] = \mathrm{Var}[Q_n] = m\mathrm{Var}[\bar{X}_m]\) [123] .
Two examples of such randomizations are the random shift modulo 1, proposed in [37] and implemented in class umontreal.ssj.hups.RandShiftedPointSet, and the random digital shift in base \(b\), described and implemented in class umontreal.ssj.hups.DigitalNet. These randomizations are also incorporated directly in certain types of point sets such as umontreal.ssj.hups.CycleBasedPointSet, umontreal.ssj.hups.CycleBasedPointSetBase2, etc.
In the random shift modulo 1, we generate a single point \(\mathbf{u}\) uniformly over \([0,1)^s\) and add it to each point of \(P_n\), coordinatewise, modulo 1. Since all points of \(P_n\) are shifted by the same amount, the set retains most of its structure and uniformity.
For the random digital shift in base \(b\), we generate again a single \(\mathbf{u}= (u_1,…,u_s)\) uniformly over \([0,1)^s\), write the digital expansion in base \(b\) of each of its coordinates, say \(u_j = \sum_{\ell=1}^{\infty}d_{j,\ell} b^{\ell}\), then add \(d_{j,\ell}\) modulo \(b\) to the \(\ell\)th digit of the digital expansion in base \(b\) of the \(j\)th coordinate of each point \(\mathbf{u}_i\in P_n\). For \(b=2\), the digitwise addition modulo \(b\) becomes a bitwise exclusiveor, which is fast to perform on a computer.
An interesting property of the digital shift in base \(b\) is that if the hypercube \([0,1)^s\) is partitioned into \(b^{q_1 + \cdots+ q_s}\) rectangular boxes of the same size by partitioning the \(j\)th axis into \(b^{q_j}\) equal parts for each \(j\), for some integers \(q_j \ge0\) (such a partition is called a \(\mathbf{q}\)equidissection in base \(b\) of the unit hypercube, where \(\mathbf{q}= (q_1,…,q_s)\)), then the number of boxes that contain \(m\) points, for each integer \(m\), is unchanged by the randomization. In particular, if each box contains the same number of points of \(P_n\) before the randomization, then it also does after the randomization. In this case, we say that \(P_n\) is \(\mathbf{q}\)equidistributed in base \(b\). Several other randomization methods exist and most are adapted to special types of point sets; see, e.g., umontreal.ssj.hups.DigitalNet and [184] .
Let \(\mathbf{u}_i = (u_{i,0}, u_{i,1}, …, u_{i,s1})\) be the elements of the point set \(P_n\), for \(i=0,…,n1\). Both the number of points \(n\) and the dimension \(s\) can be finite or infinite. The point set can be viewed as a twodimensional array whose element \((i,j)\) contains \(u_{i,j}\), the coordinate \(j\) of point \(i\). In the implementations of typical point sets, the values \(u_{i,j}\) are not stored explicitly in a twodimensional array, but pertinent information is organized so that the points and their coordinates can be generated efficiently. The base class for point sets is the abstract class umontreal.ssj.hups.PointSet.
To enumerate the successive points or the successive coordinates of a given point, we use point set iterators, which resemble the iterators defined in Java collections, except that they loop over bidimensional sets. Their general behavior is defined in the interface umontreal.ssj.hups.PointSetIterator. Several independent iterators can coexist at any given time for the same point set. Each one maintains a current point index and a current coordinate index, which are incremented by one when the iterator advances to the next point or the next coordinate. Both are initialized to 0. Each subclass of umontreal.ssj.hups.PointSet has its own implementation of umontreal.ssj.hups.PointSetIterator and has a method iterator
that creates and returns a new point set iterator of the correct type.
An important feature of the umontreal.ssj.hups.PointSetIterator interface is that it extends the umontreal.ssj.rng.RandomStream interface. This means that any point set iterator can be used in place of a random stream that is supposed to generate i.i.d. \(U(0,1)\) random variables, anywhere in a simulation program. It then becomes very easy to replace the (pseudo)random numbers by the coordinates \(u_{i,j}\) of a randomized HUPS without changing the internal code of the simulation program.
HUPS are often transformed either deterministically or randomly. Deterministic transformations can be applied to improve the uniformity, or to eliminate some points or coordinates (i.e., selecting subsets), or to concatenate point sets (padding), or to take an antithetic version of a point set, etc. Random transformations are used for randomized QMC. They are also useful when the average of a uniformity measure of interest over the outcomes of a certain type of randomization is much better than the worst case and may be better than the uniformity measure of the original point set. When a point set is transformed, we often want to keep the original as well, and we may want to apply different types of transformations or different independent randomizations to the same point set.
This can be achieved via container point sets, which are defined in terms of another point set to which they keep a reference and apply certain transformations. umontreal.ssj.hups.ContainerPointSet is the base class for such containers. One example is umontreal.ssj.hups.RandShiftedPointSet, which applies a random shift modulo 1 to the point set that it contains. Of course, the contained point set can be a container itself and this can be done recursively, but too many levels of recursiveness may impair the performance (speed).
To be done...
For each of the \(R\) replications of the simulation, do the following to compute the statistic \(x_r\), for \(r=0,…,R1\).
Perform \(n\) replications of the simulation, each with a different point in the point set. For each replication, one should obtain the result \(x_{r,i}\), where \(i=0,…,n1\).
Note: All the points from a finite point set should be used to fully take advantage of its low discrepancy.
\[ x_r=\frac{1}{n}\sum_{i=0}^{n1} x_{r,i}. \]
The (abstract) base class umontreal.ssj.hups.PointSet views a point set as a set of \(n\) points in the \(t\)dimensional unit hypercube \([0,1)^t\). A point set can also be viewed (and stored) as an \(n\times t\) matrix whose element \((i,j)\) is the \(j\)th coordinate of the \(i\)th point, for \(0\le i < n\) and \(0\le j < t\) (both the point and coordinate indexes start from zero). One can directly use methods of this class, but this is sometimes not the most efficient technique for accessing coordinates of a point set and it results in two versions of the same simulation application, one for Monte Carlo and another one for QuasiMonte Carlo. The class contains a method allowing one to construct a point set iterator which can traverse the point set more efficiently.
The umontreal.ssj.hups.PointSetIterator contains all needed methods to traverse a point set. One can return only one coordinate, \(t\) coordinates, change the current coordinate and current point index, reset the iterator, ... Since the class implements umontreal.ssj.rng.RandomStream, it can be used exactly as a uniform random number generator. This allows one to use the same application logic for MC and QMC simulation; only the initialization part will depend on the type of simulation. Every point set implements its own specialized iterator, allowing an efficient access to the coordinates.
The hups
package supports several types of point sets implemented in different classes extending umontreal.ssj.hups.PointSet. The umontreal.ssj.hups.CycleBasedPointSet class provides the needed basis for implementing cyclebased point sets. Each point is obtained by an initial value which lies in a given cycle. The coordinates are obtained by visiting all the points of the given cycle periodically, so the point set has an infinite dimension. The umontreal.ssj.hups.LCGPointSet is an implementation of a cyclebased point set whose cycles are generated using a small LCG. Such a point set corresponds to a Korobov lattice rule.
Generic rank 1 lattices rules are implemented in the class umontreal.ssj.hups.Rank1Lattice. Korobov lattice sequences are implemented in the class umontreal.ssj.hups.KorobovLatticeSequence.
Two types of digital nets are supported, namely base2 and base \(b\). They are implemented in separate base class because some optimizations can be done for the special case of base 2. The umontreal.ssj.hups.DigitalNetBase2 class, which implements digital nets in base 2, provides all required facilities for computing points from such a digital net. It also supports scrambling as randomization. A digital net implementation needs to provide the adequate generating matrices to the base class. Sobol, Niederreiter and NiederreiterXing sequences are supported in base 2.
The class umontreal.ssj.hups.DigitalNet provides the required facilities for implementing digital nets in an arbitrary base \(b\). For now, the only supported digital net in base \(b > 2\) is the Faure sequence.
Some supported point sets are nor lattice rules, nor digital nets. The Halton sequence and Hammersley net are ancestors of linear digital nets and sequences and they are implemented in ordinary and scrambled forms.
Randomization can be performed in two ways. The interface umontreal.ssj.hups.Randomization is used to specify randomizations transforming the structure of the point set, for example scrambling in the case of digital nets. The class umontreal.ssj.hups.PointSet contains an internal list of randomizations that will be applied sequentially when calling the method umontreal.ssj.hups.PointSet.randomize. The method umontreal.ssj.hups.PointSet.unrandomize restores the point set to its original, deterministic, structure. Other randomizations act somewhat like a filter and are implemented as container point sets. For example, the class umontreal.ssj.hups.RandShiftedPointSet represents a point set whose coordinates are shifted modulo 1 with a random factor. This shift is applied after the contained point set generates its coordinates and it can be applied to any point set.
The package uses container point set for other purposes than randomization. The class umontreal.ssj.hups.CachedPointSet can be used to store the coordinates of a point set. It is then stored internally as a matrix and can be accessed very efficiently. The umontreal.ssj.hups.SubsetOfPointSet allows one to constrain a point set’s size or dimension, for example to get the dimension of a cyclebased point set finite. The class umontreal.ssj.hups.PaddedPointSet gathers some coordinates of several point sets to construct a padded point set. The class umontreal.ssj.hups.AntitheticPointSet allows one to switch on or off the antithetic coordinates generation.
Such container point sets implement their own iterators that use the iterators of the contained point sets to access the points almost as efficiently as if the contained point set iterators were used directly.