Random Sampling of Sparse Trigonometric Polynomials

Holger Rauhut

Type: Preprint

Publication Date: 2005-01-01

Citations: 1

DOI: https://doi.org/10.48550/arxiv.math/0512642

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Random sampling of sparse trigonometric polynomials	2006	Holger Rauhut
+	Random Sampling of Sparse Trigonometric Polynomials II - Orthogonal Matching Pursuit versus Basis Pursuit	2006	Stefan Kunis Holger Rauhut
+	Deterministic Sampling of Sparse Trigonometric Polynomials	2010	Zhiqiang Xu
+	Random Sampling of Sparse Trigonometric Polynomials II - Orthogonal Matching Pursuit versus Basis Pursuit	2006	Holger Rauhut Stefan Kunis
+	Deterministic sampling of sparse trigonometric polynomials	2011	Zhiqiang Xu
+ PDF Chat	Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit	2007	Stefan Kunis Holger Rauhut
+	Stability results for random sampling of sparse trigonometric polynomials	2006	Holger Rauhut
+ PDF Chat	Stability Results for Random Sampling of Sparse Trigonometric Polynomials	2008	Holger Rauhut
+	Compressed sensing approaches for polynomial approximation of high-dimensional functions	2017	Ben Adcock Simone Brugiapaglia Clayton Webster
+ PDF Chat	Compressed Sensing Approaches for Polynomial Approximation of High-Dimensional Functions	2017	Ben Adcock Simone Brugiapaglia Clayton Webster
+	Weighted random sampling and reconstruction in general multivariate trigonometric polynomial spaces	2021	Wei Li Jun Xian
+	Random Sampling of Multivariate Trigonometric Polynomials	2004	Richard F. Bass Karlheinz Gröchenig
+	Efficient recovery of non-periodic multivariate functions from few scattered samples	2023	Felix Bartel Kai Lüttgen Nicolas Nagel Tino Ullrich
+	Polynomial approximation via compressed sensing of high-dimensional functions on lower sets	2017	Abdellah Chkifa Nick Dexter Hoang Tran Clayton Webster
+	Towards Optimal Sampling for Learning Sparse Approximations in High Dimensions	2022	Ben Adcock Juan M. Cardenas Nick Dexter Sebastián Moraga
+	Towards optimal sampling for learning sparse approximation in high dimensions	2022	Ben Adcock Juan M. Cardenas Nick Dexter Sebastián Moraga
+ PDF Chat	Efficient recovery of non-periodic multivariate functions from few scattered samples	2023	Felix Bartel Kai Lüttgen Nicolas Nagel Tino Ullrich
+ PDF Chat	Nonlinear Approximation with Subsampled Rank-1 Lattices	2023	Felix Bartel Fabian Taubert
+ PDF Chat	Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies	2014	Jerrad Hampton Alireza Doostan
+	Flavors of Compressive Sensing	2017	Simon Foucart

Works That Cite This (1)

Action	Title	Year	Authors
+	Investigations of the effects of random sampling patterns on the stability of generalized sampling	2016	Robert Dahl Jacobsen Jesper Møller Morten Nielsen Morten Grud Rasmussen

Works Cited by This (8)

Action	Title	Year	Authors
+	Random Sampling of Multivariate Trigonometric Polynomials	2004	Richard F. Bass Karlheinz Gröchenig
+	For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution	2006	David L. Donoho
+ PDF Chat	A sharp concentration inequality with applications	2000	Stéphane Boucheron G�bor Lugosi Pascal Massart
+ PDF Chat	Theoretical and experimental analysis of a randomized algorithm for Sparse Fourier transform analysis	2005	Jing Zou Anna C. Gilbert Martin J. Strauss Ingrid Daubechies
+	Convex Optimization	2004	Stephen Boyd Lieven Vandenberghe
+	Enumerative Combinatorics	1997	Richard P. Stanley Gian‐Carlo Rota
+	Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?	2004	Emmanuel J. Candès Terence Tao
+	Robust Uncertainty Principles: Exact Signal Reconstruction from Highly Incomplete Frequency Information	2004	Emmanuel J. Candès Justin Romberg Terence Tao