算法——Horner scheme

最新推荐文章于 2023-01-13 22:47:05 发布

刘小白.

最新推荐文章于 2023-01-13 22:47:05 发布

阅读量3.9k

点赞数 21

分类专栏：算法文章标签：算法数据结构 c++

本文链接：https://blog.csdn.net/qq_45703420/article/details/105197211

版权

博客介绍了Horner scheme算法，一种用于高效评估多项式的算法，由William George Horner提出，但其实早有历史。文章提供了算法应用、历史背景，并给出使用该方法计算多项式求和的程序设计任务，包括输入输出示例及代码实现思路。

摘要由CSDN通过智能技术生成

题目描述

In 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. Horner’s method describes a manual process by which one may approximate the roots of a polynomial equation. The Horner scheme can also be viewed as a fast algorithm for dividing a polynomial by a linear polynomial with Ruffini’s rule.
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 coefficients are the digits of the base-x representation of a given number — and can also be used if x is a matrix, in which case the gain in computational efficiency is even greater.
History
Even though the algorithm is named after William George Horner, who described it in 1819, the method was already known to Isaac Newton in 1669, and even earlier to the Chinese ma