A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size
DOI10.1007/s10444-021-09916-0zbMath1481.65275arXiv2003.09753OpenAlexW3012816449MaRDI QIDQ2070286
Toni Volkmer, Lutz Kämmerer, Craig Gross, Mark A. Iwen
Publication date: 24 January 2022
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.09753
fast Fourier transformtrigonometric polynomialslattice rulesampling numbersmultiple rank-1 latticeapproximation of multivariate periodic functions
Analysis of algorithms and problem complexity (68Q25) Function spaces arising in harmonic analysis (42B35) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40) Fourier series and coefficients in several variables (42B05)
Cites Work
- A mathematical introduction to compressive sensing
- Combinatorial sublinear-time Fourier algorithms
- Reconstruction of periodic functions of several variables with respect to the values in the nodes of number-theoretic nets
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
- Numerical Fourier analysis
- Improved approximation guarantees for sublinear-time Fourier algorithms
- A deterministic sparse FFT for functions with structured Fourier sparsity
- Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Explicit universal sampling sets in finite vector spaces
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees
- Approximate formulas for some functions of prime numbers
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Reconstructing Multivariate Trigonometric Polynomials from Samples Along Rank-1 Lattices
- Compressed sensing and best 𝑘-term approximation
- Function integration, reconstruction and approximation using rank-$1$ lattices
This page was built for publication: A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size
