NFFT Meets Krylov Methods: Fast Matrix-Vector Products for the Graph Laplacian of Fully Connected Networks

Overview of attention for article published in Frontiers in Applied Mathematics and Statistics, December 2018

Altmetric Badge

About this Attention Score

In the top 5% of all research outputs scored by Altmetric
One of the highest-scoring outputs from this source (#6 of 364)
High Attention Score compared to outputs of the same age (94th percentile)
High Attention Score compared to outputs of the same age and source (94th percentile)

So far, Altmetric has seen 54 X posts from 51 X users, with an upper bound of 191,615 followers.

RT @FrontiersIn: In a @FrontMathsStats article, researchers propose a fast matrix vector multiplication method based on the nonequispaced f…

RT @FrontiersIn: In a @FrontMathsStats article, researchers propose a fast matrix vector multiplication method based on the nonequispaced f…

RT @FrontiersIn: In a @FrontMathsStats article, researchers propose a fast matrix vector multiplication method based on the nonequispaced f…

RT @FrontiersIn: In a @FrontMathsStats article, researchers propose a fast matrix vector multiplication method based on the nonequispaced f…

This page shows the most recent X posts that mention this research output.

Click here to find out how to access more activity, including 50 additional X posts.