activity
20152020
most citedNFFT meets Krylov methods: Fast matrix-vector products for the graph Laplacian of fully connected networks

12 citations · 15 across the 7 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

math.NA2017

High-dimensional sparse FFT based on sampling along multiple rank-1 lattices

Lutz Kämmerer, Daniel Potts, Toni Volkmer

The reconstruction of high-dimensional sparse signals is a challenging task in a wide range of applications. In order to deal with high-dimensional problems, efficient sparse fast…