Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
From MaRDI portal
Publication:2359680
DOI10.1007/s00365-017-9369-3zbMath1367.41012arXiv1503.02352OpenAlexW2962933605MaRDI QIDQ2359680
Publication date: 22 June 2017
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.02352
Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)
Related Items (16)
On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ Robust recovery of a kind of weighted l1-minimization without noise level ⋮ A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ Basis adaptive sample efficient polynomial chaos (BASE-PC) ⋮ Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ Sparse polynomial chaos expansions via compressed sensing and D-optimal design ⋮ A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials ⋮ Generalized sampling and infinite-dimensional compressed sensing ⋮ Sparse identification of nonlinear dynamical systems via reweighted \(\ell_1\)-regularized least squares ⋮ Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables ⋮ Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time ⋮ A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs ⋮ Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements
Cites Work
- Unnamed Item
- Unnamed Item
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- A mathematical introduction to compressive sensing
- On the stability and accuracy of least squares approximations
- On the numerical stability of Fourier extensions
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Minimum Sobolev norm interpolation with trigonometric polynomials on the torus
- Generalized sampling and infinite-dimensional compressed sensing
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- A generalized sampling theorem for stable reconstructions in arbitrary bases
- A minimum Sobolev norm technique for the numerical discretization of PDEs
- Interpolation via weighted \(\ell_{1}\) minimization
- Infinite-dimensional compressed sensing and function interpolation
- Stable extrapolation of analytic functions
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- Beyond Consistent Reconstructions: Optimality and Sharp Bounds for Generalized Sampling, and Application to the Uniform Resampling Problem
- ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- Spectral Methods for Uncertainty Quantification
- A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
- Spectral Methods
- A Mapped Polynomial Method for High-Accuracy Approximations on Arbitrary Grids
- Optimal sampling rates for approximating analytic functions from pointwise samples
- Scattered Data Approximation
This page was built for publication: Infinite-dimensional \(\ell ^1\) minimization and function approximation from pointwise data
