1#@ s*: Label=FastTest 2## DAKOTA INPUT FILE - dakota_unique_discrete_lhs.in 3 4# This file contains tests of the variable views override capability 5# in the context of LHS. It covers discrete and continuous variables 6# and considers only default and 'active all' views to 7# catch the most egregious problems. 8 9environment, 10 output_precision = 16 11 tabular_data 12 13method, 14 sampling 15 samples = 12 16 seed = 123456 17 sample_type lhs backfill 18 19variables, 20 active all 21# active uncertain is default 22 uniform_uncertain = 1 #s0,#s1,#s2,#s3,#s4 23 lower_bounds = 0. #s0,#s1,#s2,#s3,#s4 24 upper_bounds = 1. #s0,#s1,#s2,#s3,#s4 25 descriptors = 'continuous-uniform' #s0,#s1,#s2,#s3,#s4 26# 27 discrete_uncertain_set #s0,#s1,#s2,#s4,#s5 28 integer = 1 #s0,#s1,#s2,#s4,#s5 29 elements_per_variable = 4 #s0,#s1,#s2,#s4,#s5 30 elements 1 3 5 7 #s0,#s1,#s2,#s4,#s5 31 descriptors = 'design-set-int' #s0,#s1,#s2,#s4,#s5 32# 33 real = 1 #s0 34 initial_point = 0.50 #s0 35 set_values = 0.25 0.50 0.75 1.00 #s0 36 descriptors = 'design-set-real' #s0 37# 38# string = 1 #s2 39# elements = 'iso1' 'iso2' 'iso3' #s2 40# descriptors = 'uncertain-set-sting' #s2 41# 42# discrete_interval_uncertain = 1 #s1,#s3,#s5 43# lower_bounds = 0. #s1,#s3,#s5 44# upper_bounds = 4. #s1,#s3,#s5 45# descriptors = 'uncertain-range' #s1,#s3,#s5 46# 47# discrete_design_range = 1 #s1,#s3 48# lower_bounds = 0. #s1,#s3 49# upper_bounds = 4. #s1,#s3 50# descriptors = 'design-range' #s1,#s3 51# 52# discrete_state_set #s4 53# integer = 1 #s4 54# elements_per_variable = 4 #s4 55# elements 1 3 5 7 #s4 56# descriptors = 'state-set-int' #s4 57# 58# poisson_uncertain = 1 #s5 59# lambdas = 4. #s5 60# descriptors = 'uncertain-poisson' #s5 61 62interface, 63 direct analysis_driver = 'text_book' #s0,#s1,#s3,#s4,#s5 64# fork asynchronous evaluation_concurrency = 4 #s2 65# analysis_driver = 'gerstner_string' #s2 66 67responses, 68 response_functions = 3 #s0,#s1,#s3,#s4,#s5 69# response_functions = 1 #s2 70 no_gradients 71 no_hessians