
I have a large sparse square matrix — a graph adjacency matrix, actually. The matrix might have thousands of dimensions. I need to find only the eigenvector corresponding to the largest eigenvalue for this matrix, and I need to do it repeatedly and
as fast as possible.
Is Math.NET is a good choice of library for this task? If so, which solver should I use?

