On 17.09.2014 19:02, Jonas Jermann wrote:
Hi again
After a closer look it seems that almost all time is spent
in the calculation of "el2._exact_field().pari_field()"
which occurs in
"gen = left._exact_field().union(right._exact_field())"
from line 7851 of qqbar.py.
One suggestion for a maybe faster algorithm to check equality:
1. Check if the minimal polynomials agree
2. "Find non-overlapping intervals for the roots"
3. Figure out the intervals of the corresponding two roots
and compare.
Maybe a better alternative is to "reduce" the exact field:
At an appropriate place (e.g. immediately)
replace "element._exact_field" with the field given by
the minpoly of element.
In short: Why not simplify elements before doing
non-trivial binary operations?
It might slow down some calculations but it would probably
speed up others by a factor like 10'000(?) since it will
probably avoid the strange "pari_field()" slowness..
Best
Jonas
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
