IHS is a C++ library which carries out the improved distributed hypercube sampling (IHS) algorithm.
N Points in an M dimensional Latin hypercube are to be selected. Each of the M coordinate dimensions is discretized to the values 1 through N. The points are to be chosen in such a way that no two points have any coordinate value in common. This is a standard Latin hypercube requirement, and there are many solutions.
This algorithm differs in that it tries to pick a solution which has the property that the points are "spread out" as evenly as possible. It does this by determining an optimal even spacing, and using the duplication factor D to allow it to choose the best of the various options available to it (the more duplication, the better chance of optimization).
One drawback to this algorithm is that it requires an internal real distance array of dimension D * N * N. For a relatively moderate problem with N = 1000, this can exceed the easily accessible memory. Moreover, the program is inherently quadratic in N in execution time as well as memory; the computation of the I-th point in the set of N requires a consideration of the value of the coordinates used up by the previous points, and the distances from each of those points to the candidates for the next point.
The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.
IHS is available in a C++ version and a FORTRAN90 version and a MATLAB version.
BOX_BEHNKEN, a C++ library 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++ library which computes elements of a Centroidal Voronoi Tessellation.
FAURE, a C++ library which computes elements of a Faure quasirandom sequence.
GRID, a C++ library which computes elements of a grid sequence.
HALTON, a C++ library which computes elements of a Halton Quasi Monte Carlo (QMC) sequence, using a simple interface.
HAMMERSLEY, a C++ library which computes elements of a Hammersley Quasi Monte Carlo (QMC) sequence, using a simple interface.
HEX_GRID, a C++ library which computes elements of a hexagonal grid dataset.
LATIN_CENTER, a C++ library which computes elements of a Latin Hypercube dataset, choosing center points.
LATIN_EDGE, a C++ library which computes elements of a Latin Hypercube dataset, choosing edge points.
LATIN_RANDOM, a C++ library which computes elements of a Latin Hypercube dataset, choosing points at random.
LCVT, a C++ library which computes a latinized Centroidal Voronoi Tessellation.
NIEDERREITER2, a C++ library which computes elements of a Niederreiter quasirandom sequence using base 2.
NORMAL, a C++ library which computes elements of a sequence of pseudorandom normally distributed values.
SOBOL, a C++ library which computes elements of a Sobol quasirandom sequence.
TABLE_QUALITY, a C++ program which measures the dispersion quality of points in a dataset read from a file.
UNIFORM, a C++ library which computes elements of a uniform pseudorandom sequence.
VAN_DER_CORPUT, a C++ library which computes elements of a 1D van der Corput sequence.
You can go up one level to the C++ source codes.