12 citations · 15 across the 7 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LG2018★ 12 cited
NFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks
Dominik Alfke, Daniel Potts, Martin Stoll +1
The graph Laplacian is a standard tool in data science, machine learning, and image processing. The corresponding matrix inherits the complex structure of the underlying network an…
math.NA2018★ 2 cited
Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
Lutz Kämmerer, Toni Volkmer
In this work, we consider the approximate reconstruction of high-dimensional periodic functions based on sampling values. As sampling schemes, we utilize so-called reconstructing m…