|
inlineconstexpr |
Implement the horner scheme to evaluate polynomials.
If \((a_i)_{0\le i\le n-1}\) denotes the coefficients of the polynomial by decreasing power order, the Horner scheme evaluates the polynom \(p\) at \(x\) by : \(\displaystyle p(x) = (((a_0x+a_1)x+ ... )x + a_{n-1})\).
For non commutative cases it is a left-horner scheme: coefficients are at the left of the x powers).
Defined in header
Parameters
x
: real or cayley-dickson argument.coefs...
: real or cayley-dickson arguments. The coefficients by decreasing power ordertup
: kumi tuple containing The coefficients by decreasing power order.Return value
The value of the polynom at x
is returned, according to the formula: \(\displaystyle p(x) = (((a_0x+a_1)x+ ... )x + a_{n-1})\).
For non commutative cases it is a left-horner scheme. See right_horner for the right scheme
Notes
If the coefficients are simd values of cardinal N, this means you simultaneously compute the values of N polynomials.