A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
From MaRDI portal
Publication:2425261
DOI10.1016/j.jcp.2018.05.025zbMath1415.94368arXiv1702.07830OpenAlexW2594836702WikidataQ129803080 ScholiaQ129803080MaRDI QIDQ2425261
Hadi Meidani, Negin Alemazkoor
Publication date: 26 June 2019
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.07830
Legendre polynomialssampling strategycompressive samplingdesign of experimentpolynomial chaos expansionssurrogate-based prediction
Probabilistic models, generic numerical methods in probability and statistics (65C20) Sampling theory in information and communication theory (94A20)
Related Items (8)
Comparison of the performance and reliability between improved sampling strategies for polynomial chaos expansion ⋮ Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification ⋮ Regression-based sparse polynomial chaos for uncertainty quantification of subsurface flow models ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem ⋮ A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design ⋮ A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget ⋮ Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Stability of multiobjective predictive control: A utopia-tracking approach
- Sparse Legendre expansions via \(\ell_1\)-minimization
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
- Sparse representation, modeling and learning in visual recognition. Theory, algorithms and applications
- The restricted isometry property and its implications for compressed sensing
- On compressive sensing applied to radar
- An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Sparse grid collocation schemes for stochastic natural convection problems
- Atomic Decomposition by Basis Pursuit
- Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression
- Subsampled Gauss Quadrature Nodes for Estimating Polynomial Chaos Expansions
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Stable recovery of sparse overcomplete representations in the presence of noise
- Sparse and Redundant Representations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- Optimized Projections for Compressed Sensing
- Sensing Matrix Optimization for Block-Sparse Decoding
- On Projection Matrix Optimization for Compressive Sensing Systems
- A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
- Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
- Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- High-Order Collocation Methods for Differential Equations with Random Inputs
- Compressed sensing
- Solution of stochastic partial differential equations using Galerkin finite element techniques
This page was built for publication: A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
