# Horner's Method

Horner's Method

Horner's method for polynomial computation both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of large numbers. The rule is based on successive factorization to eliminate powers of greater than 1:

x

P(x)=++...+=((x+)x+...)x+

a

n

n

x

a

n-

1

n-1

x

a

0

a

n

a

n-1

a

0

To compute , we find =, =+a, ... , =+a, .

P(a)

b

n-1

a

n

b

n-2

a

n-1

b

n-1

b

0

a

1

b

1

P(x)=+a

a

0

b

0

The factor polynomial is given by .

Q(x)=P(x)/(x-a)=++...+

b

n-1

n-1

x

b

n-2

n-2

x

b

0

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

n

a

x

k

x

a