A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness

DOI10.1016/j.cma.2019.03.014zbMath1441.60004arXiv1804.08609OpenAlexW2903666595WikidataQ89619317 ScholiaQ89619317MaRDI QIDQ1987969

Yanyan Li

Publication date: 16 April 2020

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.08609

zbMATH Keywords

uncertainty quantificationcompressed sensingdata-drivensparsity enhancementmutual dependencearbitrary randomness

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Computational methods for problems pertaining to probability theory (60-08)

Related Items (2)

Data-driven molecular modeling with the generalized Langevin equation ⋮ Global sensitivity analysis: a Bayesian learning based polynomial chaos approach

Uses Software

• Gromacs
• APBS
• LINCS
• SETTLE
• Chaospy
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
• A probabilistic graphical model based stochastic input model construction
• Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
• An adaptive importance sampling algorithm for Bayesian inversion with multimodal distributions
• Sparse Legendre expansions via \(\ell_1\)-minimization
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Evaluation of failure probability via surrogate models
• Sparse pseudospectral approximation method
• SAMBA: sparse approximation of moment-based arbitrary polynomial chaos
• Enhancing sparsity of Hermite polynomial expansions by iterative rotations
• Identification and prediction of stochastic dynamical systems in a polynomial chaos basis
• A generalized polynomial chaos based ensemble Kalman filter with high accuracy
• Multi-element probabilistic collocation method in high dimensions
• The restricted isometry property and its implications for compressed sensing
• An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
• On Latin hypercube sampling
• Monte Carlo and quasi-Monte Carlo methods 1996. Proceedings of a conference at the University of Salzburg, Austria, July 9--12, 1996
• Design and analysis of computer experiments. With comments and a rejoinder by the authors
• Spectral polynomial chaos solutions of the stochastic advection equation
• Modeling uncertainty in flow simulations via generalized polynomial chaos.
• Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals
• Sparse polynomial chaos expansions via compressed sensing and D-optimal design
• Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
• A continuation multi level Monte Carlo (C-MLMC) method for uncertainty quantification in compressible inviscid aerodynamics
• An arbitrary polynomial chaos expansion approach for response analysis of acoustic systems with epistemic uncertainty
• On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
• A unified framework for mesh refinement in random and physical space
• Adaptive multi-element polynomial chaos with discrete measure: algorithms and application to SPDEs
• Bayesian Calibration of Computer Models
• Optimal Model Management for Multifidelity Monte Carlo Estimation
• Multilevel Monte Carlo Methods
• Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Accurate Uncertainty Quantification Using Inaccurate Computational Models
• Multi-Element Generalized Polynomial Chaos for Arbitrary Probability Measures
• Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• Large Sample Properties of Simulations Using Latin Hypercube Sampling
• A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
• The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
• Sparse Approximate Solutions to Linear Systems
• Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
• POLYNOMIAL-CHAOS-BASED KRIGING
• Generalized Sobol sensitivity indices for dependent variables: numerical methods
• Comparison of Surrogate-Based Uncertainty Quantification Methods for Computationally Expensive Simulators
• Stochastic Collocation vial₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
• STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
• Uncertainty propagation in CFD using polynomial chaos decomposition
• High-Order Collocation Methods for Differential Equations with Random Inputs
• Stable signal recovery from incomplete and inaccurate measurements
• Orthogonal Polynomials of Several Variables
• A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
• Combining experimental data and computer simulations, with an application to flyer plate experiments

This page was built for publication: A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness