Toni Volkmer

Publication Activity (10 Years)

Years Active: 2009-2022
Publications (10 Years): 17

Top Topics

Approximation Guarantees

High Dimensions

Top Venues

Numerische Mathematik

Frontiers Appl. Math. Stat.

Publications

Lutz Kämmerer, Felix Krahmer, Toni Volkmer
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions. Numer. Algorithms 89 (4) (2022)
Kai Bergermann, Martin Stoll, Toni Volkmer
Semi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix-Vector Products. SIAM J. Math. Data Sci. 3 (2) (2021)
Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer
A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size. Adv. Comput. Math. 47 (6) (2021)
Bosu Choi, Mark A. Iwen, Toni Volkmer
Sparse harmonic transforms II: best s-term approximation guarantees for bounded orthonormal product bases in sublinear-time. Numerische Mathematik 148 (2) (2021)
Lutz Kämmerer, Felix Krahmer, Toni Volkmer
A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions. CoRR (2020)
Kai Bergermann, Martin Stoll, Toni Volkmer
Semi-supervised Learning for Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix Vector Products. CoRR (2020)
Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer
Sparse Fourier Transforms on Rank-1 Lattices for the Rapid and Low-Memory Approximation of Functions of Many Variables. CoRR (2020)
Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer
A Deterministic Algorithm for Constructing Multiple Rank-1 Lattices of Near-Optimal Size. CoRR (2020)
Lutz Kämmerer, Toni Volkmer
Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices. J. Approx. Theory 246 (2019)
Bosu Choi, Mark A. Iwen, Toni Volkmer
Sparse Harmonic Transforms II: Best s-Term Approximation Guarantees for Bounded Orthonormal Product Bases in Sublinear-Time. CoRR (2019)
Lutz Kämmerer, Tino Ullrich, Toni Volkmer
Worst case recovery guarantees for least squares approximation using random samples. CoRR (2019)
Dominik Alfke, Daniel Potts, Martin Stoll, Toni Volkmer
NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks. CoRR (2018)
Dominik Alfke, Daniel Potts, Martin Stoll, Toni Volkmer
NFFT Meets Krylov Methods: Fast Matrix-Vector Products for the Graph Laplacian of Fully Connected Networks. Frontiers Appl. Math. Stat. 4 (2018)
Glenn Byrenheid, Lutz Kämmerer, Tino Ullrich, Toni Volkmer
Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness. Numerische Mathematik 136 (4) (2017)
Daniel Potts, Manfred Tasche, Toni Volkmer
Efficient Spectral Estimation by MUSIC and ESPRIT with Application to Sparse FFT. Frontiers Appl. Math. Stat. 2 (2016)
Lutz Kämmerer, Daniel Potts, Toni Volkmer
Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling. J. Complex. 31 (4) (2015)
Lutz Kämmerer, Daniel Potts, Toni Volkmer
Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form. J. Complex. 31 (3) (2015)
Jochen Strunk, Andreas Heinig, Toni Volkmer, Wolfgang Rehm, Heiko Schick
ACCFS - Virtual File System Support for Host Coupled Run-Time Reconfigurable FPGAs. PARCO (2009)
Jochen Strunk, Toni Volkmer, Wolfgang Rehm, Heiko Schick
Design and Performance of a Grid of Asynchronously Clocked Run-Time Reconfigurable Modules on a FPGA. ReConFig (2009)
Jochen Strunk, Toni Volkmer, Klaus Stephan, Wolfgang Rehm, Heiko Schick
Impact of run-time reconfiguration on design and speed - A case study based on a grid of run-time reconfigurable modules inside a FPGA. IPDPS (2009)
Jochen Strunk, Toni Volkmer, Wolfgang Rehm, Heiko Schick
An on Chip Network inside a FPGA for Run-Time Reconfigurable Low Latency Grid Communication. DSD (2009)