Fast matrix-vector products for large graph Laplacians using NFFT.
problem Efficient computation of matrix-vector products for large, densely populated graph Laplacians.
method Combining NFFT with Krylov methods and iterative solvers.
result Significant speedup in computations for graph Laplacians.