Abstract
Sparse polynomial chaos expansion (PCE) can be used to emulate the stochastic model output where the original model is computationally expensive. It is a powerful tool in efficient uncertainty quantification and sensitivity analysis. Structural systems are usually associated with high dimensional and probabilistic input. The number of candidate basis functions increases significantly with input dimension, resulting in high computational burden for establishing sparse PCE. In this study, acceleration techniques are integrated to formulate an algorithm for efficient computation of sparse PCE (ASPCE). The integrated algorithm can improve efficiency of computational process compared with conventional greedy algorithm while ensuring the satisfying predictive performance. Once the sparse PCE model is obtained, the statistic moments, probability density function of stochastic output, and global sensitivity index could be computed efficiently. Traditional PCE based global sensitivity analysis only assesses the sensitivity on individual structural performance criterion. Assessing the global sensitivity considering multiple criteria is challenging as the sensitive parameters may not be consistent for different performance criteria. To address this issue, a two-stage multi-criteria global sensitivity analysis algorithm is proposed by coupling ASPCE and the technique for order preference by similarity to ideal solution (TOPSIS). A holistic global sensitivity index is proposed to identify the sensitive parameters incorporating multiple performance criteria. In order to illustrate the efficiency, accuracy, and applicability of the proposed approach, two illustrative cases are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.