#18122: Automatically choosing exactification algorithm
-----------------------------+----------------------------------
Reporter: gagern | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.6
Component: number fields | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies: #16222, #17886
Stopgaps: |
-----------------------------+----------------------------------
#16222 will provide a method for computing an exact representation of an
algebraic number based on the minimal polynomial of a symbolic expression.
At the moment I plan to only make that approach available as a manual
choice, but in the long run it would be nice if Sage could somehow
automatically decide how to perform the exactification.
Since the main benefit of the symbolic exactification is a speed gain,
#17886 should be taken into account as well, since that might drastically
reduce the cost of “normal” exactification. At least if that ticket gets
its decision-making right, which might be non-trivial.
So we have three possible approaches to exactification:
1. number field unions and operations therein (implemented so far)
2. minimal polynomials from symbolic expressions (#16222)
3. minimal polynomials from resultants (#17886)
and we should here try to make the choices among these alternatives as
good as we can.
--
Ticket URL: <http://trac.sagemath.org/ticket/18122>
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.
