Timeline for Parametrizing eigenvectors
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 26, 2010 at 18:01 | vote | accept | Helge | ||
| Aug 25, 2010 at 16:16 | comment | added | J. M. isn't a mathematician | No worries damiano, I still voted it up. :) | |
| Aug 25, 2010 at 16:07 | comment | added | damiano | There are of course various ways to proceed: I just wanted something that was "obviously as smooth as you can possibly hope for" and for which you can give an explicit formula. If you wanted to implement it, you would probably not use Cramer's rule, but I thought that the point of the question was not computational. | |
| Aug 25, 2010 at 15:58 | comment | added | J. M. isn't a mathematician | Ugh, Cramer. :D Just arbitrarily ignore one of the $n$ implied linear equations, set the corresponding component to an arbitrary value (in inverse iteration routines 1 is the traditional "arbitrary value"), and eliminate as usual. | |
| Aug 25, 2010 at 15:19 | comment | added | damiano | Forgot to say: once you have an eigenvalue parameterized, you can find the eigenvector by using Cramer's rule, for instance! | |
| Aug 25, 2010 at 15:14 | history | answered | damiano | CC BY-SA 2.5 |