.png){kind=icon}
.png){kind=icon}
Return
Variance-based adaptive sequential sampling for Polynomial Chaos Expansion
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cma.2021.114105.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a novel adaptive sequential sampling method for building Polynomial Chaos Expansion surrogate models. The technique enables one-by-one extension of an experimental design while trying to obtain an optimal sample at each stage of the adaptive sequential surrogate model construction process. The proposed sequential sampling strategy selects from a pool of candidate points by trying to cover the design domain proportionally to their local variance contribution. The proposed criterion for the sample selection balances both exploitation of the surrogate model and exploration of the design domain. The adaptive sequential sampling technique can be used in tandem with any user-defined sampling method, and here was coupled with commonly used Latin Hypercube Sampling and advanced Coherence D-optimal sampling in order to present its general performance. The obtained numerical results confirm its superiority over standard non-sequential approaches in terms of surrogate model accuracy and estimation of the output variance. (C) 2021 Elsevier B.V. All rights reserved.
Keywords:
Polynomial Chaos Expansion
Adaptive sampling
Sequential sampling
Coherence optimal sampling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.3W
Citations:
5.6W