.png){kind=icon}
返回
An expanded sparse Bayesian learning method for polynomial chaos expansion
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ymssp.2019.03.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Polynomial chaos expansion (PCE) has been proven to be a powerful tool for developing surrogate models in various engineering fields for uncertainty quantification. The computational cost of full PCE is unaffordable due to the curse of dimensionality of the expansion coefficients. In this paper, an expanded sparse Bayesian learning method for sparse PCE is proposed. Firstly, basis polynomials of the full PCE are partitioned into significant terms and complementary non-significant terms. The parameterized priors with distinct variance are assigned to the candidates for the significant terms. Then, the dimensionality of the parameter space is equivalent to the assumed sparsity level of the PCE. Secondly, an approximate Kashyap information criterion (KIC) rule which achieves a balance between model simplicity and goodness of fit is derived for model selection. Finally, an automatic search algorithm is proposed by minimizing the KIC objective function and using the variance contribution of each term to the model output to select significant terms. To assess the performance of the proposed method, a detailed comparison is completed with several well-established techniques. The results show that the proposed method is able to identify the most significant PC contributions with superior efficiency and accuracy. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
Polynomial chaos expansion
Sparse Bayesian learning
Kashyap information criterion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
1.3W
被引数:
6.6W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏分享收藏
查看更多内容