Timeline for ULU Decomposition of a matrix
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 19, 2014 at 15:36 | answer | added | Jim Humphreys | timeline score: 5 | |
Dec 18, 2014 at 14:58 | vote | accept | Scott Andrews | ||
Dec 18, 2014 at 12:37 | answer | added | Andrei Smolensky | timeline score: 13 | |
Dec 17, 2014 at 15:38 | history | edited | Scott Andrews | CC BY-SA 3.0 |
Added remark to simplify.
|
Dec 17, 2014 at 15:02 | comment | added | Carlo Beenakker | there exists a proof of $g=u_1 l u_2 p$ (with unipotent upper/lower triangular $u_1,u_2/l$) for the case that $p$ is a permutation matrix times a constant, rather than a diagonal matrix: --- ac.els-cdn.com/S0024379596002406/… --- | |
Dec 17, 2014 at 14:42 | comment | added | Scott Andrews | Thanks for pointing that out, I should have just included that in the original question as it may make it easier. I've edited to question to reflect your comment. | |
Dec 17, 2014 at 14:41 | history | edited | Scott Andrews | CC BY-SA 3.0 |
Changed to reflect Geoff's comment
|
Dec 17, 2014 at 11:56 | comment | added | Geoff Robinson | If it could be done, it could be done with $u_{1}$ and $u_{2}$ unipotent. | |
Dec 17, 2014 at 7:45 | history | edited | Federico Poloni |
edited tags
|
|
Dec 17, 2014 at 2:05 | history | asked | Scott Andrews | CC BY-SA 3.0 |