Horner scheme Guide, Meaning , Facts, Information and Description
In the mathematical subfield of numerical analysis the Horner scheme or Horner algorithm, named after William George Horner, is an algorithm for the efficient evaluation of polynomials in monomial form.
| Table of contents |
|
2 Basic idea 3 Horner algorithm 4 Application 5 See also |
History
Even though it is named after William George Horner, who described the algorithm in 1819, it was already known to Isaac Newton in 1669 and even to the Chinese mathematician Ch'in Chiu-Shao around 1200s.
Basic idea
Assume we want to evaluate the polynomial in the monomial form
Given the polynomial
The Horner scheme can also be viewed as a fast algorithm for dividing a polynomial by a linear polynomial (see Ruffini's rule).
This is an Article on Horner scheme. Page Contains Information, Facts Details or Explanation Guide About Horner scheme Horner algorithm
we rearrange it into
Then starting from the innermost parentheses and working outwards we define
If we put the bn in the polynomial we see that
so b0 is the is the value of the polynomial p at x.Application
The Horner scheme is often used to convert between different positional numeral systems (in which case x is the base of the number system, and the ai are the digits) and can also be used if x is a matrix, in which case the gain is even larger.See also
