Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Multifidelity conditional value-at-risk estimation by dimensionally decomposed generalized polynomial chaos-Kriging (2212.02728v3)

Published 6 Dec 2022 in math.NA and cs.NA

Abstract: We propose novel methods for Conditional Value-at-Risk (CVaR) estimation for nonlinear systems under high-dimensional dependent random inputs. We develop a novel DD-GPCE-Kriging surrogate that merges dimensionally decomposed generalized polynomial chaos expansion and Kriging to accurately approximate nonlinear and nonsmooth random outputs. We use DD-GPCE-Kriging (1) for Monte Carlo simulation (MCS) and (2) within multifidelity importance sampling (MFIS). The MCS-based method samples from DD-GPCE-Kriging, which is efficient and accurate for high-dimensional dependent random inputs, yet introduces bias. Thus, we propose an MFIS-based method where DD-GPCE-Kriging determines the biasing density, from which we draw a few high-fidelity samples to provide an unbiased CVaR estimate. To accelerate the biasing density construction, we compute DD-GPCE-Kriging using a cheap-to-evaluate low-fidelity model. Numerical results for mathematical functions show that the MFIS-based method is more accurate than the MCS-based method when the output is nonsmooth. The scalability of the proposed methods and their applicability to complex engineering problems are demonstrated on a two-dimensional composite laminate with 28 (partly dependent) random inputs and a three-dimensional composite T-joint with 20 (partly dependent) random inputs. In the former, the proposed MFIS-based method achieves 104x speedup compared to standard MCS using the high-fidelity model, while accurately estimating CVaR with 1.15% error.

Citations (3)

Summary

We haven't generated a summary for this paper yet.