Timeline for Checking positive semi-definiteness of integer matrix
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2018 at 14:50 | vote | accept | SIM2 | ||
| Feb 14, 2018 at 19:06 | |||||
| Feb 14, 2018 at 2:33 | history | edited | Will Jagy | CC BY-SA 3.0 |
added 6879 characters in body
|
| Feb 14, 2018 at 1:05 | vote | accept | SIM2 | ||
| Feb 14, 2018 at 1:05 | |||||
| Feb 14, 2018 at 1:05 | vote | accept | SIM2 | ||
| Feb 14, 2018 at 1:05 | |||||
| Feb 14, 2018 at 0:50 | comment | added | Will Jagy | @user531150 yes, it could be done with integers, but then there would not be the automatic production of $Q = P^{-1}.$ Anyway, output is Latex, code is C++ with GMP. Meanwhile, I suggest you do read a little on Sylvester's Law of Inertia, en.wikipedia.org/wiki/Sylvester's_law_of_inertia | |
| Feb 14, 2018 at 0:48 | history | edited | Will Jagy | CC BY-SA 3.0 |
added 68 characters in body
|
| Feb 14, 2018 at 0:47 | comment | added | SIM2 | No need to calculate eigenvalues and only using rational(actually can be done in integer)! I really appreciate your answer. | |
| Feb 14, 2018 at 0:41 | history | edited | Will Jagy | CC BY-SA 3.0 |
added 4 characters in body
|
| Feb 14, 2018 at 0:35 | history | edited | Will Jagy | CC BY-SA 3.0 |
added 403 characters in body
|
| Feb 14, 2018 at 0:25 | history | answered | Will Jagy | CC BY-SA 3.0 |