17 Jul
2017
17 Jul
'17
6:53 p.m.
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