Horner's Method

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

Horner's method for computing a polynomial both reduces the number of multiplications and results in greater numerical stability by potentially avoiding the subtraction of large numbers. It is based on successive factorization to eliminate powers of greater than 1.


Suppose ; then the method rewrites .

To compute , we find







The factor polynomial is given by .

You can select , the degree of the polynomial; , the desired value at ; and , the number of steps in which is replaced by . The table shows the new coefficients after each step.


Contributed by: Izidor Hafner (January 2016)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.