PolyDense

Compose this polynomial with another.

Returns a map from exponent to coefficient of this polynomial.

This will flip/mirror the polynomial about the y-axis. It is equivalent to poly.compose(-Polynomial.x), but will likely be faster to calculate.

Returns true iff this polynomial is constant.

Returns the term of the highest degree in this polynomial.

Returns the non-zero term of the minimum degree in this polynomial, unless it is zero. If this polynomial is zero, then this returns a zero term.

Returns this polynomial as a monic polynomial, where the leading coefficient (ie. maxOrderTermCoeff) is 1.

Returns the reciprocal of this polynomial. Essentially, if this polynomial is p with degree n, then returns a polynomial q(x) = x^n*p(1/x).

Removes all zero roots from this polynomial.

Returns the real roots of this polynomial.

Depending on C, the finder argument may need to be passed "explicitly" via an implicit conversion. This is because some types (eg BigDecimal, Rational, etc) require an error bound, and so provide implicit conversions to RootFinders from the error type. For instance, BigDecimal requires either a scale or MathContext. So, we'd call this method with poly.roots(MathContext.DECIMAL128), which would return a Roots[BigDecimal whose roots are approximated to the precision specified in DECIMAL128 and rounded appropriately.

On the other hand, a type like Double doesn't require an error bound and so can be called without specifying the RootFinder.

Shift this polynomial along the x-axis by h, so that this(x + h) == this.shift(h).apply(x). This is equivalent to calling this.compose(Polynomial.x + h), but is likely to compute the shifted polynomial much faster.

Returns the number of sign variations in the coefficients of this polynomial. Given 2 consecutive terms (ignoring 0 terms), a sign variation is indicated when the terms have differing signs.

Returns a list of non-zero terms.