Showing math.NAShow all
2 papers · 1 filter
math.NA2020
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
Lutz Kämmerer, Felix Krahmer, Toni Volkmer
In this paper a sublinear time algorithm is presented for the reconstruction of functions that can be represented by just few out of a potentially large candidate set of Fourier ba…
math.NA2020
A Deterministic Algorithm for Constructing Multiple Rank-1 Lattices of Near-Optimal Size
Craig Gross, Mark A. Iwen, Lutz Kämmerer +1
In this paper we present the first known deterministic algorithm for the construction of multiple rank-1 lattices for the approximation of periodic functions of many variables. The…