A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness (Q1987969): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 16:33, 16 December 2024

scientific article

Language	Label	Description	Also known as
English	A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness	scientific article

Statements

scholarly article

0 references

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

0 references

0 references

Computer Methods in Applied Mechanics and Engineering

0 references

publication date

16 April 2020

0 references

full work available at URL

https://arxiv.org/abs/1804.08609

0 references

http://europepmc.org/articles/pmc7007047

0 references

zbMATH Keywords

data-driven

0 references

arbitrary randomness

0 references

mutual dependence

0 references

compressed sensing

0 references

sparsity enhancement

0 references

uncertainty quantification

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Multilevel Monte Carlo Methods

0 references

0 references

A continuation multi level Monte Carlo (C-MLMC) method for uncertainty quantification in compressible inviscid aerodynamics

0 references

Accurate Uncertainty Quantification Using Inaccurate Computational Models

0 references

Optimal Model Management for Multifidelity Monte Carlo Estimation

0 references

0 references

Monte Carlo and quasi-Monte Carlo methods 1996. Proceedings of a conference at the University of Salzburg, Austria, July 9--12, 1996

0 references

A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code

0 references

Large Sample Properties of Simulations Using Latin Hypercube Sampling

0 references

On Latin hypercube sampling

0 references

Design and analysis of computer experiments. With comments and a rejoinder by the authors

0 references

Bayesian Calibration of Computer Models

0 references

0 references

0 references

The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations

0 references

Combining experimental data and computer simulations, with an application to flyer plate experiments

0 references

Modeling uncertainty in flow simulations via generalized polynomial chaos.

0 references

Identification and prediction of stochastic dynamical systems in a polynomial chaos basis

0 references

Uncertainty propagation in CFD using polynomial chaos decomposition

0 references

A generalized polynomial chaos based ensemble Kalman filter with high accuracy

0 references

0 references

Evaluation of failure probability via surrogate models

0 references

POLYNOMIAL-CHAOS-BASED KRIGING

0 references

Comparison of Surrogate-Based Uncertainty Quantification Methods for Computationally Expensive Simulators

0 references

High-Order Collocation Methods for Differential Equations with Random Inputs

0 references

A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data

0 references

A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data

0 references

An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations

0 references

Multi-element probabilistic collocation method in high dimensions

0 references

Sparse pseudospectral approximation method

0 references

A unified framework for mesh refinement in random and physical space

0 references

A non-adapted sparse approximation of PDEs with stochastic inputs

0 references

STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION

0 references

Sparse Legendre expansions via \(\ell_1\)-minimization

0 references

A Compressed Sensing Approach for Partial Differential Equations with Random Input Data

0 references

Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations

0 references

Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies

0 references

On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization

0 references

Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation

0 references

Stochastic Collocation via<i>l</i><sub>1</sub>-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification

0 references

Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions

0 references

Sparse polynomial chaos expansions via compressed sensing and D-optimal design

0 references

Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals

0 references

0 references

Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation

0 references

Active Subspace Methods in Theory and Practice: Applications to Kriging Surfaces

0 references

An adaptive importance sampling algorithm for Bayesian inversion with multimodal distributions

0 references

A probabilistic graphical model based stochastic input model construction

0 references

Multi-Element Generalized Polynomial Chaos for Arbitrary Probability Measures

0 references

Adaptive multi-element polynomial chaos with discrete measure: algorithms and application to SPDEs

0 references

An arbitrary polynomial chaos expansion approach for response analysis of acoustic systems with epistemic uncertainty

0 references

SAMBA: sparse approximation of moment-based arbitrary polynomial chaos

0 references

Orthogonal Polynomials of Several Variables

0 references

The restricted isometry property and its implications for compressed sensing

0 references

Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$

0 references

Stable recovery of sparse overcomplete representations in the presence of noise

0 references

Decoding by Linear Programming

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

Sparse Approximate Solutions to Linear Systems

0 references

Enhancing sparsity of Hermite polynomial expansions by iterative rotations

0 references

Spectral polynomial chaos solutions of the stochastic advection equation

0 references

0 references

Generalized Sobol sensitivity indices for dependent variables: numerical methods

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

10.1016/J.CMA.2019.03.014

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1987969

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1987969&oldid=38817587"