Generation of Simplex Lattice Points


Complete text in Journal of Applied Statistics, 44(4), 534-545, 1995.


The need to generate systematically all points on a simplex lattice arises in a variety of statistical applications, including searches for optimal block designs, enumeration of the support space of a multinomial distribution, and construction of mixture designs. A variety of computer algorithms to accomplish this task previously have been reported. We present a new algorithm to generate all simplex lattice points by simulating nested loops. We implement our algorithm and the most efficient alternatives as ANSI C functions, and analytically and empirically demonstrate that the performance of our algorithm is superior to that of the alternatives considered.


Categorical Data Analysis | Design of Experiments and Sample Surveys | Numerical Analysis and Computation

This document is currently not available here.