{'fraction_non_alphanumeric': 0.022900763358778626, 'fraction_numerical': 0.0, 'mean_word_length': 5.9, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Variance‐based simplex stochastic collocation with model order reduction for high‐dimensional systems

In this work, an adaptive simplex stochastic collocation method is introduced in which sample refinement is informed by variability in the solution of the system. The proposed method is based on the concept of multi‐element stochastic collocation methods and is capable of dealing with very high‐dimensional models whose solutions are expressed as a vector, a matrix, or a tensor. The method leverages random samples to create a multi‐element polynomial chaos surrogate model that incorporates local anisotropy in the refinement, informed by the variance of the estimated solution. This feature makes it beneficial for strongly nonlinear and/or discontinuous problems with correlated non‐Gaussian uncertainties. To solve large systems, a reduced‐order model (ROM) of the high‐dimensional response is identified using singular value decomposition (higher‐order SVD for matrix/tensor solutions) and polynomial chaos is used to interpolate the ROM. The method is applied to several stochastic systems of varying type of response (scalar/vector/matrix) and it shows considerable improvement in performance compared to existing simplex stochastic collocation methods and adaptive sparse grid collocation methods.