As we know that the complexity of diagonalization of a matrix should be N^3, where N is the dimension of the matrix.
In MKL, there are a lot of functions that can calculate just some of the eigenvalues.
I want to know that when we just calculate one eigenvalue, if the time cost is divided by N?