#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|
e8dd233a1d09f90bfa53ed7542c76879e616e755
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by fredrik.johansson):
Why does the flint_arith.chebyshev_T create an fmpz_poly, convert it to an
array of ZZs, and then convert it back to a polynomial? Over ZZ[x], the
roundtrip is probably more expensive than the actual computation. It
should be enough to create a new Polynomial_integer_dense_flint instance
and apply arith_chebyshev_t to its .__poly (the n > 10 condition can
certainly be dropped).
--
Ticket URL: <http://trac.sagemath.org/ticket/16812#comment:6>
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.
