TOPICS
Search

Horner's Rule


Horner's rule is a method for evaluating a polynomial that reduces the number of multiplications and can improve numerical stability. It rewrites the polynomial by successively factoring out powers of x, giving

 a_nx^n+a_(n-1)x^(n-1)+...+a_0=((a_nx+a_(n-1))x+...)x+a_0.

See also

Polynomial, Synthetic Substitution

Explore with Wolfram|Alpha

References

Borwein, P. and Erdélyi, T. "Horner's Rule." §1.1.E.5 in Polynomials and Polynomial Inequalities. New York: Springer-Verlag, p. 8, 1995.Knuth, D. E. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 3rd ed. Reading, MA: Addison-Wesley, pp. 467-469, 1998.Vardi, I. Computational Recreations in Mathematica. Reading, MA: Addison-Wesley, p. 9, 1991.

Referenced on Wolfram|Alpha

Horner's Rule

Cite this as:

Weisstein, Eric W. "Horner's Rule." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/HornersRule.html

Subject classifications