VictorMiller wrote:
> To do this correctly in full generality one needs to get into
> "cyclindrical algebraic decomposition" -- a set in R^n has a
> cylindrical algebraic
> decomposition if it is written as a finite union of sets of the form
> { x : f(x) > 0 } where f is a polynomial. There is an algorithm due
> to Tarski
> for creating such sets.
>
Carl Witty has (unreleased) Sage code for doing such things. We also
have an optional spkg for qepcadb, which computes such things.
Unfortunately, it seems like Carl has not been active in the project
lately, so I don't know who else could or wants to do this. Carl: if
you are reading these messages, is there the possibility you could post
your code somewhere so interested people could work from there?
I might note that Mathematica has a very powerful CAD implementation,
from what I understand.
Jason
--
Jason Grout
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
