|
inlineconstexpr |
Implement the right_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 Right_Horner scheme evaluates the polynom \(p\) at \(x\) by : \(\displaystyle p(x) = (a_{n-1}+x(...+x (a_1+ x a_0)) ))\).
For non commutative cases it is a right_horner scheme (the coefficients are at the right 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 orderr
: Range 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_{n-1}+x(...+x (a_1+ x a_0)) ))\).
For non commutative cases it is a rigt-right_horner scheme. See horner for the left scheme
Notes
If the coefficients are simd values of cardinal N, this means you simultaneously compute the values of N polynomials.