Timeline for Effective algorithm to test positivity
Current License: CC BY-SA 2.5
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2011 at 13:27 | history | edited | Federico Poloni |
edited tags
|
|
| Nov 17, 2011 at 11:42 | answer | added | Jose Capco | timeline score: 2 | |
| Aug 26, 2010 at 12:55 | vote | accept | CommunityBot | ||
| Aug 26, 2010 at 12:55 | comment | added | user2529 | Thanks everyone for their comments. I'm aware that nonnegative f are sums of squares of rational functions, but i was looking for whether the positivity of f could be checked via some other method not subscribing to sums of squares. | |
| Aug 25, 2010 at 18:16 | answer | added | Thierry Zell | timeline score: 4 | |
| Aug 25, 2010 at 16:38 | answer | added | Noah Stein | timeline score: 14 | |
| Aug 25, 2010 at 15:44 | history | edited | Tsuyoshi Ito |
edited tags
|
|
| Aug 25, 2010 at 11:36 | comment | added | David E Speyer | There is an algorithm, by Tarski's theorem. My usual reference for practical aspects of this sort of thing is "Algorithms in Real Algebraic Geometry" books.google.com/books?id=ecwGevUijK4C | |
| Aug 25, 2010 at 9:27 | comment | added | Robin Chapman | The existence of an effective algorithm follows from Tarski's theorem on decidability in real-closed fields. Whether there's a practcial algorithm is another matter. | |
| Aug 25, 2010 at 8:00 | comment | added | damiano | By "effective" you mean "reasonably fast" or simply "in theory there is an algorithm"? Also, it is difficult to feed a real number to a computer: do you really want real coefficients or would rational coefficients be enough? | |
| Aug 25, 2010 at 7:41 | history | asked | user2529 | CC BY-SA 2.5 |