The following pages link to Toni Volkmer (Q326762):
Displaying 13 items.
- Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time (Q2038427) (← 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)
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions (Q2118948) (← 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)
- 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)
- Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products (Q4959467) (← links)
- Computational Methods for the Fourier Analysis of Sparse High-Dimensional Functions (Q5256568) (← links)
