Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark (Q4995117): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 09:52, 13 August 2024

scientific article; zbMATH DE number 7362393

Language	Label	Description	Also known as
English	Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark	scientific article; zbMATH DE number 7362393

Statements

scholarly article

0 references

Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark (English)

0 references

0 references

Stefano Marelli

0 references

0 references

SIAM/ASA Journal on Uncertainty Quantification

0 references

publication date

23 June 2021

0 references

full work available at URL

https://arxiv.org/abs/2002.01290

0 references

zbMATH Keywords

uncertainty quantification

0 references

surrogate modelling

0 references

sparse regression

0 references

sparse polynomial chaos expansions

0 references

experimental design

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

A robust and efficient stepwise regression method for building sparse polynomial chaos expansions

0 references

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

0 references

A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions

0 references

A preconditioning approach for improved estimation of sparse polynomial chaos expansions

0 references

Bayesian Compressive Sensing Using Laplace Priors

0 references

Some greedy algorithms for sparse polynomial chaos expansions

0 references

Stochastic finite element: a non intrusive approach by regression

0 references

Global sensitivity analysis: a Bayesian learning based polynomial chaos approach

0 references

Nonmonotone Spectral Projected Gradient Methods on Convex Sets

0 references

Sparse polynomial chaos expansions and adaptive stochastic finite elements using a regression approach

0 references

Adaptive sparse polynomial chaos expansion based on least angle regression

0 references

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

A Probabilistic and RIPless Theory of Compressed Sensing

0 references

Enhancing sparsity by reweighted \(\ell _{1}\) minimization

0 references

Model selection for small sample regression

0 references

Optimal weighted least-squares methods

0 references

A Comparison of Algorithms for Constructing Exact D-Optimal Designs

0 references

Subspace Pursuit for Compressive Sensing Signal Reconstruction

0 references

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

0 references

Compressed sensing

0 references

A non-adapted sparse approximation of PDEs with stochastic inputs

0 references

Least angle regression. (With discussion)

0 references

On the convergence of generalized polynomial chaos expansions

0 references

Sequential Design of Experiment for Sparse Polynomial Chaos Expansions

0 references

Wavelet-based image estimation: an empirical Bayes approach using Jeffrey's noninformative prior

0 references

0 references

Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization

0 references

Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach

0 references

Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures

0 references

Least squares polynomial chaos expansion: a review of sampling strategies

0 references

On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals

0 references

Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression

0 references

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

0 references

Basis adaptive sample efficient polynomial chaos (BASE-PC)

0 references

The elements of statistical learning. Data mining, inference, and prediction

0 references

Rank-Revealing QR Factorizations and the Singular Value Decomposition

0 references

Adaptive-sparse polynomial chaos expansion for reliability analysis and design of complex engineering systems

0 references

Sequential Design for Ranking Response Surfaces

0 references

Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions

0 references

Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection

0 references

A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions

0 references

Bayesian Compressive Sensing

0 references

Optimum Designs in Regression Problems

0 references

Polynomial meta-models with canonical low-rank approximations: numerical insights and comparison to sparse polynomial chaos expansions

0 references

EXTENDING CLASSICAL SURROGATE MODELING TO HIGH DIMENSIONS THROUGH SUPERVISED DIMENSIONALITY REDUCTION: A DATA-DRIVEN APPROACH

0 references

D-MORPH regression: Application to modeling with unknown parameters more than observation data

0 references

SURROGATE MODELING OF INDOOR DOWN-LINK HUMAN EXPOSURE BASED ON SPARSE POLYNOMIAL CHAOS EXPANSION

0 references

STOCHASTIC SPECTRAL EMBEDDING

0 references

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

0 references

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

0 references

Rectangular maximum-volume submatrices and their applications

0 references

A Christoffel function weighted least squares algorithm for collocation approximations

0 references

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

0 references

A review of some exchange algorithms for constructing discrete \(D\)-optimal designs

0 references

Controlling Correlations in Latin Hypercube Samples

0 references

PLS-based adaptation for efficient PCE representation in high dimensions

0 references

A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions

0 references

Grid and basis adaptive polynomial chaos techniques for sensitivity and uncertainty analysis

0 references

Design of computer experiments: space filling and beyond

0 references

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

0 references

DIMENSIONALITY REDUCTION FOR COMPLEX MODELS VIA BAYESIAN COMPRESSIVE SENSING

0 references

POLYNOMIAL-CHAOS-BASED KRIGING

0 references

Effectively Subsampled Quadratures for Least Squares Polynomial Approximations

0 references

Active Learning

0 references

Bayesian sparse polynomial chaos expansion for global sensitivity analysis

0 references

Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression

0 references

On a near optimal sampling strategy for least squares polynomial regression

0 references

On the distribution of points in a cube and the approximate evaluation of integrals

0 references

Subsampled Gauss Quadrature Nodes for Estimating Polynomial Chaos Expansions

0 references

Regression-based sparse polynomial chaos for uncertainty quantification of subsurface flow models

0 references

Basis adaptation in homogeneous chaos spaces

0 references

10.1162/15324430152748236

0 references

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

0 references

Compressive sensing adaptation for polynomial chaos expansions

0 references

Sparse polynomial chaos expansions using variational relevance vector machines

0 references

Probing the Pareto Frontier for Basis Pursuit Solutions

0 references

Sparse Bayesian Learning for Basis Selection

0 references

High-Order Collocation Methods for Differential Equations with Random Inputs

0 references

The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations

0 references

STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION

0 references

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

0 references

Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification

0 references

Minimization of $\ell_{1-2}$ for Compressed Sensing

0 references

An Efficient Sampling Method for Regression-Based Polynomial Chaos Expansion

0 references

An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion

0 references

Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid

0 references

An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework

0 references

Surrogate modeling of high-dimensional problems via data-driven polynomial chaos expansions and sparse partial least square

0 references

REPLICATION-BASED EMULATION OF THE RESPONSE DISTRIBUTION OF STOCHASTIC SIMULATORS USING GENERALIZED LAMBDA DISTRIBUTIONS

0 references

Identifiers

zbMATH Open document ID

0 references

10.1137/20M1315774

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4995117

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