#10480: fast PowerSeries_poly multiplication
-------------------------------------------------+-------------------------
Reporter: pernici | Owner: malb
Type: enhancement | Status:
Priority: major | needs_review
Component: commutative algebra | Milestone: sage-6.2
Keywords: power series | Resolution:
Authors: Mario Pernici, Luis Felipe | Merged in:
Tabera Alonso | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #10255 | Stopgaps:
-------------------------------------------------+-------------------------
Comment (by zimmerma):
I'm new to this ticket, thus please forgive me if some comments are out of
scope.
About Mulders' algorithm, using a fixed cutoff point k = 25/36*n is not
optimal in
practice, where it is better to tune the best k for each n (up to say
n=1024) as we do in GNU MPFR.
Since truncated (polynomial) multiplication is potentially useful in other
parts of Sage, it would make sense to have the code implementing truncated
multiplication and the one using it for power series in two different
tickets, no?
Paul
--
Ticket URL: <http://trac.sagemath.org/ticket/10480#comment:24>
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.
