Timeline for Upper bounds on the condition number of the eigenvector matrix
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28, 2017 at 21:15 | comment | added | Federico Poloni | @user35593 Thanks a lot for the fixes! | |
| S Jan 28, 2017 at 16:19 | history | suggested | user35593 | CC BY-SA 3.0 |
should be 3a instead of a/3, we have for instance tr(M)=tr(A)
|
| Jan 28, 2017 at 15:58 | review | Suggested edits | |||
| S Jan 28, 2017 at 16:19 | |||||
| Jan 28, 2017 at 8:29 | vote | accept | Ludwig | ||
| Jan 28, 2017 at 7:09 | history | edited | Federico Poloni | CC BY-SA 3.0 |
added 2 characters in body
|
| Jan 28, 2017 at 7:06 | comment | added | Federico Poloni | @user35593 You are correct; one needs to be more careful than I was with the choice of $V$. Fortunately, Householder reflectors (which are the standard tool used to construct orthogonal decompositions) work. I have fixed my answer now. | |
| Jan 28, 2017 at 7:04 | history | edited | Federico Poloni | CC BY-SA 3.0 |
Fixed choice of $V$
|
| Jan 28, 2017 at 1:27 | comment | added | user35593 | I think you need a orthogonal V, at least the first row of V^-1 should be (1,1,1). Furthermore as there is no orthogonal matrix mapping vectors of different lengths you probably mean a scaled version and then multiply the result. | |
| Jan 27, 2017 at 19:30 | history | answered | Federico Poloni | CC BY-SA 3.0 |