In mathematics and computer science, polynomial evaluation refers to computation of the value of a polynomial when its indeterminates are substituted for...

science, Horner's method (or Horner's scheme) is an algorithm for polynomial evaluation. Although named after William George Horner, this method is much...

of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more...

In mathematics, a polynomial is a mathematical expression consisting of indeterminates (also called variables) and coefficients, that involves only the...

{\displaystyle x=-b/a.} For quadratic polynomials (degree two), the quadratic formula produces a solution, but its numerical evaluation may require some care for...

Quasi-polynomial time algorithms are algorithms whose running time exhibits quasi-polynomial growth, a type of behavior that may be slower than polynomial time...

The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as T n ( x ) {\displaystyle T_{n}(x)} and...

In numerical analysis, the Lagrange interpolating polynomial is the unique polynomial of lowest degree that interpolates a given set of data. Given a...

numerical analysis, a Bernstein polynomial is a polynomial expressed as a linear combination of Bernstein basis polynomials. The idea is named after mathematician...

Function evaluation Polynomial evaluation (see also Polynomial ring § Polynomial evaluation) The function apply in Apply § Universal property Evaluation map...