On the stability of the hyperbolic cross discrete Fourier transform. - Lutz Kämmerer; Stefan Kunis (Numerische Mathematik, 2011)

Interpolation lattices for hyperbolic cross trigonometric polynomials. - Lutz Kämmerer; Stefan Kunis; Daniel Potts (J. Complex., 2012)

Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices. - Lutz Kämmerer (SIAM J. Numer. Anal., 2013)

Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form. - Lutz Kämmerer; Daniel Potts; Toni Volkmer (J. Complex., 2015)

Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling. - Lutz Kämmerer; Daniel Potts; Toni Volkmer (J. Complex., 2015)

Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness. - Glenn Byrenheid; Lutz Kämmerer; Tino Ullrich; Toni Volkmer (Numerische Mathematik, 2017)

Multiple Lattice Rules for Multivariate L∞ Approximation in the Worst-Case Setting. - Lutz Kämmerer (CoRR, 2019)

Worst case recovery guarantees for least squares approximation using random samples. - Lutz Kämmerer; Tino Ullrich; Toni Volkmer (CoRR, 2019)

Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices. - Lutz Kämmerer; Toni Volkmer (J. Approx. Theory, 2019)

A sparse FFT approach for ODE with random coefficients. - Maximilian Bochmann; Lutz Kämmerer; Daniel Potts (Adv. Comput. Math., 2020)

Sparse Fourier Transforms on Rank-1 Lattices for the Rapid and Low-Memory Approximation of Functions of Many Variables. - Craig Gross; Mark A. Iwen; Lutz Kämmerer; Toni Volkmer (CoRR, 2020)

A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications. - Lutz Kämmerer (CoRR, 2020)

A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size. - Craig Gross; Mark A. Iwen; Lutz Kämmerer; Toni Volkmer (Adv. Comput. Math., 2021)

The uniform sparse FFT with application to PDEs with random coefficients. - Lutz Kämmerer; Daniel Potts; Fabian Taubert (CoRR, 2021)

Nonlinear approximation in bounded orthonormal product bases. - Lutz Kämmerer; Daniel Potts; Fabian Taubert (CoRR, 2022)

A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions. - Lutz Kämmerer; Felix Krahmer; Toni Volkmer (Numer. Algorithms, 2022)

On the reconstruction of functions from values at subsampled quadrature points. - Felix Bartel; Lutz Kämmerer; Daniel Potts; Tino Ullrich (Math. Comput., 2023)

Constructing efficient spatial discretizations of spans of multivariate Chebyshev polynomials. - Lutz Kämmerer (CoRR, 2024)

Exact discretization, tight frames and recovery via D-optimal designs. - Felix Bartel; Lutz Kämmerer; Kateryna Pozharska; Martin Schäfer; Tino Ullrich (CoRR, 2024)