Sparse polynomial chaos expansion for high-dimensional nonlinear damage mechanics

被引:3
|
作者
Oliveira, Esther dos Santos [1 ]
Nackenhorst, Udo [1 ]
机构
[1] Leibniz Univ Hannover, Inst Mech & Computat Mech IBNM, Appelstr 9a, D-30167 Hannover, Lower Saxony, Germany
关键词
Sparse polynomial chaos expansion; High-dimensional; Damage modelling; Random field; Effective sampling; UNCERTAINTY QUANTIFICATION;
D O I
10.1016/j.probengmech.2023.103556
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
Finite Element Simulations in solid mechanics are nowadays common practice in engineering. However, considering uncertainties based on this powerful method remains a challenging task, especially when nonlinearities and high stochastic dimensions have to be taken into account. Although Monte Carlo Simulation (MCS) is a robust method, the computational burden is high, especially when a nonlinear finite element analysis has to be performed behind each sample. To overcome this burden, several "model-order reduction"techniques have been discussed in the literature. Often, these studies are limited to quite smooth responses (linear or smooth nonlinear models and moderate stochastic dimensions).This paper presents systematic studies of the promising Sparse Polynomial Chaos Expansion (SPCE) method to investigate the capabilities and limitations of this approach using MCS as a benchmark. A nonlinear damage mechanics problem serves as a reference, which involves random fields of material properties. By this, a clear limitation of SPCE with respect to the stochastic dimensionality could be shown, where, as expected, the advantage over MCS disappears.As part of these investigations, options to optimise SPCE have been studied, such as different error measures and optimisation algorithms. Furthermore, we have found that combining SPCEs with sensitivity analysis to reduce the stochastic dimension improves accuracy in many cases at low computational cost.
引用
收藏
页数:12
相关论文
共 50 条
  • [41] High-dimensional sparse Fourier algorithms
    Bosu Choi
    Andrew Christlieb
    Yang Wang
    Numerical Algorithms, 2021, 87 : 161 - 186
  • [42] High-Dimensional Computing with Sparse Vectors
    Laiho, Mika
    Poikonen, Jussi H.
    Kanerva, Pentti
    Lehtonen, Eero
    2015 IEEE BIOMEDICAL CIRCUITS AND SYSTEMS CONFERENCE (BIOCAS), 2015, : 515 - 518
  • [43] On the anonymization of sparse high-dimensional data
    Ghinita, Gabriel
    Tao, Yufei
    Kalnis, Panos
    2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, : 715 - +
  • [44] The sparse structure of high-dimensional integrands
    Verlinden, P
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2001, 132 (01) : 33 - 49
  • [45] High-Dimensional Sparse Linear Bandits
    Hao, Botao
    Lattimore, Tor
    Wang, Mengdi
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [46] Sparse High-Dimensional Models in Economics
    Fan, Jianqing
    Lv, Jinchi
    Qi, Lei
    ANNUAL REVIEW OF ECONOMICS, VOL 3, 2011, 3 : 291 - 317
  • [47] High-Dimensional Indexing by Sparse Approximation
    Borges, Pedro
    Mourao, Andre
    Magalhaes, Joao
    ICMR'15: PROCEEDINGS OF THE 2015 ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA RETRIEVAL, 2015, : 163 - 170
  • [48] Classification with High-Dimensional Sparse Samples
    Huang, Dayu
    Meyn, Sean
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [49] Interpolation of sparse high-dimensional data
    Thomas C. H. Lux
    Layne T. Watson
    Tyler H. Chang
    Yili Hong
    Kirk Cameron
    Numerical Algorithms, 2021, 88 : 281 - 313
  • [50] High-dimensional sparse Fourier algorithms
    Choi, Bosu
    Christlieb, Andrew
    Wang, Yang
    NUMERICAL ALGORITHMS, 2021, 87 (01) : 161 - 186