Uniform Design: Theory and Application

A uniform design (UD) seeks design points that are uniformly scattered on the domain. It has been popular since 1980. A survey of UD is given in the first portion: The fundamental idea and construction method are presented and discussed and examples are given for illustration. It is shown that UD's have many desirable properties for a wide variety of applications. Furthermore, we use the global optimization algorithm, threshold accepting, to generate UD's with low discrepancy. The relationship between uniformity and orthogonality is investigated. It turns out that most UD's obtained here are indeed orthogonal.

[1]  Kai-Tai Fang,et al.  Designing outer array points , 1995 .

[2]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[3]  Richard J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.

[4]  Peter Winker,et al.  Identification of multivariate AR-models by threshold accepting , 1995 .

[5]  H. Keng,et al.  Applications of number theory to numerical analysis , 1981 .

[6]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[7]  Dennis K. J. Lin.  A new class of supersaturated designs , 1993 .

[8]  Andrew Booker,et al.  Design and analysis of computer experiments , 1998 .

[9]  R. C. Bose,et al.  Orthogonal Arrays of Strength two and three , 1952 .

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

[11]  Dennis K. J. Lin.  Generating Systematic Supersaturated Designs , 1995 .

[12]  Tony Warnock,et al.  Computational investigations of low-discrepancy point-sets. , 1972 .

[13]  Lynne B. Hare,et al.  Experiments with Mixtures: Designs, Models and the Analysis of Mixture Data, 2nd Ed. , 1991 .

[14]  J. Cornell,et al.  Experiments with Mixtures , 1992 .

[15]  J. Cornell.  Experiments with Mixtures: Designs, Models and the Analysis of Mixture Data , 1982 .

[16]  Dennis K. J. Lin.  Another Look at First-Order Saturated Designs: The p-efficient Designs , 1993 .

[17]  Ingo Althöfer,et al.  On the convergence of “Threshold Accepting” , 1991 .

[18]  Donald E. Knuth,et al.  On Methods of Constructing Sets of Mutually Orthogonal Latin Squares Using a Computer. I , 1960 .

[19]  F. Pukelsheim.  Optimal Design of Experiments , 1993 .

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

[21]  Peter Winker,et al.  Optimal U—Type Designs , 1998 .

[22]  Peter Winker,et al.  Uniformity and Orthogonality , 1998 .

[23]  Kai-Tai Fang,et al.  Admissibility and minimaxity of the uniform design measure in nonparametric regression model , 2000 .

[24]  D. Raghavarao,et al.  Constructions and Combinatorial Problems in Design of Experiments , 1972 .

[25]  Charles G. Pfeifer.  Experiments with Mixtures: Design, Models, and the Analysis of Mixture Data , 1983 .

[26]  D. Wiens.  Designs for approximately linear regression: two optimality properties of uniform designs , 1991 .

[27]  D. Raghavarao.  Constructions and Combinatorial Problems in Design of Experiments , 1971 .

[28]  K Ang,et al.  A NOTE ON UNIFORM DISTRIBUTION AND EXPERIMENTAL DESIGN , 1981 .

[29]  Stefan Heinrich,et al.  Efficient algorithms for computing the L2-discrepancy , 1996, Math. Comput..

[30]  Arnold J. Stromberg,et al.  Number-theoretic Methods in Statistics , 1996 .

[31]  Rahul Mukerjee,et al.  On the existence of saturated and nearly saturated asymmetrical orthogonal arrays , 1995 .

[32]  D. H. Besterfield.  Quality control , 1979 .

[33]  R. J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output... , 2000 .

[34]  H. Wynn,et al.  Lattice-based D-optimum design for Fourier regression , 1997 .