1Blurb:: 2Design and Analysis of Computer Experiments 3Description:: 4The Distributed Design and Analysis of Computer Experiments (DDACE) 5library provides the following DACE techniques: 6 -# grid sampling (\c grid) 7 -# pure random sampling (\c random) 8 -# orthogonal array sampling (\c oas) 9 -# latin hypercube sampling (\c lhs) 10 -# orthogonal array latin hypercube sampling (\c oa_lhs) 11 -# Box-Behnken (\c box_behnken) 12 -# central composite design (\c central_composite) 13 14These methods all generate point sets that may be used to drive a set of 15computer experiments. Note that all of the DACE methods generated 16randomized designs, except for Box-Behnken and Central composite which 17are classical designs. That is, the grid sampling will generate a 18randomized grid, not what one typically thinks of as a grid 19of uniformly spaced points over a rectangular grid. Similar, 20the orthogonal array is a randomized version of an orthogonal 21array: it does not generate discrete, fixed levels. 22 23In addition to the selection of the method, there are keywords 24that affect the method outputs: 25 -# \ref method-dace-main_effects 26 -# \ref method-dace-quality_metrics 27 -# \ref method-dace-variance_based_decomp 28 29And keywords that affect the sampling: 30 -# \ref method-dace-fixed_seed 31 -# \ref method-dace-symbols 32 -# \ref method-dace-samples 33 -# \ref method-dace-seed 34 35 36 37Topics:: package_ddace, design_and_analysis_of_computer_experiments 38Examples:: 39Theory:: 40Faq:: 41See_Also:: method-fsu_cvt, method-fsu_quasi_mc, method-psuade_moat 42