Timeline for dominant eigenvector
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2011 at 22:59 | comment | added | Federico Poloni | First idea that comes into my mind: if your vector was in the form $a\otimes b$, then it would be easy to code the map $v\mapsto Mv$ without computing explicitly the tensor product. Since it is not, you may cheat and decompose it into the sum of $n$ vector of this kind, just take $a=e_1,e_2,\dots,e_n$. This should cost $O(n^2\cdot n)$ ops, assuming no structure on $X$. If $X$ is sparse or Toeplitz, well, you should've mentioned that from the start. :) Maybe someone else will come up with a better strategy though. | |
| Feb 4, 2011 at 9:18 | comment | added | person | Thank you for your kind help. Could you give any hint on how to avoid tensor product? | |
| Feb 4, 2011 at 8:47 | history | answered | Federico Poloni | CC BY-SA 2.5 |