Compressed Sensing Approaches for Polynomial Approximation of High-Dimensional Functions

Ben Adcock, Simone Brugiapaglia, Clayton Webster

Type: Book-Chapter

Publication Date: 2017-01-01

Citations: 93

DOI: https://doi.org/10.1007/978-3-319-69802-1_3

View Publication

Download PDF

Locations

Applied and numerical harmonic analysis - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Compressed sensing approaches for polynomial approximation of high-dimensional functions	2017	Ben Adcock Simone Brugiapaglia Clayton Webster
+	Polynomial approximation of high-dimensional functions via compressed sensing	2017	Ben Adcock Simone Brugiapaglia Clayton Webster
+	Polynomial approximation via compressed sensing of high-dimensional functions on lower sets	2017	Abdellah Chkifa Nick Dexter Hoang Tran Clayton Webster
+	Sparse Polynomial Approximation of High-Dimensional Functions	2022	Ben Adcock Simone Brugiapaglia Clayton Webster
+	On efficient algorithms for computing near-best polynomial approximations to high-dimensional, Hilbert-valued functions from limited samples	2022	Ben Adcock Simone Brugiapaglia Nick Dexter Sebastián Moraga
+	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
+	Infinite-dimensional compressed sensing and function interpolation	2015	Ben Adcock
+ PDF Chat	APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS	2020	Ben Adcock Daan Huybrechs
+	Sparse Approximation and Optimization in High-Dimensions	2009
+	Sparse Harmonic Transforms: A New Class of Sublinear-time Algorithms for Learning Functions of Many Variables	2018	Bosu Choi Mark Iwen Felix Krahmer
+	Chapter 5: Sparse polynomial approximation via least squares	2022
+	Sparse Harmonic Transforms: A New Class of Sublinear-time Algorithms for Learning Functions of Many Variables	2018	Bosu Choi Mark Iwen Felix Krahmer
+	A sample based method for sparse low-rank approximation of high dimensional functions	2013	Mathilde Chevreuil Prashant Rai Anthony Nouy Loïc Giraldi
+	Monte Carlo is a good sampling strategy for polynomial approximation in high dimensions	2022	Ben Adcock Simone Brugiapaglia
+	Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements	2017	Ben Adcock Yi Sui
+	Sparsest representation and approximation of a high-dimensional linear system	2017	Patrick Tardivel
+ PDF Chat	Compressive Hermite Interpolation: Sparse, High-Dimensional Approximation from Gradient-Augmented Measurements	2019	Ben Adcock Yi Sui
+	Interpolation via weighted $l_1$ minimization	2013	Holger Rauhut Rachel Ward
+	Interpolation via weighted $l_1$ minimization	2013	Holger Rauhut Rachel Ward

Works That Cite This (51)

Action	Title	Year	Authors
+ PDF Chat	Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs	2021	Simone Brugiapaglia Sjoerd Dirksen Hans Christian Jung Holger Rauhut
+	Near-optimal sampling strategies for multivariate function approximation on general domains	2019	Ben Adcock Juan M. Cardenas
+ PDF Chat	Compressive Hermite Interpolation: Sparse, High-Dimensional Approximation from Gradient-Augmented Measurements	2019	Ben Adcock Yi Sui
+	Towards Optimal Sampling for Learning Sparse Approximations in High Dimensions	2022	Ben Adcock Juan M. Cardenas Nick Dexter Sebastián Moraga
+ PDF Chat	A Compressive Spectral Collocation Method for the Diffusion Equation Under the Restricted Isometry Property	2020	Simone Brugiapaglia
+ PDF Chat	Wavelet–Fourier CORSING techniques for multidimensional advection–diffusion–reaction equations	2020	Simone Brugiapaglia Stefano Micheletti Fabio Nobile Simona Perotto
+ PDF Chat	Construction and application of provable positive and exact cubature formulas	2022	Jan Glaubitz
+	Total Variation Minimization	2021	Ben Adcock Anders C. Hansen
+	Fourier Transforms and Series	2021	Ben Adcock Anders C. Hansen
+	Local Structure and Nonuniform Recovery	2021	Ben Adcock Anders C. Hansen

Works Cited by This (48)

Action	Title	Year	Authors
+	New explicit-in-dimension estimates for the cardinality of high-dimensional hyperbolic crosses and approximation of functions having mixed smoothness	2015	Alexey Chernov Ðinh Dũng
+ PDF Chat	Approximation of Mixed Order Sobolev Functions on the d-Torus: Asymptotics, Preasymptotics, and d-Dependence	2015	Thomas Kühn Winfried Sickel Tino Ullrich
+ PDF Chat	Discrete Least-Squares Approximations over Optimized Downward Closed Polynomial Spaces in Arbitrary Dimension	2017	Albert Cohen Giovanni Migliorati Fabio Nobile
+	A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems	2016	Simone Brugiapaglia Fabio Nobile Stefano Micheletti Simona Perotto
+ PDF Chat	On the Stability and Accuracy of Least Squares Approximations	2013	Albert Cohen Mark A. Davenport D. Leviatan
+	Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets	2015	Giovanni Migliorati Fabio Nobile
+	Random sampling of sparse trigonometric polynomials	2006	Holger Rauhut
+	A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data	2008	Fabio Nobile Raúl Tempone Clayton Webster
+	Stability and robustness of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mrow><mml:msub><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math>-minimizations with Weibull matrices and redundant dictionaries	2012	Simon Foucart
+	Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets	2014	Giovanni Migliorati