Package dev.nm.analysis.function.polynomial

Class Summary

Class	Description
CauchyPolynomial	The Cauchy's polynomial of a polynomial takes this form: C(x) = |p_n|x^n + |p_{n-1}|x^{n-1} + ... + |p_1|x - |p_0| = 0 Note: the sign of the constant is negative.
HornerScheme	Horner scheme is an algorithm for the efficient evaluation of polynomials in monomial form.
Polynomial	A polynomial is a UnivariateRealFunction that represents a finite length expression constructed from variables and constants, using the operations of addition, subtraction, multiplication, and constant non-negative whole number exponents.
QuadraticMonomial	A quadratic monomial has this form: \(x^{2} + ux + v\).
QuadraticSyntheticDivision	Divide a polynomial P(x) by a quadratic monomial \((x^{2} + ux + v)\) to give the quotient Q(x) and the remainder (b * (x + u) + a).
ScaledPolynomial	This constructs a scaled polynomial that has neither too big or too small coefficients, hence avoiding overflow or underflow.