search_model_graphs

Perform a search over admissible model relationships for a given model ensemble

Specification

  • Alias: None

  • Arguments: None

  • Default: NO_GRAPH_RECURSION

Child Keywords:

Required/Optional

Description of Group

Dakota Keyword

Dakota Keyword Description

Optional

model_selection

Perform a recursion of admissible model subsets for a given model ensemble

Required (Choose One)

DAG Ensemble Generation Option

no_recursion

Do not recur over admissible DAGs for a given model ensemble

full_recursion

Perform a full recursion of all admissible DAGs for a given model ensemble

Description

Referring to generalized ACV (search_model_graphs and [BLWL22]), MFMC is a special case of generalized ACV-MF (acv_multifidelity) where a hierarchical DAG is employed across the model approximations. As such, a MFMC method specification that includes graph search forwards to the generalized ACV solver, but with fixing the DAG to be hierarchical (each approximation node points to the next approximation of higher fidelity/resolution, ending with the truth model at the root node) and fixing the sampling scheme to be ACV-MF.

While the use of a hierarchical DAG is required, the approximation selections and orderings within this DAG can be varied, so generalized ACV capabilities for model graph search (see full_recursion) and model selection (see model_selection) are available.