Fast algorithm for calculating the smallest eigenvalues/eigenvectors of a symmetrical Laplacian matrix - MathOverflow most recent 30 from http://mathoverflow.net2013-05-24T18:29:59Zhttp://mathoverflow.net/feeds/question/71100http://www.creativecommons.org/licenses/by-nc/2.5/rdfhttp://mathoverflow.net/questions/71100/fast-algorithm-for-calculating-the-smallest-eigenvalues-eigenvectors-of-a-symmetrFast algorithm for calculating the smallest eigenvalues/eigenvectors of a symmetrical Laplacian matrixvesh2011-07-24T04:53:44Z2011-07-24T04:53:44Z
<p>I am trying to write a clustering method for a similarity matrix of a graph and i need a way to compute the smallest ev/ews of a laplacian matrix. I know that the smallest ew is 0 and the corresponding ev is a Nx1 vector of 1s where N is the size of the laplacian.</p>
<p>Thanks,</p>