Eigenvectors of a diagonalizable matrix - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-21T05:03:07Z http://mathoverflow.net/feeds/question/81560 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/81560/eigenvectors-of-a-diagonalizable-matrix Eigenvectors of a diagonalizable matrix unknown (google) 2011-11-21T23:51:29Z 2011-12-07T05:22:12Z <p>Suppose we have a n-by-n symmetric matrix K which can be factorized in a way, K = H * L * H', where L is a m-by-m diagonal matrix and H is a n-by-m matrix. In addition, let's assume n &lt;= m.</p> <p>Can we compute the eigen-decomposition of K faster by taking the advantage of this factorization?</p> http://mathoverflow.net/questions/81560/eigenvectors-of-a-diagonalizable-matrix/81578#81578 Answer by David Feldman for Eigenvectors of a diagonalizable matrix David Feldman 2011-11-22T05:27:35Z 2011-11-23T05:13:22Z <p>If yes in general, then yes for $L=I$, the identity. And also yes for symmetric $n$-by-$n$ $H$ with $H^2=K$ and the same eigenvectors as $K$. It seems to me that if finding the eigenvectors of a pair $(H,H^2)$ turned out easier than finding the eigenvectors of $H^2=K$, then $H$ would have to enjoy some special structure that a generic $K$ doesn't enjoy--- because one easily completes any given $H$ to a pair $(H,H^2)$. Thus having $K$ {\em given} doesn't help and the problem turns out as hard as finding eigenvectors of $H$. But nothing generally distinguishes operators that happen to turn out equal to the square-root of given generic operators (with 1-dim eigenspaces and distinct eigenvalues).</p> http://mathoverflow.net/questions/81560/eigenvectors-of-a-diagonalizable-matrix/81579#81579 Answer by David Feldman for Eigenvectors of a diagonalizable matrix David Feldman 2011-11-22T05:49:04Z 2011-11-22T05:49:04Z <p>A completely different answer: </p> <p>Given $n$-by-$n$ $K$ we can easily cook an $H$ such that $K=H*H'$ (so your $L=I$). </p> <p>Let $m=n+1$-choose-$2$, associate the columns of $H$ with singletons and pairs of the original rows. </p> <p>Populate a row $r$ of $H$ so that, in particular, $r$ has a 0 in any column not associated to singleton ${r}$ or a pair containing $r$. </p> <p>Then pick values for the other entries of $H$, first to get the right off-diagonal entries of $K$ (the doubleton columns), and lastly to get the right diagonal entries (the singleton columns). </p> <p>Since $H$ comes so cheap giving $K$, receiving such an $H$ tied-up-with-string can't genuinely simplify the decomposition of $K$.</p>