Generation of Simplex Lattice Points
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
Chasalow, Scott and Brand, Richard, "Generation of Simplex Lattice Points" (August 1992). U.C. Berkeley Division of Biostatistics Working Paper Series. Working Paper 36.
This document is currently not available here.