#10480: fast PowerSeries_poly multiplication
---------------------------------------+------------------------------------
       Reporter:  pernici              |         Owner:  malb        
           Type:  enhancement          |        Status:  needs_review
       Priority:  major                |     Milestone:  sage-5.8    
      Component:  commutative algebra  |    Resolution:              
       Keywords:  power series         |   Work issues:              
Report Upstream:  N/A                  |     Reviewers:              
        Authors:  mario pernici        |     Merged in:              
   Dependencies:  #10255               |      Stopgaps:              
---------------------------------------+------------------------------------
Changes (by lftabera):

  * status:  needs_work => needs_review
  * dependencies:  => #10255


Comment:

 Previous implementation was not better than full multiplication. I  have
 added a patch with original Mulder's short multiplication. If the cost of
 operations is similar for all coefficients of the power series, then the
 short multiplication compatible with karatsuba will be faster than the
 naive one.

 Said this, for multivariate power series, typically higher terms are big
 polynomials with significant multiplication cost. That is way the generic
 multiplication is better in those cases.

 Apply: trac_10480_fast_Powerseries_Mulder.patch

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10480#comment:15>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.


Reply via email to