LATIN_RANDOM
Latin Random Squares in M dimensions

LATIN_RANDOM is a C library which makes Latin Random Squares.

A Latin square is a selection of one point from each row and column of a square matrix or table. In M dimensions, the corresponding item is a set of N points, where, in each dimension, there is exactly one point whose coordinates are in a given "column" or range of values. To emphasize the use of higher dimensions, these objects are sometimes called Latin hypersquares.

A Latin Random Square (I just made up this name) is a set of N points, where one point is taken at random from each of the subsquares of a Latin Square. These points may be regarded as an M dimensional quasirandom pointset.

Licensing:

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

Languages:

LATIN_RANDOM is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.

Related Data and Programs:

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;

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.

LATIN_RANDOM_DATASET, a C program which computes a Latin Hypercube in M dimensions of N points, randomly placed within their subsquares.

NORMAL, a C library which computes elements of a sequence of pseudorandom normally distributed values.

UNIFORM, a C library which computes uniform random values.

Reference:

1. Paul Bratley, Bennett Fox, Linus Schrage,
   A Guide to Simulation,
   Springer Verlag, pages 201-202, 1983.
2. C J Colbourn, J H Dinitz,
   CRC Handbook of Combinatorial Design,
   CRC, 1996.
3. Bennett Fox,
   Algorithm 647:
   Implementation and Relative Efficiency of Quasirandom Sequence Generators,
   ACM Transactions on Mathematical Software,
   Volume 12, Number 4, pages 362-376, 1986.
4. M D McKay, W J Conover, R J Beckman,
   A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code,
   Technometrics,
   Volume 21, pages 239-245, 1979.
5. Albert Nijenhuis, Herbert Wilf,
   Combinatorial Algorithms,
   Academic Press, 1978, second edition,
   ISBN 0-12-519260-6.
6. Herbert Ryser,
   Combinatorial Mathematics,
   Mathematical Association of America, 1963.

Source Code:

• latin_random.c, the source code.
• latin_random.h, the include file.

Examples and Tests:

• latin_random_test.c, a sample calling program.
• latin_random_test.txt, the output file.

List of Routines:

• GET_SEED returns a random seed for the random number generator.
• I4_UNIFORM_AB returns a scaled pseudorandom I4 between A and B.
• I4VEC_PRINT prints an I4VEC.
• LATIN_RANDOM_NEW returns points in a Latin Random square.
• PERM_UNIFORM_NEW selects a random permutation of N objects.
• R8MAT_TRANSPOSE_PRINT prints an R8MAT, transposed.
• R8MAT_TRANSPOSE_PRINT_SOME prints some of an R8MAT, transposed.
• R8MAT_UNIFORM_01_NEW returns a unit pseudorandom R8MAT.
• R8MAT_WRITE writes an R8MAT file.
• TIMESTAMP prints the current YMDHMS date as a time stamp.

You can go up one level to the C source codes.