The following pages link to Lutz Kämmerer (Q629897):
Displayed 26 items.
- On the stability of the hyperbolic cross discrete Fourier transform (Q629898) (← links)
- Interpolation lattices for hyperbolic cross trigonometric polynomials (Q657653) (← links)
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials (Q1704862) (← links)
- A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size (Q2070286) (← links)
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables (Q2073139) (← links)
- The uniform sparse FFT with application to PDEs with random coefficients (Q2098298) (← links)
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions (Q2118948) (← links)
- A sparse FFT approach for ODE with random coefficients (Q2216613) (← links)
- Worst-case recovery guarantees for least squares approximation using random samples (Q2243884) (← links)
- Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices (Q2325022) (← links)
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform (Q2330933) (← links)
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form (Q2347961) (← links)
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling (Q2349094) (← links)
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness (Q2407468) (← links)
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
- Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices (Q2870627) (← links)
- Reconstructing Multivariate Trigonometric Polynomials by Sampling Along Generated Sets (Q2926230) (← links)
- Reconstructing Multivariate Trigonometric Polynomials from Samples Along Rank-1 Lattices (Q2950610) (← links)
- (Q4233339) (← links)
- (Q4494417) (← links)
- Computational Methods for the Fourier Analysis of Sparse High-Dimensional Functions (Q5256568) (← links)
- Nonlinear approximation in bounded orthonormal product bases (Q6049829) (← links)
- On the reconstruction of functions from values at subsampled quadrature points (Q6140848) (← links)
- Multiple Lattice Rules for Multivariate $L_\infty$ Approximation in the Worst-Case Setting (Q6324724) (← links)
- A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications (Q6357076) (← links)
- The uniform sparse FFT with application to PDEs with random coefficients (Q6377211) (← links)