2016
DOI: 10.1016/j.apm.2015.12.002
|View full text |Cite
|
Sign up to set email alerts
|

Incremental modeling of a new high-order polynomial surrogate model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
22
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 58 publications
(22 citation statements)
references
References 43 publications
0
22
0
Order By: Relevance
“…Under the circumstances that sufficient information is unavailable to define the distribution models of uncertainties, which is frequently encountered in engineering, the non-probabilistic methodologies can be applied alternatively [42][43][44][45][46][47]. The interval-based approaches [48][49][50], which require the bounds of the uncertain parameters only, are the typical ones among them. The orthogonal Chebyshev series based algorithms [42,48,49] are transparent, transplantable and non-intrusive.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Under the circumstances that sufficient information is unavailable to define the distribution models of uncertainties, which is frequently encountered in engineering, the non-probabilistic methodologies can be applied alternatively [42][43][44][45][46][47]. The interval-based approaches [48][49][50], which require the bounds of the uncertain parameters only, are the typical ones among them. The orthogonal Chebyshev series based algorithms [42,48,49] are transparent, transplantable and non-intrusive.…”
Section: Introductionmentioning
confidence: 99%
“…The interval-based approaches [48][49][50], which require the bounds of the uncertain parameters only, are the typical ones among them. The orthogonal Chebyshev series based algorithms [42,48,49] are transparent, transplantable and non-intrusive. These methods transform the uncertain dynamic equations into a set of deterministic ones without breaking into the original solution process.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, the incremental sampling method is employed to balance the conflict between the accuracy and the efficiency. In the incremental sampling method, the truncated order n starts from 2, and then, it will gradually increase until the termination condition is satisfied . However, the incremental sampling method is usually applied for the complex problems with numerous variables and high order, but it is not suitable for the case that the calculation of the sample point is very time consuming …”
Section: Cpe‐based Methodsmentioning
confidence: 99%
“…As a result, the efficiency of the ICPE method reduces significantly. Wu et al proposed the order increment strategy based on the high‐order Chebyshev polynomial surrogate model for the interval uncertainty analysis. The proposed method overcomes the routines of the expensive numerical simulations in engineering.…”
Section: Introductionmentioning
confidence: 99%
“…The metamodelling accuracy and efficiency can be significantly improved using sequential sampling algorithms. These algorithms start with a small set of initial points and iteratively extend the dataset [22,23,24].…”
Section: Introductionmentioning
confidence: 99%