Pages that link to "Item:Q349724"

The following pages link to Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies (Q349724):

Displaying 36 items.

• A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions (Q2425261) (← links)
• Projection pursuit adaptation on polynomial chaos expansions (Q2683425) (← links)
• Comparison of the performance and reliability between improved sampling strategies for polynomial chaos expansion (Q2688361) (← links)
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations (Q2953202) (← links)
• Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures (Q2968585) (← links)
• Compressive Sensing with Cross-Validation and Stop-Sampling for Sparse Polynomial Chaos Expansions (Q3176252) (← links)
• Compressive Sensing with Redundant Dictionaries and Structured Measurements (Q3455237) (← links)
• Weighted Approximate Fekete Points: Sampling for Least-Squares Polynomial Approximation (Q4603503) (← links)
• Polynomial approximation via compressed sensing of high-dimensional functions on lower sets (Q4605704) (← links)
• Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations (Q4611522) (← links)
• Sliced-Inverse-Regression--Aided Rotated Compressive Sensing Method for Uncertainty Quantification (Q4611526) (← links)
• Multivariate Approximation in Downward Closed Polynomial Spaces (Q4611802) (← links)
• Sequential Design of Experiment for Sparse Polynomial Chaos Expansions (Q4636350) (← links)
• Reduced Basis Methods for Uncertainty Quantification (Q4636408) (← links)
• Effectively Subsampled Quadratures for Least Squares Polynomial Approximations (Q4636415) (← links)
• Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark (Q4995117) (← links)
• Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains (Q5037568) (← links)
• A General Framework of Rotational Sparse Approximation in Uncertainty Quantification (Q5052909) (← links)
• Constructing Least-Squares Polynomial Approximations (Q5113170) (← links)
• A Reduced-Basis Polynomial-Chaos Approach with a Multi-parametric Truncation Scheme for Problems with Uncertainties (Q5153575) (← links)
• A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials (Q5160076) (← links)
• A mixed <i>ℓ</i>₁ regularization approach for sparse simultaneous approximation of parameterized PDEs (Q5216108) (← links)
• A Randomized Algorithm for Multivariate Function Approximation (Q5268988) (← links)
• Efficient Bayesian Experimentation Using an Expected Information Gain Lower Bound (Q5269853) (← links)
• A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions (Q5275042) (← links)
• Importance sampling in signal processing applications (Q5358731) (← links)
• Stochastic Collocation via<i>l</i>₁-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification (Q5372043) (← links)
• Data-Driven Polynomial Ridge Approximation Using Variable Projection (Q5745137) (← links)
• A novel sparse polynomial chaos expansion technique with high adaptiveness for surrogate modelling (Q6072781) (← links)
• Analysis of sparse recovery for Legendre expansions using envelope bound (Q6090395) (← links)
• A massively parallel implementation of multilevel Monte Carlo for finite element models (Q6094001) (← links)
• Sensitivity-enhanced generalized polynomial chaos for efficient uncertainty quantification (Q6095126) (← links)
• An active sparse polynomial chaos expansion approach based on sequential relevance vector machine (Q6120140) (← links)
• Classifier-based adaptive polynomial chaos expansion for high-dimensional uncertainty quantification (Q6125488) (← links)
• Bi-fidelity variational auto-encoder for uncertainty quantification (Q6202982) (← links)
• Physics-informed polynomial chaos expansions (Q6498467) (← links)