#18282: Fixes, cleanup and improvements to the default evaluation method for
univariate polynomials
-------------------------------------+-------------------------------------
Reporter: mmezzarobba | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.8
Component: commutative | Resolution:
algebra | Merged in:
Keywords: | Reviewers:
Authors: Marc Mezzarobba | Work issues:
Report Upstream: N/A | Commit:
Branch: | 84d6a1b874c241e8eed8196cc42fd9075be40206
u/mmezzarobba/pol_call | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by mmezzarobba):
Replying to [comment:15 bruno]:
> One could easily modify lines 755-756 in
`src/sage/rings/polynomial/polynomial_element.pyx` to make the loop ranges
over the nonzero coefficients. I've not checked already whether it is
slower in a sensible way for really dense polynomials or not, but it would
be faster for sparse polynomials.
Sounds reasonable—or perhaps one should override `__call__` in
`Polynomial_generic_sparse`, I don't know. In any case I have no time to
spend on this ticket now, but please feel free to add improvements if you
want!
--
Ticket URL: <http://trac.sagemath.org/ticket/18282#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.
