Journal
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING
Volume 350, Issue -, Pages 199-227Publisher
ELSEVIER SCIENCE SA
DOI: 10.1016/j.cma.2019.03.014
Keywords
Data-driven; Arbitrary randomness; Mutual dependence; Compressed sensing; Sparsity enhancement; Uncertainty quantification
Funding
- U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Collaboratory on Mathematics for Mesoscopic Modeling of Materials (CM4)
- National Institutes of Health [R01 GM069702]
- AMS Simons Post-doctoral Travel Grant
- PNNL Laboratory Directed Research & Development (LDRD)
Ask authors/readers for more resources
The challenge of quantifying uncertainty propagation in real-world systems is rooted in the high-dimensionality of the stochastic input and the frequent lack of explicit knowledge of its probability distribution. Traditional approaches show limitations for such problems, especially when the size of the training data is limited. To address these difficulties, we have developed a general framework of constructing surrogate models on spaces of stochastic input with arbitrary probability measure irrespective of the mutual dependencies between individual components of the random inputs and the analytical form. The present Data-driven Sparsity-enhancing Rotation for Arbitrary Randomness (DSRAR) framework includes a data-driven construction of multivariate polynomial basis for arbitrary mutually dependent probability measures and a sparsity enhancement rotation procedure. This sparsity enhancement method was initially proposed in our previous work (Lei et al., 2015) for Gaussian density distributions, which may not be feasible for non-Gaussian distributions due developed a new data-driven approach to construct orthonormal polynomials for arbitrary mutually dependent randomness, ensuring the constructed basis maintains the orthogonality/near-orthogonality with respect to the density of the rotated random vector, where directly applying the regular polynomial chaos including arbitrary polynomial chaos (aPC) Oladyshkin and Nowak (2012) shows limitations due to the assumption of the mutual independence between the components of the random inputs. The developed DSRAR framework leads to accurate recovery, with only limited training data, of a sparse representation of the target functions. The effectiveness of our method is demonstrated in challenging problems such as partial differential equations and realistic molecular systems within high-dimensional (O(10)) conformational spaces where the underlying density is implicitly represented by a large collection of sample data, as well as systems with explicitly given non-Gaussian probabilistic measures. (C) 2019 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available