Evaluate one or several univariate polynomials at several locations,
i.e. compute coef[1] + coef[2]*x + ... + coef[p+1]* x^p
(in the simplest case where x is scalar and coef a vector).
Usage
polyn.eval(coef, x)
Arguments
coef
numeric vector or matrix. If a vector, x can be an
array and the result matches x.
If coef is a matrix it specifies several polynomials of the
same degree as rows, x must be a vector, coef[,k] is
for \(x^{k-1}\) and the result
is a matrix of dimension length(x) * nrow(coef).
x
numeric vector or array. Either x or coef must
be a vector.
Value
numeric vector or array, depending on input dimensionalities, see above.
Details
The stable “Horner rule” is used for evaluation in any case.
See Also
For much more sophisticated handling of polynomials, use the
polynom package, see, e.g., predict.polynomial.
For multivariate polynomials (and also for nice interface to the
orthopolynom package), consider the mpoly package.