795 citations · 1.4k across the 64 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.IT2021
Iterative and greedy algorithms for the sparsity in levels model in compressed sensing
Ben Adcock, Simone Brugiapaglia, Matthew King-Roskamp
Motivated by the question of optimal functional approximation via compressed sensing, we propose generalizations of the Iterative Hard Thresholding and the Compressive Sampling Mat…
math.NA2021
Fast and stable approximation of analytic functions from equispaced samples via polynomial frames
Ben Adcock, Alexei Shadrin
We consider approximating analytic functions on the interval from their values at a set of equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that f…