Does anybody know if sage supports computing groebner basis for an ideal of rational functions with real coefficients? I can do this in mathematica, but when using sage I get the error:
verbose 0 (2416: multi_polynomial_ideal.py, groebner_basis) Warning: falling back to very slow toy implementation.
Just to phrase your question correctly, you want to work with a polynomial ring whose coefficient ring is rational functions with real coefficients.
You don't get an error, just a warning that there is no particularly fast implementation available. Singular just doesn't support it, so Sage falls back to its default implementation. Groebner basis computations over non-exact fields are generally iffy, so you should first think about whether you can rephrase your problem in an exact coefficient ring.
Asked: 2011-06-06 14:36:40 +0100
Seen: 1,233 times
Last updated: Jun 06 '11
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
