public class HaltonSequence extends PointSet
i = (ψb1(i), ψb2(i),..., ψbs(i)),
RadicalInverse, and where
2 = b1 < ... < bs are the s smallest prime numbers in
increasing order.
A fast method is implemented to generate randomized Halton sequences, starting from an arbitrary points x0.
The points can be ``scrambled'' by applying a permutation to the
digits of i before computing each coordinate, in the same way as for the class
HammersleyPointSet, for all coordinates j >= 0.
| Constructor and Description |
|---|
HaltonSequence(int dim)
Constructs a new Halton sequence
in dim dimensions.
|
| Modifier and Type | Method and Description |
|---|---|
void |
addFaurePermutations()
Permutes the digits using Faure permutations for all coordinates.
|
void |
ErasePermutations()
Erases the Faure permutations: from now on, the digits will not be
Faure permuted.
|
double |
getCoordinate(int i,
int j)
Returns ui, j, the coordinate j of the point i.
|
int |
getNumPoints()
Returns the number of points.
|
void |
init(double[] x0)
Initializes the Halton sequence starting at point x0.
|
addRandomShift, addRandomShift, addRandomShift, addRandomShift, clearRandomShift, formatPoints, formatPoints, formatPoints, formatPoints, formatPointsBase, formatPointsBase, formatPointsBase, formatPointsBase, formatPointsNumbered, formatPointsNumbered, getDimension, getStream, iterator, randomize, randomize, randomize, randomize, randomize, setStream, toString, unrandomizepublic HaltonSequence(int dim)
dim - dimensionpublic void init(double[] x0)
x0 - starting point of the Halton sequencepublic void addFaurePermutations()
public void ErasePermutations()
public int getNumPoints()
PointSetgetNumPoints in class PointSetpublic double getCoordinate(int i,
int j)
PointSetgetCoordinate in class PointSeti - index of the point to look forj - index of the coordinate to look forTo submit a bug or ask questions, send an e-mail to Pierre L'Ecuyer.