latin_center
    
    
    
      latin_center,
      an Octave code which 
      makes Latin Center Squares for sampling.
    
    
      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.
    
    
      Once a particular Latin square has been chosen, if we select
      the center point of each subsquare, we have a Latin Center Square
      dataset.
    
    
      Licensing:
    
    
      The information on this web page is distributed under the MIT license.
    
    
      Languages:
    
    
      latin_center is available in
      a C++ version and
      a Fortran90 version and
      a MATLAB version and
      an Octave version and
      a Python version.
    
    
      Related Data and Programs:
    
    
      
      latin_center_test
    
    
      
      latin_edge, 
      an Octave code which
      computes elements of a latin hypercube dataset, choosing 
      points on the edge.
    
    
      Reference:
    
    
      
        - 
          Paul Bratley, Bennett Fox, Linus Schrage,
          A Guide to Simulation,
          Springer Verlag, pages 201-202, 1983.
         
        - 
          C J Colbourn, J H Dinitz,
          CRC Handbook of Combinatorial Design,
          CRC, 1996.
         
        - 
          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.
         
        - 
          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.
         
        - 
          Albert Nijenhuis, Herbert Wilf,
          Combinatorial Algorithms,
          Academic Press, 1978, second edition,
          ISBN 0-12-519260-6.
         
        - 
          Herbert Ryser,
          Combinatorial Mathematics,
          Mathematical Association of America, 1963.
         
      
    
    
      Source Code:
    
    
      
    
    
    
      Last revised on 17 October 2022.