Timeline for Fast Upper Triangular Matrix Exponentiation
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Dec 31, 2016 at 10:57 | history | suggested | Rodrigo de Azevedo |
Added tag to question
|
|
| Dec 31, 2016 at 10:36 | review | Suggested edits | |||
| S Dec 31, 2016 at 10:57 | |||||
| Dec 12, 2015 at 11:50 | comment | added | Federico Poloni | I agree, this isn't going to be useful to compute an exponential. I was just pointing out that a decomposition of the kind that you mention is available, if you don't impose additional conditions. | |
| Dec 12, 2015 at 9:38 | comment | added | Alex R. | @Federico Poloni: unfortunately you also need the resulting pair of matrices to commute which isn't the case with that decomposition | |
| Dec 12, 2015 at 7:52 | answer | added | Denis Serre | timeline score: 4 | |
| Dec 12, 2015 at 7:24 | answer | added | Federico Poloni | timeline score: 5 | |
| Dec 12, 2015 at 7:14 | comment | added | Federico Poloni | You already have a trivial diagonal + nilpotent decomposition, by separating the diagonal and the superdiagonal part. If you want one with all ones in the superdiagonal, just multiply by the matrix $\operatorname{diag}(\lambda_1,\lambda_2,\dots,\lambda_n)$ and its inverse on both sides. | |
| Dec 12, 2015 at 6:13 | answer | added | Carlo Beenakker | timeline score: 3 | |
| Dec 12, 2015 at 4:09 | history | edited | Alex R. | CC BY-SA 3.0 |
added 187 characters in body
|
| Dec 12, 2015 at 4:02 | history | edited | Alex R. | CC BY-SA 3.0 |
added 146 characters in body
|
| Dec 12, 2015 at 3:59 | history | undeleted | Alex R. | ||
| Dec 12, 2015 at 3:58 | history | deleted | Alex R. | via Vote | |
| Dec 12, 2015 at 3:49 | history | asked | Alex R. | CC BY-SA 3.0 |