Dakota Reference Manual: variance

| Dakota Reference Manual Version 6.15 Explore and Predict with Confidence

- Main Page
- Related Pages

All Pages
variance

Fit MLMC sample allocation to control the variance of the estimator for the variance.

## Specification

Alias: none

Argument(s): none

Child Keywords:

| Required/Optional | Description of Group | Dakota Keyword | Dakota Keyword Description
--- | --- | --- | --- | ---
| Optional | optimization | Solve the optimization problem for the sample allocation by numerical optimization in the case of sampling estimator targeting the variance.

## Description

Computes the variance of the sampling estimator for the variance and fits sample allocation by solving the corresponding optimization problem. This optimization problem is obtained in closed form with an analytical approximation. Additionally, a numerical optimization can be used in that case, see `optimization`.

## Examples

The following method block

    method,
        model_pointer = 'HIERARCH'
            multilevel_sampling
          pilot_samples = 20 seed = 1237
          convergence_tolerance = .01
          allocation_target = variance

uses the variance as sample allocation target by computing its variance.

## Theory

A single level unbiased estimator for the variance of a generic QoI at the highest level of the hierarchy can be written as

The multilevel extension for this estimator is obtained by writing

where

As for the expected value case, we want to obtain an optimal sample allocation per level that minimizes the cost to obtain an estimator with a prescribed variance. The variance of the multilevel estimator can be written as

where denotes the sampling estimator for the fourth order central moment. For more details about the expression that each single term takes in the previous expression, please refer to the Theory Manual.

The final sample allocation is obtained by solving a minimization problem

This optimization problem can be solved in two different ways, namely an analytical approximation and by solving a non-linear optimization problem. The analytical approximation follows the approach described in [Pisaroni2017] and introduces a helper variable

and the minimization problem is formulated as

This formulation has a closed form solution (similarly to the expected value case)

If the option optimization is specified the previous optimization problem is solved numerically via either OPTPP (default choice) or NPSOL (if available).

## See Also

These keywords may also be of interest:

- optimization