Searcharxiv⌕ Search

arXiv subjects

S. Kucherenko

Publications and source records attributed to S. Kucherenko.

4 recordsLinked to original sources

R-Function Representation and Composition for Flexibility Analysis and Robust Design Spaces

Explicit multiparametric solutions provide analytical feasibility and design-space descriptions after elimination of adjustable variables. R-functions convert these descriptions into fields whose nonnegative regions represent feasible or robust designs. The principal contribution is the analytical composition of independently derived design spaces through union, intersection with engineering restrictions, and exclusion of prohibited regions, without repeating the underlying multiparametric elimination. A support-function construction supplies the robust design fields used in this composition. A two-parameter example demonstrates how alternative configurations, a manufacturing restriction and an exclusion combine into one admissible field. The resulting representations also support geometric interrogation of external boundaries, internal interfaces and limiting uncertainty contact, illustrated by a four-parameter heat-exchanger network. Explicit MPC offers a potential further application.

math.OC↗

The importance of being scrambled: supercharged Quasi Monte Carlo

In many financial applications Quasi Monte Carlo (QMC) based on Sobol low-discrepancy sequences (LDS) outperforms Monte Carlo showing faster and more stable convergence. However, unlike MC QMC lacks a practical error estimate. Randomized QMC (RQMC) method combines the best of two methods. Application of scrambled LDS allow to compute confidence intervals around the estimated value, providing a practical error bound. Randomization of Sobol' LDS by two methods: Owen's scrambling and digital shift are compared considering computation of Asian options and Greeks using hyperbolic local volatility model. RQMC demonstrated the superior performance over standard QMC showing increased convergence rates and providing practical error bounds.

q-fin.CP↗

Derivative-based global sensitivity measures and their link with Sobol sensitivity indices

The variance-based method of Sobol sensitivity indices is very popular among practitioners due to its efficiency and easiness of interpretation. However, for high-dimensional models the direct application of this method can be very time consuming and prohibitively expensive to use. One of the alternative global sensitivity analysis methods known as the method of derivative based global sensitivity measures (DGSM) has recently become popular among practitioners. It has a link with the Morris screening method and Sobol sensitivity indices. DGSM are very easy to implement and evaluate numerically. The computational time required for numerical evaluation of DGSM is generally much lower than that for estimation of Sobol sensitivity indices. We present a survey of recent advances in DGSM and new results concerning new lower and upper bounds on the values of Sobol total sensitivity indices. Using these bounds it is possible in most cases to get a good practical estimation of the values of Sobol total sensitivity indices. Several examples are used to illustrate an application of DGSM.

math.ST↗

Sobol' indices for problems defined in non-rectangular domains

A novel theoretical and numerical framework for the estimation of Sobol sensitivity indices for models in which inputs are confined to a non-rectangular domain (e.g., in presence of inequality constraints) is developed. Two numerical methods, namely the quadrature integration method which may be very efficient for problems of low and medium dimensionality and the MC/QMC estimators based on the acceptance-rejection sampling method are proposed for the numerical estimation of Sobol sensitivity indices. Several model test functions with constraints are considered for which analytical solutions for Sobol sensitivity indices were found. These solutions were used as benchmarks for verifying numerical estimates. The method is shown to be general and efficient.

math.ST↗