#16222: Faster exactification using numeric minpoly
-----------------------------+-------------------------------------
Reporter: gagern | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.3
Component: number fields | Keywords:
Merged in: | Authors: Martin von Gagern
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+-------------------------------------
This is a spinoff from comment:13:ticket:14239. There I noticed that for a
large symbolic expressions `b`, the call `b.minpoly()` was a lot (by
several orders of magnitude) faster than the call `QQbar(b).minpoly()`. We
should try to make this speed gain available to those algebraic numbers
which were constructed from symbolic expressions.
I now know that the speed gain is almost certainly due to the numeric
algorithm in `calculus.minpoly`. So what we should in my opinion do is use
that numeric algorithm to obtain a minimal polynomial of the whole
expression, and if that succeeds, base subsequent exactifications on that
polynomial instead of the nested tree of algebraic number descriptors.
--
Ticket URL: <http://trac.sagemath.org/ticket/16222>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
