Expand description
Univariate polynomials, in the two forms a protocol carries them in.
coefficients -> evaluate_univariate Horner over the monomial basis
evaluations -> BinarySubspace methods Lagrange interpolation over a domainThe evaluation domain is always a BinarySubspace, and that is what makes the second form
cheap.
A subspace is an additive group, so every one of its points shares a single barycentric weight. The usual Lagrange formula needs one weight per point, and one inversion to build each. Here there is one weight and one inversion, whatever the domain size.
Traits§
- Evaluation
Domain - Lagrange interpolation over a domain of
2^dimpoints.
Functions§
- evaluate_
univariate - Evaluates a univariate polynomial given by its monomial coefficients.