Pages that link to "Item:Q420755"
From MaRDI portal
The following pages link to Sparse Legendre expansions via \(\ell_1\)-minimization (Q420755):
Displaying 50 items.
- Orthogonal one step greedy procedure for heteroscedastic linear models (Q254223) (← links)
- A sparse grid stochastic collocation method for elliptic interface problems with random input (Q293115) (← links)
- Reconstruction of sparse Legendre and Gegenbauer expansions (Q329024) (← 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)
- The restricted isometry property for time-frequency structured random matrices (Q365713) (← links)
- Restricted isometries for partial random circulant matrices (Q412402) (← links)
- Compressed sensing with preconditioning for sparse recovery with subsampled matrices of Slepian prolate functions (Q467114) (← links)
- Generalized sampling and infinite-dimensional compressed sensing (Q515987) (← links)
- Sparse signal recovery using a new class of random matrices (Q520894) (← links)
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← links)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← 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)
- Interpolation via weighted \(\ell_{1}\) minimization (Q905907) (← 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)
- 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)
- How anisotropic mixed smoothness affects the decay of singular numbers for Sobolev embeddings (Q1996889) (← links)
- Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares (Q2021994) (← links)
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables (Q2031058) (← links)
- A generalized multi-fidelity simulation method using sparse polynomial chaos expansion (Q2033075) (← links)
- Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs (Q2036421) (← links)
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time (Q2038427) (← links)
- Accelerating the Bayesian inference of inverse problems by using data-driven compressive sensing method based on proper orthogonal decomposition (Q2055173) (← links)
- Tight bounds on the mutual coherence of sensing matrices for Wigner d-functions on regular grids (Q2059808) (← links)
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs (Q2099749) (← links)
- Generalization bounds for sparse random feature expansions (Q2105118) (← 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)
- Compressive isogeometric analysis (Q2214468) (← links)
- Adaptive sparse polynomial dimensional decomposition for derivative-based sensitivity (Q2221403) (← links)
- Data assimilation for models with parametric uncertainty (Q2222452) (← links)
- Worst-case recovery guarantees for least squares approximation using random samples (Q2243884) (← links)
- Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements (Q2311914) (← links)
- Sparse reconstruction with multiple Walsh matrices (Q2317908) (← links)
- Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data (Q2359680) (← 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)
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions (Q2425261) (← links)
- Sparse polynomial interpolation in Chebyshev bases (Q2437332) (← links)
- Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials (Q2447624) (← links)
- The stochastic properties of \(\ell^1\)-regularized spherical Gaussian fields (Q2512835) (← links)
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals (Q2670979) (← links)
- A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems (Q2672767) (← links)
