van_der_corput, a C++ code which computes the van der Corput Quasi Monte Carlo (QMC) sequence, using a simple interface.
The van der Corput sequence generates a sequence of points in [0,1] which never repeats. For positive index I, the elements of the van der Corput sequence are strictly between 0 and 1.
The I-th element of the van der Corput sequence is computed by writing I in the base B (usually 2) and then reflecting its digits about the decimal point. For example, if we start with I = 11, its binary expansion is 1011, and so its reflected binary expansion is 0.1101 which is 1/2+1/4+1/16=0.8125.
The generation is quite simple. Given an index I, the expansion of I in base B is generated. Then, essentially, the result R is generated by writing a decimal point followed by the digits of the expansion of I, in reverse order. This decimal value is actually still in base B, so it must be properly interpreted to generate a usable value.
Here is an example in base 2:
I (decimal) | I (binary) | R (binary) | R (decimal) |
---|---|---|---|
0 | 0 | .0 | 0.0 |
1 | 1 | .1 | 0.5 |
2 | 10 | .01 | 0.25 |
3 | 11 | .11 | 0.75 |
4 | 100 | .001 | 0.125 |
5 | 101 | .101 | 0.625 |
6 | 110 | .011 | 0.375 |
7 | 111 | .111 | 0.875 |
8 | 1000 | .0001 | 0.0625 |
The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.
van_der_corput is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.
BOX_BEHNKEN, a C++ code which computes a Box-Behnken design, that is, a set of arguments to sample the behavior of a function of multiple parameters;
CVT, a C++ code which computes points in a Centroidal Voronoi Tessellation.
FAURE, a C++ code which computes Faure sequences.
HALTON, a C++ code which computes elements of a Halton Quasi Monte Carlo (QMC) sequence, using a simple interface.
HAMMERSLEY, a C++ code which computes elements of a Hammersley Quasi Monte Carlo (QMC) sequence, using a simple interface.
IHS, a C++ code which computes improved Latin Hypercube datasets.
LATIN_CENTER, a C++ code which computes Latin square data choosing the center value.
LATIN_EDGE, a C++ code which computes Latin square data choosing the edge value.
LATIN_RANDOM, a C++ code which computes Latin square data choosing a random value in the square.
NIEDERREITER2, a C++ code which computes Niederreiter sequences with base 2.
NORMAL, a C++ code which computes a sequence of pseudorandom normally distributed values.
SOBOL, a C++ code which computes Sobol sequences.
UNIFORM, a C++ code which computes uniform random values.