#16812: use FLINT to speed up Chebyshev T polynomial creation
-------------------------------------+-------------------------------------
Reporter: rws | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: symbolics | Resolution:
Keywords: flint, speedup | Merged in:
Authors: Ralf Stephan | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/rws/use_flint_to_speed_up_chebyshev_t_polynomial_creation|
61972b5574632e914e178fe211062d0dd0e35b87
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jdemeyer):
For the p-adics, how about this: compute the leading term of the resulting
polynomial, which is `2^(n-1)`. If that result is zero, use the recursive
algorithm. Otherwise, use the FLINT algorithm.
As a general rule, one should '''never''' remove doctests to "fix"
something, unless you can show that there is a problem with the doctest
itself.
--
Ticket URL: <http://trac.sagemath.org/ticket/16812#comment:16>
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.
