#15600: Exact computations in QQbar spend unreasonable amounts of time in
do_polred
-------------------------------+------------------------
Reporter: mmezzarobba | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.1
Component: performance | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
-------------------------------+------------------------
Comment (by mmezzarobba):
I agree that QQbar ''also'' needs more caching. (And not only in the
marked places. For instance, look how many times `nfinit` is called by
`sage_input(pol.roots(...,ring=QQbar), verify=True)`: it seems to me that
lots of expensive purely algebraic computations could be performed only
once when we have `AlgebraicGenerator`s corresponding to several roots of
the same irreducible polynomial.)
But even with caching, is it reasonable to spend tens of seconds
optimizing the representation of an extension that may be used only once
to check that some expression is zero?
--
Ticket URL: <http://trac.sagemath.org/ticket/15600#comment:2>
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/groups/opt_out.
