Bi-fidelity adaptive sparse reconstruction of polynomial chaos using Bayesian compressive sensing

被引:0
作者
Karimi, Mohamad Sadeq [1 ]
Mohammadi, Ramin [1 ]
Raisee, Mehrdad [2 ]
机构
[1] Sharif Univ Technol, Mech Engn Dept, Adv Res Turbomachinery Lab, Tehran, Iran
[2] Univ Tehran, Hydraul Machinery Res Inst, Coll Engn, Sch Mech Engn, Tehran, Iran
关键词
Uncertainty quantification; Sparse polynomial chaos expansion; Bayesian compressive sensing; Multi-fidelity; EFFICIENT UNCERTAINTY QUANTIFICATION; GLOBAL SENSITIVITY-ANALYSIS; ROBUST; DECOMPOSITION; REDUCTION; SELECTION; MODELS; FLOW;
D O I
10.1007/s00366-025-02112-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In recent years, non-intrusive polynomial chaos expansion (NIPCE) has been recognized as a practical method for uncertainty quantification (UQ) of stochastic problems. However, this method suffers from the curse of dimensionality, where the computational cost of constructing the expansion increases dramatically with the dimension of the stochastic space. Due to this issue, the application of classical NIPCE in real-world industrial problems with a large number of uncertainty sources becomes unaffordable. To manage the computational cost of UQ in high-dimensional stochastic problems, this paper introduces a novel, efficient method for multi-fidelity sparse reconstruction of NIPCE. The developed framework incorporates a multi-task adaptive Bayesian compressive sensing (MTABCS) method into the regression-based NIPCE. Firstly, a set of inexpensive deterministic computations is used to compress the chaos expansion by recovering the basis that strongly affect the response. Subsequently, the sparsely constructed expansion is refined using a limited number of high-fidelity computations. Two challenging CFD test cases, namely the transonic RAE2822 airfoil and the NASA Rotor 37, are considered to assess the performance of the developed method in realistic, large-scale engineering problems. The investigations indicate that, in addition to a considerable reduction in computational cost, the present method accurately reproduces the results of the classic NIPCE. It is observed that the MTABCS approach reduces the computational workload of UQ analysis in the test cases by an order of magnitude compared to the standard chaos expansion method.
引用
收藏
页数:21
相关论文
共 50 条
  • [1] An adaptive sparse polynomial dimensional decomposition based on Bayesian compressive sensing and cross-entropy
    He, Wanxin
    Li, Gang
    Nie, Zhaokun
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2022, 65 (01)
  • [2] Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification
    Felix Newberry
    Jerrad Hampton
    Kenneth Jansen
    Alireza Doostan
    Computational Mechanics, 2022, 69 : 405 - 424
  • [3] Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification
    Newberry, Felix
    Hampton, Jerrad
    Jansen, Kenneth
    Doostan, Alireza
    COMPUTATIONAL MECHANICS, 2022, 69 (02) : 405 - 424
  • [4] An adaptive sparse polynomial dimensional decomposition based on Bayesian compressive sensing and cross-entropy
    Wanxin He
    Gang Li
    Zhaokun Nie
    Structural and Multidisciplinary Optimization, 2022, 65
  • [5] A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design
    Zhang, Bei-Yang
    Ni, Yi-Qing
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2021, 386
  • [6] An adaptive dimension-reduction method-based sparse polynomial chaos expansion via sparse Bayesian learning and Bayesian model averaging
    He, Wanxin
    Zhao, Gang
    Li, Gang
    Liu, Ye
    STRUCTURAL SAFETY, 2022, 97
  • [7] An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework
    Zhou, Yicheng
    Lu, Zhenzhou
    Cheng, Kai
    Ling, Chunyan
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2019, 352 : 654 - 674
  • [8] Bi-fidelity conditional value-at-risk estimation by dimensionally decomposed generalized polynomial chaos expansion
    Lee, Dongjin
    Kramer, Boris
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2023, 66 (02)
  • [9] Bayesian sparse polynomial chaos expansion for global sensitivity analysis
    Shao, Qian
    Younes, Anis
    Fahs, Marwan
    Mara, Thierry A.
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2017, 318 : 474 - 496
  • [10] Compressive sensing adaptation for polynomial chaos expansions
    Tsilifis, Panagiotis
    Huan, Xun
    Safta, Cosmin
    Sargsyan, Khachik
    Lacaze, Guilhem
    Oefelein, Joseph C.
    Najm, Habib N.
    Ghanem, Roger G.
    JOURNAL OF COMPUTATIONAL PHYSICS, 2019, 380 : 29 - 47