Pages that link to "Item:Q349724"
From MaRDI portal
The following pages link to Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies (Q349724):
Displaying 50 items.
- Train flow chaos analysis based on an improved cellular automata model (Q508484) (← links)
- An adaptive WENO collocation method for differential equations with random coefficients (Q515442) (← links)
- A robust and efficient stepwise regression method for building sparse polynomial chaos expansions (Q680129) (← links)
- Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction (Q725460) (← links)
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations (Q729367) (← links)
- Sparse polynomial chaos expansions using variational relevance vector machines (Q781971) (← links)
- Gaussian process regression and conditional polynomial chaos for parameter estimation (Q781985) (← links)
- An efficient non-intrusive reduced basis model for high dimensional stochastic problems in CFD (Q1647089) (← links)
- Efficient uncertainty quantification of stochastic CFD problems using sparse polynomial chaos and compressed sensing (Q1648406) (← links)
- Infinite-dimensional compressed sensing and function interpolation (Q1656376) (← links)
- Orbit uncertainty propagation and sensitivity analysis with separated representations (Q1682185) (← links)
- A low-rank control variate for multilevel Monte Carlo simulation of high-dimensional uncertain systems (Q1686578) (← links)
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression (Q1734451) (← links)
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design (Q1985532) (← links)
- Projection methods for stochastic dynamic systems: a frequency domain approach (Q1986213) (← links)
- A preconditioning approach for improved estimation of sparse polynomial chaos expansions (Q1986404) (← links)
- Sparsity-promoting elastic net method with rotations for high-dimensional nonlinear inverse problem (Q1986778) (← links)
- A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness (Q1987969) (← links)
- An efficient and robust adaptive sampling method for polynomial chaos expansion in sparse Bayesian learning framework (Q1988073) (← links)
- M-PCM-OFFD: an effective output statistics estimation method for systems of high dimensional uncertainties subject to low-order parameter interactions (Q1997513) (← links)
- Optimal Bayesian experimental design for subsurface flow problems (Q2020243) (← links)
- Efficient reliability analysis with a CDA-based dimension-reduction model and polynomial chaos expansion (Q2020745) (← links)
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares (Q2021994) (← links)
- Tight bounds on the mutual coherence of sensing matrices for Wigner d-functions on regular grids (Q2059808) (← links)
- Adaboost-based ensemble of polynomial chaos expansion with adaptive sampling (Q2060149) (← links)
- A multi-fidelity polynomial chaos-greedy Kaczmarz approach for resource-efficient uncertainty quantification on limited budget (Q2072434) (← links)
- Bi-fidelity reduced polynomial chaos expansion for uncertainty quantification (Q2115584) (← links)
- Analysis of geometric uncertainties in CFD problems solved by RBF-FD meshless method (Q2123743) (← links)
- A stochastic Galerkin method with adaptive time-stepping for the Navier-Stokes equations (Q2168285) (← links)
- Polynomial chaos expansions for dependent random variables (Q2173605) (← links)
- Multi-level multi-fidelity sparse polynomial chaos expansion based on Gaussian process regression (Q2174145) (← links)
- Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling (Q2175295) (← links)
- PLS-based adaptation for efficient PCE representation in high dimensions (Q2220565) (← links)
- Some greedy algorithms for sparse polynomial chaos expansions (Q2220572) (← links)
- Adaptive sparse polynomial dimensional decomposition for derivative-based sensitivity (Q2221403) (← links)
- Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence (Q2222797) (← links)
- Intrusive generalized polynomial chaos with asynchronous time integration for the solution of the unsteady Navier-Stokes equations (Q2245366) (← links)
- Variance-based adaptive sequential sampling for polynomial chaos expansion (Q2246308) (← links)
- A hybrid sequential sampling strategy for sparse polynomial chaos expansion based on compressive sampling and Bayesian experimental design (Q2246331) (← links)
- Probabilistic modeling and global sensitivity analysis for CO\(_2\) storage in geological formations: a spectral approach (Q2294969) (← links)
- A rapid and efficient isogeometric design space exploration framework with application to structural mechanics (Q2309010) (← links)
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions (Q2309799) (← links)
- Least squares polynomial chaos expansion: a review of sampling strategies (Q2310855) (← links)
- An efficient multifidelity \(\ell_1\)-minimization method for sparse polynomial chaos (Q2310912) (← links)
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements (Q2311914) (← links)
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data (Q2359680) (← links)
- Weighted discrete least-squares polynomial approximation using randomized quadratures (Q2374682) (← links)
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization (Q2375016) (← links)
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions (Q2424501) (← links)
- Basis adaptive sample efficient polynomial chaos (BASE-PC) (Q2425254) (← links)
