Timeline for Computing determinants of matrices of linear forms
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2017 at 19:12 | answer | added | Adrian | timeline score: 3 | |
| Aug 14, 2012 at 17:38 | vote | accept | David E Speyer | ||
| Aug 14, 2012 at 2:41 | comment | added | Will Jagy | @Igor, mostly if they are rational and a common denominator can be found, I get a different sense of this. You can do Gaussian elimination over the integers, and over polynomials with integer coefficients, by keeping track of a steadily growing common divisor. | |
| Aug 13, 2012 at 23:20 | history | edited | David E Speyer | CC BY-SA 3.0 |
added 351 characters in body
|
| Aug 13, 2012 at 21:40 | comment | added | Igor Rivin | @Will: What exactly do you mean by your question? | |
| Aug 13, 2012 at 20:19 | comment | added | Will Jagy | Are the floating point entries rational, real algebraic, or other? | |
| Aug 13, 2012 at 19:06 | comment | added | Igor Rivin | The problem is that the matrix is not a numeric matrix, so you will wind up with horribly huge rational functions (with floating point coefficients). | |
| Aug 13, 2012 at 18:52 | answer | added | Igor Rivin | timeline score: 4 | |
| Aug 13, 2012 at 18:50 | answer | added | Chris Godsil | timeline score: 3 | |
| Aug 13, 2012 at 18:44 | comment | added | Qiaochu Yuan | What goes wrong with Gaussian elimination? Is it numerically unstable? | |
| Aug 13, 2012 at 18:28 | history | asked | David E Speyer | CC BY-SA 3.0 |