niederreiter2, an Octave code which produces elements of the Niederreiter quasirandom sequence, using a base of 2.
A quasirandom or low discrepancy sequence, such as the Faure, Halton, Hammersley, Niederreiter or Sobol sequences, is "less random" than a pseudorandom number sequence, but more useful for such tasks as approximation of integrals in higher dimensions, and in global optimization. This is because low discrepancy sequences tend to sample space "more uniformly" than random numbers. Algorithms that use such sequences may have superior convergence.
NIEDERREITER2 is an adapation of the INLO2 and GOLO2 routines in ACM TOMS Algorithm 738. The original code can only compute the "next" element of the sequence. The revised code allows the user to specify the index of any desired element.
The original, true, correct version of ACM TOMS Algorithm 738 is available in the TOMS subdirectory of the NETLIB web site.
The computer code and data files described and made available on this web page are distributed under the MIT license
niederreiter2 is available in a C++ version and a Fortran90 version and a MATLAB version and an Octave version.
cvt, an Octave code which computes elements of a Centroidal Voronoi Tessellation.
faure, an Octave code which computes elements of a Faure quasirandom sequence.
halton, an Octave code which computes elements of a Halton quasirandom sequence.
hammersley, an Octave code which computes elements of a Hammersley quasirandom sequence.
latin_center, an Octave code which computes elements of a Latin Hypercube dataset, choosing center points.
latin_edge, an Octave code which computes elements of a Latin Hypercube dataset, choosing edge points.
latin_random, an Octave code which computes elements of a Latin Hypercube dataset, choosing points at random.
sobol, an Octave code which computes elements of a Sobol quasirandom sequence.
uniform, an Octave code which computes elements of a uniform pseudorandom sequence.
van_der_corput, an Octave code which computes elements of a 1D van der Corput sequence.
MATLAB version by John Burkardt; performance enhancements by Jeremy Dewar, Tulane University.