Navigation auf zora.uzh.ch

Search ZORA

ZORA (Zurich Open Repository and Archive)

Adaptive surrogate modeling by ANOVA and sparse polynomial dimensional decomposition for global sensitivity analysis in fluid simulation

Tang, Kunkun; Congedo, Pietro M; Abgrall, Rémi (2016). Adaptive surrogate modeling by ANOVA and sparse polynomial dimensional decomposition for global sensitivity analysis in fluid simulation. Journal of Computational Physics, 314:557-589.

Abstract

The Polynomial Dimensional Decomposition (PDD) is employed in this work for the global sensitivity analysis and uncertainty quantification (UQ) of stochastic systems subject to a moderate to large number of input random variables. Due to the intimate connection between the PDD and the Analysis of Variance (ANOVA) approaches, PDD is able to provide a simpler and more direct evaluation of the Sobol' sensitivity indices, when compared to the Polynomial Chaos expansion (PC). Unfortunately, the number of PDD terms grows exponentially with respect to the size of the input random vector, which makes the computational cost of standard methods unaffordable for real engineering applications. In order to address the problem of the curse of dimensionality, this work proposes essentially variance-based adaptive strategies aiming to build a cheap meta-model (i.e. surrogate model) by employing the sparse PDD approach with its coefficients computed by regression. Three levels of adaptivity are carried out in this paper: 1) the truncated dimensionality for ANOVA component functions, 2) the active dimension technique especially for second- and higher-order parameter interactions, and 3) the stepwise regression approach designed to retain only the most influential polynomials in the PDD expansion. During this adaptive procedure featuring stepwise regressions, the surrogate model representation keeps containing few terms, so that the cost to resolve repeatedly the linear systems of the least-squares regression problem is negligible. The size of the finally obtained sparse PDD representation is much smaller than the one of the full expansion, since only significant terms are eventually retained. Consequently, a much smaller number of calls to the deterministic model is required to compute the final PDD coefficients.

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
Dewey Decimal Classification:510 Mathematics
Scopus Subject Areas:Physical Sciences > Numerical Analysis
Physical Sciences > Modeling and Simulation
Physical Sciences > Physics and Astronomy (miscellaneous)
Physical Sciences > General Physics and Astronomy
Physical Sciences > Computer Science Applications
Physical Sciences > Computational Mathematics
Physical Sciences > Applied Mathematics
Language:English
Date:1 June 2016
Deposited On:28 Mar 2018 10:56
Last Modified:18 Oct 2024 01:38
Publisher:Elsevier
ISSN:0021-9991
OA Status:Closed
Publisher DOI:https://doi.org/10.1016/j.jcp.2016.03.026

Metadata Export

Statistics

Citations

Dimensions.ai Metrics
29 citations in Web of Science®
35 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

1 download since deposited on 28 Mar 2018
0 downloads since 12 months
Detailed statistics

Authors, Affiliations, Collaborations

Similar Publications