Re: [boost] [math] Efficient polynomial multiplication

Subject: Re: [boost] [math] Efficient polynomial multiplication
From: Mike Gresens (mike.gresens_at_[hidden])
Date: 2017-07-17 19:02:14

BTW: A polynomial class working with std::array / boost::array would be 
great! No allocation at all...

polynomial<float,3> f {1,2,3}, g {4,5,6};
polynomial<float,5> h = f * g;
auto i = h * g;
etc...

Mike...

Am 17.07.2017 um 20:53 schrieb John Maddock via Boost:
> 
>> 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
> 
> 
> _______________________________________________
> Unsubscribe & other changes: 
> http://lists.boost.org/mailman/listinfo.cgi/boost
>