halton

halton, an Octave code which computes elements of a Halton Quasi Monte Carlo (QMC) sequence using a simple interface.

A more sophisticated library is available in HALTON_ADVANCED, but I find this simple version to be preferable for everyday use!

The standard M-dimensional Halton sequence is simply composed of M 1-dimensional van der Corput sequences, using as bases the first M primes.

The HALTON function will return the M-dimensional element of this sequence with index I.

The HALTON_SEQUENCE function will return the M-dimensional elements of this sequence with indices I1 through I2.

The HALTON_INVERSE function accepts an M-dimensional value, presumably computed by HALTON, and returns its original index I.

The HALTON_BASE function allows the user to replace the standard basis of primes with some other choice.

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Languages:

halton is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.

Related Data and Programs:

halton_test

cvt, an Octave code which computes elements of a Centroidal Voronoi Tessellation.

faure, an Octave code which computes elements of a Faure sequence.

hammersley, an Octave code which computes elements of a Hammersley Quasi Monte Carlo (QMC) sequence, using a simple interface.

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.

lattice_rule, an Octave code which approximates multidimensional integrals using lattice rules.

niederreiter2, an Octave code which computes elements of a Niederreiter sequence using base 2.

sobol, an Octave code which computes elements of a Sobol 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 Quasi Monte Carlo (QMC) sequence using a simple interface.

Reference:

1. John Halton,
   On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals,
   Numerische Mathematik,
   Volume 2, 1960, pages 84-90.
2. John Halton, GB Smith,
   Algorithm 247: Radical-Inverse Quasi-Random Point Sequence,
   Communications of the ACM,
   Volume 7, 1964, pages 701-702.
3. Ladislav Kocis, William Whiten,
   Computational Investigations of Low-Discrepancy Sequences,
   ACM Transactions on Mathematical Software,
   Volume 23, Number 2, 1997, pages 266-294.

Source Code:

• halton_value.m, computes an element of a Halton sequence.
• halton_base.m, computes an element of a Halton sequence using user-specified bases.
• halton_inverse.m, computes the index of an element of a Halton sequence.
• halton_sequence.m, computes elements of a Halton sequence with indices I1 through I2.
• prime.m, returns a prime of the given index.
• r8mat_print.m, prints an R8MAT.
• r8mat_print_some.m, prints some of an R8MAT.