![]() |
Dakota Reference Manual
Version 6.15
Explore and Predict with Confidence
|
Activate adaptive procedure for determining best rank representation
Alias: none
Argument(s): none
Default: false
The adaptive algorithm proceeds as follows:
start_rank
and form an approximationkick_rank
.max_rank
is reached or a converged rank (rank less than current reference with comparable accuracy) is found.Default Behavior
No cross validation for rank.
This example shows specification of a rank adaptation starting at rank 2, incrementing by 2, and limited at rank 10.
model, id_model = 'FT' surrogate global function_train start_order = 5 adapt_rank start_rank = 2 kick_rank = 2 max_rank = 10 solver_tolerance = 1e-12 rounding_tolerance = 1e-12 dace_method_pointer = 'SAMPLING'
Note that adapt_rank
and adapt_order
can either be combined or used separately.
These keywords may also be of interest: