Pages that link to "Item:Q2425261"
From MaRDI portal
The following pages link to A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions (Q2425261):
Displaying 11 items.
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit (Q1029548) (← links)
- Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem (Q1986778) (← links)
- A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget (Q2072434) (← links)
- Regression-based sparse polynomial chaos for uncertainty quantification of subsurface flow models (Q2222601) (← links)
- A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design (Q2246331) (← links)
- Comparison of the performance and reliability between improved sampling strategies for polynomial chaos expansion (Q2688361) (← links)
- Sparse Recovery via <i>ℓ<sub>q</sub></i>-Minimization for Polynomial Chaos Expansions (Q3176044) (← links)
- (Q4250165) (← links)
- Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification (Q4611526) (← links)
- Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark (Q4995117) (← links)
- Sparse Approximation of Data-Driven Polynomial Chaos Expansions: An Induced Sampling Approach (Q5142965) (← links)
