83 citations · 332 across the 27 of their papers we have counts for
Showing math.NAShow all
2 papers · 1 filter
math.NA2017
Analyzing the Approximation Error of the Fast Graph Fourier Transform
Luc LeMagoarou, Nicolas Tremblay, Rémi Gribonval
The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approx…
math.NA2016★ 71 cited
Approximate fast graph Fourier transforms via multi-layer sparse approximations
Luc Le Magoarou, Rémi Gribonval, Nicolas Tremblay
The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n log n) instead of O(n 2) arithmetic…