Jacobian matrices;Signal processing algorithms;Approximation error;Fourier transforms;Approximation algorithms;Laplace equations;Sparse matrices

Analyzing the approximation error of the fast graph Fourier transform
The graph Fourier transform (GFT) is in general dense and requires O(n2) time to compute and O(n2) memory space to store. In this …
Luc Le Magoarou, Nicolas Tremblay, Rémi Gribonval
Cite DOI arXiv