-
-
Notifications
You must be signed in to change notification settings - Fork 9
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Floating-point algorithms? #14
Comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Apologies if I've missed something, but I couldn't figure out how to use
solveM
orsolve'
with floating point coefficients (e.g.Double
). Is this possible?In my situation, the algorithms using
Fraction Integer
seem much too slow. Something that takes less than a second in Mathematica or Macaulay2 doesn't even terminate after 15 minutes withsolveM
/solve'
.Here's an example of a system that I've been working with (I cleared the denominators manually, for simplicity)
These are polynomials in two variables
t
,u
. BothMathematica
andMacaulay2
can solve the system{p, q1, q2}
in less than a second, whereas neithersolveM
norsolve'
can finish under 15 minutes.In this case, I'm looking for the real solutions with t,u in the unit interval, which are:
I also tried to use
Fraction Int
, but a lack of instances prevented that from working.The text was updated successfully, but these errors were encountered: