Construction of uniform designs without replications

A uniform design scatters its design points evenly on the experimental domain according to some discrepancy measure. In this paper all the design points of a full factorial design can be split into two subdesigns. One is called the complementary design of the other. The complementary design theories of characterizing one design through the other under the four commonly used discrepancy measures are investigated. Based on these complementary design theories, some general rules for searching uniform designs through their complementary designs are proposed. An efficient method to check if a design has repeated points is introduced and a modified threshold-accepting algorithm is proposed to search uniform or nearly uniform designs without replications. The new algorithm is shown to be more efficient by comparing with other existing methods. Many new uniform or nearly uniform designs without replications are tabulated and compared.

[1]  Runze Li,et al.  Design and Modeling for Computer Experiments (Computer Science & Data Analysis) , 2005 .

[2]  F. J. Hickernell,et al.  Uniform designs limit aliasing , 2002 .

[3]  Kai-Tai Fang,et al.  UNIFORM DESIGNS BASED ON LATIN SQUARES , 1999 .

[4]  K. Fang,et al.  Number-theoretic methods in statistics , 1993 .

[5]  Kai-Tai Fang,et al.  Lower bounds for wrap-around L2-discrepancy and constructions of symmetrical uniform designs , 2005, J. Complex..

[6]  F. J. Hickernell Lattice rules: how well do they measure up? in random and quasi-random point sets , 1998 .

[7]  Runze Li,et al.  Design and Modeling for Computer Experiments , 2005 .

[8]  Dennis K. J. Lin,et al.  Optimal mixed-level supersaturated design , 2003 .

[9]  Xuan Lu,et al.  A new method in the construction of two-level supersaturated designs , 2000 .

[10]  K. Fang,et al.  Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points , 1997 .

[11]  A. Sudjianto,et al.  An Efficient Algorithm for Constructing Optimal Design of Computer Experiments , 2005, DAC 2003.

[12]  Peter Winker,et al.  Lower bounds and stochastic optimization algorithms for uniform designs with three or four levels , 2005, Math. Comput..

[13]  T. J. Mitchell,et al.  Exploratory designs for computational experiments , 1995 .

[14]  Kai-Tai Fang,et al.  Constructing uniform designs: A heuristic integer programming method , 2012, J. Complex..

[15]  Fred J. Hickernell,et al.  A generalized discrepancy and quadrature error bound , 1998, Math. Comput..

[16]  Kai-Tai Fang,et al.  A note on construction of nearly uniform designs with large number of runs , 2003 .