#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):
Well, Karatsuba is just the first algorithm you can find on faster
polynomial multiplication. There is no good balance that will work for
every ring. For a fixed ring it even depends on the specific input as has
been shown in Mario's examples.
virtually any book on computer algebra will mention Karatsuba method of
multiplication. You could take a look, for example, to Joachim von zur
Gathen, Jürgen Gerhard, "Modern Computer Algebra" were Karatsuba and
Schönhage–Strassen methods are discussed.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10480#comment:11>
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.
