|
inlineconstexpr |
If (c_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 :
\qquad\displaystyle p(x) = (((c_0x+c_1)x+ ... )x + c_{n-1})
Parameters
x
: evaluation point floating value arguments.ci...
: floating values polynom coefficients in decreasing power order, Note that the values of the ci
are not necessarily floating but the non floating ones are to be scalartci
: non empty tuple of floating values.c
: Conditional expression masking the operation.m
: Logical value masking the operation.Return value
If (c_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 : \qquad\qquad\displaystyle p(x) = (((c_0x+c_1)x+ ... )x + c_{n-1})
x
is returned.fma[pedantic]
instead of fma
is used in internal computations.