首页> 外文会议>AIAA non-deterministic approaches conference >Variance-Based Adaptive Sparse Polynomial Chaos with Adaptive Sampling
【24h】

Variance-Based Adaptive Sparse Polynomial Chaos with Adaptive Sampling

机译:具有自适应采样的基于差异的自适应稀疏多项式混沌

获取原文

摘要

An algorithm to develop a stochastic model of the response using adaptive and sparse Polynomial Chaos Expansion (PCE) is proposed in this paper. This new algorithm is highly advantageous compared to the regular PCE in terms of the number of samples required and the computational cost to build a stochastic model. As a sampling strategy, the A-optimal design that minimizes the average of the variance of the PCE coefficients, and hence, increases the accuracy of the stochastic model is used. A non-intrusive stochastic collocation approach that uses linear regression is used to obtain the expansion coefficients, and the contribution of the individual expansion terms to the total variance of the response are used to form the sparse PCE. Also, a weighted sampling plan is utilized for the new sparse PCE to find a high-fidelity stochastic model which is then followed by the convergence analysis of the Kullback-Leibler (KL) divergence of the stochastic model's probability density function (PDF), not just the mean and standard deviation. The proposed algorithm has been implemented for two analytical problems and a fracture mechanics problem involving many random input variables to investigate its validity. The comparison of the results obtained with this algorithm to regular full PCE, q-norm truncation strategy for orthogonal polynomials, and Latin Hypercube Sampling (LHS) simulations are also provided. The results obtained from the application problems showed that highly accurate PCE models are obtainable with very few numbers of function evaluations and low computational cost than regular full PCE and q-norm truncation strategy with LHS samples. The absolute percentage error in mean and standard deviation of the converged PCE model was less than 0.2% and verified the superiority of this algorithm.
机译:本文提出了一种开发使用自适应和稀疏多项式混沌扩展(PCCE)开发响应随机模型的算法。这种新算法与所需样本数量的常规PCE相比,该新算法非常有利,并且构建随机模型的计算成本。作为采样策略,最终的A最佳设计,最小化PCE系数的方差的平均值,因此增加了使用随机模型的精度。使用线性回归的非侵入式随机搭配方法来获得扩展系数,并且各个扩展术语对响应总方差的贡献用于形成稀疏的PCE。此外,加权采样计划用于新的稀疏PCE,以找到高保真随机模型,然后是随机模型概率密度函数(PDF)的Kullback-Leibler(KL)发散的收敛性分析,而不是只是平均值和标准偏差。该算法已经实施了两个分析问题和涉及许多随机输入变量的裂缝力学问题,以研究其有效性。还提供了使用该算法获得的结果的比较,以常规全PCE,Q-Norm截断策略进行正交多项式,以及拉丁超立体采样(LHS)模拟。从应用问题获得的结果表明,高度准确的PCE模型可以通过与LHS样本的常规全PCE和Q-Norm截断策略相比,使用极少数量的功能评估和低计算成本获得。融合PCE模型的平均值和标准偏差的绝对百分比误差小于0.2%并验证了该算法的优越性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号