[FEA] Add benchmarks for computing polynomials

[GregoryKimball]

Is your feature request related to a problem? Please describe.
We have binary op and AST benchmarks for balanced and imbalanced trees. The imbalanced tree benchmarks use X input columns where X is the tree depth.

Libcudf also has a UDF transform API that accepts CUDA code, but (to be confirmed) this API can only readily accept one column.

Describe the solution you'd like

We could add integer, float and decimal (?) benchmarks to compute polynomials. These benchmarks would only need one input column and could compare binary ops, ASTs and transform UDFs. We could have a benchmark axis to define the polynomial order. We could generate the constants and the column values to avoid overflow up to a certain order.

order 2 : a * x * x + b * x + c
order 3 : a * x * x * x + b * x * x + c * x + d
...

Additional context
We should also consider improving transform UDFs to process multiple input columns.

[bdice]

Sure! I think the typical way to compute polynomials is like (((a * x) + b) * x) + c, if that helps build a better AST.

[vyasr]

I think this is a pretty reasonable way to generate this kind of benchmark.

[wence-]

I think the typical way to compute polynomials is like (((a * x) + b) * x) + c

Legendre and Chebyshev enter the chat :)