Global sensitivity analysis with a hierarchical sparse metamodeling method

被引:12
作者
Zhao, Wei [1 ,2 ,3 ]
Bu, Lingze [1 ]
机构
[1] Harbin Inst Technol, Sch Civil Engn, Harbin 150090, Heilongjiang, Peoples R China
[2] Harbin Inst Technol, Minist Educ, Key Lab Struct Dynam Behav & Control, Harbin 150090, Heilongjiang, Peoples R China
[3] Harbin Inst Technol, Minist Ind & Informat Technol, Key Lab Smart Prevent & Mitigat Civil Engn Disast, Harbin 150090, Heilongjiang, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Global sensitivity analysis; Polynomial chaos expansion; Curse of dimensionality; Partial least squares regression; Penalized matrix decomposition; POLYNOMIAL CHAOS EXPANSIONS; STRUCTURAL RELIABILITY; REGRESSION; APPROXIMATION; EQUATIONS; INDEXES; MODELS;
D O I
10.1016/j.ymssp.2018.06.044
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
To meet the numerical challenges of polynomial chaos expansion for global sensitivity analysis in high stochastic dimensions, this paper proposes a new metamodeling method named hierarchical sparse partial least squares regression-polynomial chaos expansion (HSPLSR-PCE). Firstly, to avoid large data sets, the polynomials are divided into groups according to their nonlinearity degrees and interaction intensities (number of inputs). Then, to circumvent the multicollinearity, latent variables are extracted from each group by using partial least squares regression. Next, the optimal latent variables are automatically selected with the penalized matrix decomposition scheme. Finally, the Sobol sensitivity indices are straightforwardly derived from the expansion coefficients. Results of three examples demonstrate that the proposed method is superior to the traditional counterpart in terms of computational efficiency and accuracy. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:769 / 781
页数:13
相关论文
共 50 条
  • [1] A robust and efficient stepwise regression method for building sparse polynomial chaos expansions
    Abraham, Simon
    Raisee, Mehrdad
    Ghorbaniasl, Ghader
    Contino, Francesco
    Lacor, Chris
    [J]. JOURNAL OF COMPUTATIONAL PHYSICS, 2017, 332 : 461 - 474
  • [2] [Anonymous], 2008, From Nano to Space
  • [3] [Anonymous], 2009, THESIS CLERMONT FERR
  • [4] [Anonymous], 2000, SENSITIVITY ANAL
  • [5] Berveiller M, 2004, P 9 ASCE SPEC C PROB
  • [6] Adaptive sparse polynomial chaos expansion based on least angle regression
    Blatman, Geraud
    Sudret, Bruno
    [J]. JOURNAL OF COMPUTATIONAL PHYSICS, 2011, 230 (06) : 2345 - 2367
  • [7] Efficient computation of global sensitivity indices using sparse polynomial chaos expansions
    Blatman, Geraud
    Sudret, Bruno
    [J]. RELIABILITY ENGINEERING & SYSTEM SAFETY, 2010, 95 (11) : 1216 - 1229
  • [8] An adaptive algorithm to build up sparse polynomial chaos expansions for stochastic finite element analysis
    Blatman, Geraud
    Sudret, Bruno
    [J]. PROBABILISTIC ENGINEERING MECHANICS, 2010, 25 (02) : 183 - 197
  • [9] A new uncertainty importance measure
    Borgonovo, E.
    [J]. RELIABILITY ENGINEERING & SYSTEM SAFETY, 2007, 92 (06) : 771 - 784
  • [10] THE ORTHOGONAL DEVELOPMENT OF NON-LINEAR FUNCTIONALS IN SERIES OF FOURIER-HERMITE FUNCTIONALS
    CAMERON, RH
    MARTIN, WT
    [J]. ANNALS OF MATHEMATICS, 1947, 48 (02) : 385 - 392