Re: [boost] [math] Efficient polynomial multiplication

Subject: Re: [boost] [math] Efficient polynomial multiplication
From: John Maddock (jz.maddock_at_[hidden])
Date: 2017-07-17 18:53:40

> Looking at the data, I'm wondering why is boost's implementation so slow
> for polynomials of lower degree? I could not see any obvious reason by
> looking at the source.

I would guess memory allocation: if you're multiplying into already 
allocated arrays and don't have to dynamically allocate memory for the 
result of the multiplication, then that should be a lot quicker.  I 
can't remember if the polynomial class operators are move-optimised 
either (they should be).

John.

---
This email has been checked for viruses by AVG.
http://www.avg.com