1#@ s10: DependsOn=s9 2#@ s10: ExecArgs='-post_run dakota_dace.9.dat::' 3#@ s11: DependsOn=s7 4#@ s11: ExecArgs='-post_run dakota_dace.7.dat::' 5#@ p0: MPIProcs=4 6#@ p1: MPIProcs=4 7#@ p2: MPIProcs=4 8#@ p3: MPIProcs=5 9#@ p4: MPIProcs=5 10 11# DAKOTA INPUT FILE : dakota_dace.in 12 13environment, 14 tabular_data 15# tabular_data_file 'dakota_dace.9.dat' #s9 16# tabular_data_file 'dakota_dace.7.dat' #s7 17 18method, 19 dace oas seed = 5 #s0,#s9,#s10,#p0,#p1,#p2,#p3,#p4 20 quality_metrics #s0,#s9,#s10 21# dace oa_lhs seed = 5 #s8 22 samples = 49 symbols = 7 #s0,#s8,#p0,#p1,#p2,#p3,#p4 23# dace lhs seed = 5 #s1 24# samples = 50 symbols = 50 #s1 25# Test post-run with automatic samples/symbols adjustment, main effects, and 26# symbols to exercise dependencies in pre vs post run 27# main_effects #s9,#s10 28# samples = 42 symbols = 6 #s9,#s10 29# fsu_quasi_mc hammersley #s2,#s3 30# fsu_quasi_mc halton #s4,#s5 31# fsu_cvt #s6,#s7,#s11 32# samples = 100 #s2,#s3,#s4, #s5,#s6,#s7,#s11 33# latinize #s3,#s5,#s7,#s11 34# quality_metrics #s3,#s5,#s7,#s11 35# sequence_start 0 0 0 0 #s2,#s3,#s4,#s5 36# sequence_leap 1 1 1 1 #s2,#s3,#s4,#s5 37# prime_base 3 5 7 #s2 38# prime_base 2 3 5 7 #s4 39# seed = 50374 fixed_seed #s6,#s7,#s11 40# num_trials = 10000 #s6,#s7,#s11 41# max_iterations = 100 #s6,#s7,#s11 42# Test post-run for FSUDace 43# 44# output quiet #s1,#s2,#s3,#s4,#s5,#s6,#s7,#s8,#p0,#p1,#p2,#p3,#p4 45 46variables, 47 active all 48 continuous_design = 3 49 initial_point 1.0 1.0 1.0 50 lower_bounds 0.0 0.0 0.0 51 upper_bounds 2.0 2.0 2.0 52 continuous_state = 1 53 initial_state 4.0 54 lower_bounds 0.0 55 upper_bounds 8.0 56 57interface, 58 id_interface = 'I1' 59 analysis_drivers = 'text_book' 60 system 61# evaluation_scheduling master 62# Force following line as comment in test 0 for examples/advanced 63# evaluation_scheduling master #s0 64# evaluation_scheduling peer dynamic #p1,#p4 65# evaluation_servers = 4 #p4 66# processors_per_evaluation = 1 #p4 67 asynchronous #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7,#s8,#s9,#s10,#s11,#p2,#p3 68 evaluation_concurrency = 5 #s0,#s1,#s2,#s3,#s4,#s5,#s6,#s7,#s8,#s9,#s10,#s11,#p2 69# evaluation_concurrency = 10 #p3 70 71responses, 72 objective_functions = 1 73 nonlinear_inequality_constraints = 2 74 no_gradients 75 no_hessians 76