[Libre-soc-bugs] [Bug 1085] parallel prefix sum polynomial interpolation

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=1085

--- Comment #2 from Luke Kenneth Casson Leighton <lkcl at lkcl.net> ---
<markos_> I've done a similar method in the past
<programmerjake> idk, but parallel prefix sum and parallel tree reduction can
be used for polynomial evaluation:
<programmerjake> reduce(element_wise_mul(c, prefix_sum([1] + splat(x),
op=mul)), op=add) ==
<programmerjake> c[0]+c[1]*x+c[2]*x^2+c[3]*x^3+c[4]*x^4...
<programmerjake> though it tends to have lower precision than using fma because
of rounding before adding

-- 
You are receiving this mail because:
You are on the CC list for the bug.