Pages that link to "Item:Q5412285"
From MaRDI portal
The following pages link to STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION (Q5412285):
Displayed 50 items.
- A sparse grid stochastic collocation method for elliptic interface problems with random input (Q293115) (← links)
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations (Q347862) (← links)
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions (Q349012) (← links)
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies (Q349724) (← links)
- Multiscale model reduction method for Bayesian inverse problems of subsurface flow (Q515766) (← links)
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection (Q729190) (← links)
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations (Q729367) (← links)
- Spectral likelihood expansions for Bayesian inference (Q729504) (← links)
- Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs (Q778295) (← links)
- Gaussian process regression and conditional polynomial chaos for parameter estimation (Q781985) (← links)
- Infinite-dimensional compressed sensing and function interpolation (Q1656376) (← 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)
- 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 adaptive forward-backward selection method for sparse polynomial chaos expansion (Q1988232) (← links)
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs (Q2036421) (← links)
- Structure exploiting methods for fast uncertainty quantification in multiphase flow through heterogeneous media (Q2065846) (← 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)
- nPINNs: nonlocal physics-informed neural networks for a parametrized nonlocal universal Laplacian operator. Algorithms and applications (Q2123792) (← links)
- Optimal design for kernel interpolation: applications to uncertainty quantification (Q2124880) (← links)
- Polynomial chaos expansions for dependent random variables (Q2173605) (← links)
- Adaptive weighted least-squares polynomial chaos expansion with basis adaptivity and sequential adaptive sampling (Q2175295) (← links)
- Data assimilation for models with parametric uncertainty (Q2222452) (← links)
- Regression-based sparse polynomial chaos for uncertainty quantification of subsurface flow models (Q2222601) (← links)
- Probabilistic modeling and global sensitivity analysis for CO\(_2\) storage in geological formations: a spectral approach (Q2294969) (← links)
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions (Q2309799) (← 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)
- Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs (Q2375274) (← links)
- A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions (Q2424501) (← links)
- Correcting for unknown errors in sparse high-dimensional function approximation (Q2424851) (← links)
- Basis adaptive sample efficient polynomial chaos (BASE-PC) (Q2425254) (← links)
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions (Q2425261) (← links)
- Nonadaptive Quasi-Optimal Points Selection for Least Squares Linear Regression (Q2790089) (← links)
- Sparse Approximation using $\ell_1-\ell_2$ Minimization and Its Application to Stochastic Collocation (Q2964447) (← links)
- Stochastic Collocation Methods via $\ell_1$ Minimization Using Randomized Quadratures (Q2968585) (← links)
- Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation (Q3459658) (← 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)
- Sequential Design of Experiment for Sparse Polynomial Chaos Expansions (Q4636350) (← links)
- Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark (Q4995117) (← links)
- A General Framework of Rotational Sparse Approximation in Uncertainty Quantification (Q5052909) (← links)
- APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS (Q5112008) (← links)