
Review of Short Phrases and Links 
This Review contains major "Horner Scheme" related terms, short phrases and links grouped together in the form of Encyclopedia article.
Definitions
 The Horner scheme is a fast algorithm for dividing a polynomial by a linear polynomial with Ruffini's rule.
 The Horner scheme is an algorithm for the efficient evaluation of polynomial functions, and for dividing polynomials by linear polynomials.
 The Horner scheme is a sequential structure while the direct scheme allows some internal parallelism.
 The Horner scheme is a sequential structure while the direct scheme allows some internal parallelism.
 But even evaluating a polynomial is not straightforward: the Horner scheme is often more efficient than the obvious method.
 We present an efficient version of the Horner scheme for the evaluation of multivariate polynomials and study its stability properties.
 The Horner scheme is an algorithm for the efficient evaluation of polynomial functions, and for dividing polynomials by linear polynomials.
Horner Scheme
 The Horner scheme is a fast algorithm for dividing a polynomial by a linear polynomial with Ruffini's rule.
 For polynomials, a better approach is using the Horner scheme, since it reduces the necessary number of multiplications and additions.
 Evaluation of polynomials To evaluate a polynomial in monomial form one can use the Horner scheme.
(Web site)
Categories
 Linear Polynomial
 Fast Algorithm
 Polynomial Functions
 Multivariate Polynomials
 Multiplications

Books about "Horner Scheme" in
Amazon.com


