dace
Design and Analysis of Computer Experiments
Topics
Specification
Alias: None
Arguments: None
JSON argument key: None
Child Keywords:
Required/Optional |
Description of Group |
JSON Group Key |
Dakota Keyword |
Dakota Keyword Description |
|---|---|---|---|---|
Optional |
Identifier for model block to be used by a method |
|||
Optional |
Activates global sensitivity analysis based on decomposition of response variance into contributions from variables |
|||
Optional |
Seed of the random number generator |
|||
Optional |
Reuses the same seed value for multiple random sampling sets |
|||
Optional |
Name the method block; helpful when there are multiple |
|||
Optional |
Control how much method information is written to the screen and output file |
|||
Optional |
Number of designs returned as the best solutions |
|||
Required (Choose One) |
Sub Method |
sub_method |
Grid Sampling |
|
Uses purely random Monte Carlo sampling to sample variables |
||||
Orthogonal Array Sampling |
||||
Uses Latin Hypercube Sampling (LHS) to sample variables |
||||
Orthogonal Array Latin Hypercube Sampling |
||||
Box-Behnken Design |
||||
Central Composite Design |
||||
Optional |
Number of samples for sampling-based methods |
|||
Optional |
ANOVA |
|||
Optional |
Calculate metrics to assess the quality of quasi-Monte Carlo samples |
|||
Optional |
Number of replications in the sample set |
Description
The Distributed Design and Analysis of Computer Experiments (DDACE) library provides the following DACE techniques:
grid sampling (
grid)pure random sampling (
random)orthogonal array sampling (
oas)latin hypercube sampling (
lhs)orthogonal array latin hypercube sampling (
oa_lhs)Box-Behnken (
box_behnken)central composite design (
central_composite)
These methods all generate point sets that may be used to drive a set of computer experiments. Note that all of the DACE methods generated randomized designs, except for Box-Behnken and Central composite which are classical designs. That is, the grid sampling will generate a randomized grid, not what one typically thinks of as a grid of uniformly spaced points over a rectangular grid. Similar, the orthogonal array is a randomized version of an orthogonal array: it does not generate discrete, fixed levels.
In addition to the selection of the method, there are keywords that affect the method outputs:
And keywords that affect the sampling:

