#10480: fast PowerSeries_poly multiplication
-----------------------------------+----------------------------------------
Reporter: pernici | Owner: malb
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.6.2
Component: commutative algebra | Keywords: power series
Author: mario pernici | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------------+----------------------------------------
Comment(by lftabera):
I will try to implement the algorithm at "A long note on Mulders’ short
product" of Hanrot and Zimmermann that looks not harder than Karatsuba.
The authors claim that heuristically the gain time is on the average 0.7 x
Karatsuba time.
Also, the following cases have to be correctly covered:
{{{
sage: O(x)*O(x)
0
sage: O(x^2)*O(x^3)
0
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10480#comment:4>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
