Horners method

views updated

Horner's method An algorithm for evaluating a polynomial by adding brackets in such a way that no powers greater than one need be evaluated. This reduces the number of evaluations. The polynomial, in effect, ends up in the following form: p(x) = […((anx + a(n–1))x + a(n–2))x…al]x + a0