Finding Largest Eigenvalue In Sparse Matrix

I'm using numpy and scipy. I have a large sparse matrix and I want to find the largest eigenvalue of the sparse matrix. How can I do that?

Solution 1:

I use scipy.sparse.linalg.eigsh for symmetric sparse matrices passing which="LM":

eigvals, eigvecs = eigsh(A, k=10, which='LM', sigma=1.)

but you should definitely read the documentation.