I am running
x = polygen(QQ)
equation = -960000000*x^7 + 416000000*x^6 - 66400000*x^5 + 5600000*x^4 -
280000*x^3 + 8400*x^2 - 140*x + 1
roots = equation.roots(QQbar)
a_root = roots[-1]
abs_root = abs(a_root)
and am surprised that it takes approx. three minutes.
sorted(roots, key=lambda r: abs(r))
then still takes 8 Minutes.
Is this expected behaviour? I am intersted in the smallest root(s) in absolute
value only, any suggestions for achieving that in less time?
You received this message because you are subscribed to the Google Groups
To unsubscribe from this group and stop receiving emails from it, send an email
To post to this group, send email to firstname.lastname@example.org.
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.