| Publication | Date of Publication | Type |
|---|
On the reconstruction of functions from values at subsampled quadrature points
Mathematics of Computation | 2024-01-02 | Paper |
Nonlinear approximation in bounded orthonormal product bases
Sampling Theory, Signal Processing, and Data Analysis | 2023-09-18 | Paper |
The uniform sparse FFT with application to PDEs with random coefficients
Sampling Theory, Signal Processing, and Data Analysis | 2022-11-17 | Paper |
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
Numerical Algorithms | 2022-03-23 | Paper |
Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
Sampling Theory, Signal Processing, and Data Analysis | 2022-01-27 | Paper |
A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size
Advances in Computational Mathematics | 2022-01-24 | Paper |
Worst-case recovery guarantees for least squares approximation using random samples
Constructive Approximation | 2021-11-11 | Paper |
The uniform sparse FFT with application to PDEs with random coefficients
(available as arXiv preprint) | 2021-09-09 | Paper |
High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
Applied and Computational Harmonic Analysis | 2021-03-26 | Paper |
| A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications | 2020-12-28 | Paper |
A sparse FFT approach for ODE with random coefficients
Advances in Computational Mathematics | 2020-12-16 | Paper |
Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform
Applied and Computational Harmonic Analysis | 2019-10-23 | Paper |
Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
Journal of Approximation Theory | 2019-09-12 | Paper |
| Multiple Lattice Rules for Multivariate $L_\infty$ Approximation in the Worst-Case Setting | 2019-09-05 | Paper |
Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
The Journal of Fourier Analysis and Applications | 2018-03-13 | Paper |
Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
Numerische Mathematik | 2017-09-29 | Paper |
Reconstructing multivariate trigonometric polynomials from samples along rank-1 lattices
Springer Proceedings in Mathematics & Statistics | 2015-10-09 | Paper |
Computational methods for the Fourier analysis of sparse high-dimensional functions
Extraction of Quantifiable Information from Complex Systems | 2015-06-18 | Paper |
Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
Journal of Complexity | 2015-06-16 | Paper |
Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
Journal of Complexity | 2015-06-10 | Paper |
Reconstructing multivariate trigonometric polynomials by sampling along generated sets
Springer Proceedings in Mathematics & Statistics | 2014-10-31 | Paper |
Reconstructing hyperbolic cross trigonometric polynomials by sampling along rank-1 lattices
SIAM Journal on Numerical Analysis | 2014-01-21 | Paper |
Interpolation lattices for hyperbolic cross trigonometric polynomials
Journal of Complexity | 2012-01-10 | Paper |
On the stability of the hyperbolic cross discrete Fourier transform
Numerische Mathematik | 2011-03-10 | Paper |
| scientific article; zbMATH DE number 1487887 (Why is no real title available?) | 2001-08-05 | Paper |
| scientific article; zbMATH DE number 1264407 (Why is no real title available?) | 1999-03-16 | Paper |
