|
Class Summary |
| AntitheticPointSet |
This container class provides antithetic points. |
| BakerTransformedPointSet |
This container class embodies a point set to which a
Baker transformation is applied. |
| CachedPointSet |
This container class caches a point set by precomputing
and storing its points locally in an array. |
| 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. |
| CycleBasedPointSet |
This abstract class provides the basic structures for
storing and manipulating a highly uniform point set
defined by a set of cycles. |
| CycleBasedPointSetBase2 |
Similar to CycleBasedPointSet, except that the successive
values in the cycles are stored as integers in the range
{0,..., 2k -1}, where
1 <= k <= 31. |
| DigitalNet |
This class provides the basic structures for storing and
manipulating linear digital nets in base b, for an arbitrary
base b >= 2. |
| DigitalNetBase2 |
A special case of DigitalNet for the base b = 2. |
| 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. |
| 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. |
| DigitalSequence |
This abstract class describes methods specific to digital sequences. |
| DigitalSequenceBase2 |
This abstract class describes methods specific to digital sequences in base 2. |
| EmptyRandomization |
This class implements an empty
PointSetRandomization. |
| F2wCycleBasedLFSR |
This class creates a point set based upon a linear feedback shift register
sequence. |
| F2wCycleBasedPolyLCG |
This class creates a point set based upon
a linear congruential sequence in the finite field
F2w[z]/P(z). |
| F2wNetLFSR |
This class implements a digital net in base 2 starting from a
linear feedback shift register generator. |
| F2wNetPolyLCG |
This class implements a digital net in base 2 starting from a
polynomial LCG in
F2w[z]/P(z). |
| F2wStructure |
This class implements methods and fields needed by the classes
F2wNetLFSR,
F2wNetPolyLCG,
F2wCycleBasedLFSR and
F2wCycleBasedPolyLCG. |
| FaureSequence |
This class implements digital nets or digital sequences formed by the
first n = bk points of the Faure sequence in base b. |
| HaltonSequence |
This class implements the sequence of Halton,
which is essentially a modification of Hammersley nets for producing
an infinite sequence of points having low discrepancy. |
| HammersleyPointSet |
This class implements Hammersley point sets,
which are defined as follows. |
| KorobovLattice |
This class implements Korobov lattices, which are the same point sets
as in class LCGPointSet, but implemented differently. |
| KorobovLatticeSequence |
This class implements Korobov lattice sequences, defined as follows. |
| LCGPointSet |
Implements a recurrence-based point set defined via a linear
congruential recurrence of the form
xi = axi-1mod n
and
ui = xi/n. |
| LMScrambleShift |
This class implements a
PointSetRandomization
that performs a left matrix scrambling and adds a random digital
shift. |
| NiedSequenceBase2 |
This class implements digital sequences constructed from the
Niederreiter sequence in base 2. |
| NiedXingSequenceBase2 |
This class implements digital sequences based on the
Niederreiter-Xing sequence in base 2. |
| PaddedPointSet |
This container class realizes padded point sets, constructed
by taking some coordinates from a point set P1, other coordinates
from a point set P2, and so on. |
| PointSet |
This abstract class defines the basic methods
for accessing and manipulating point sets. |
| RadicalInverse |
This class implements basic methods for working with radical
inverses of integers in an arbitrary basis b. |
| RandomShift |
This class implements a
PointSetRandomization. |
| RandShiftedPointSet |
This container class embodies a point set to which a random shift
modulo 1 is applied (i.e., a single uniform random point is added
to all points, modulo 1, to randomize the inner point set). |
| Rank1Lattice |
This class implements point sets defined by integration
lattices of rank 1, defined as follows. |
| SMScrambleShift |
This class implements a
PointSetRandomization
that performs a striped matrix scrambling and adds a random
digital shift. |
| SobolSequence |
This class implements digital nets or digital sequences in base 2 formed by
the first n = 2k points of a Sobol' sequence. |
| SubsetOfPointSet |
This container class permits one to select a subset of a point set. |