HORNERS RULE IS UNIQUELY OPTIMAL
暂无分享，去创建一个
Abstract It is shown that with respect to the basic arithmetics (+, −, ×, ÷), Horner's rule is a uniquely optimal method for computing a polynomial The proof of uniqueness follows the known techniques for establishing the optimality of Horner's rule; specifically, “growth” arguments are combined with arguments regarding “active operations”.
[1] S Winograd,et al. On the number of multiplications required to compute certain functions. , 1967, Proceedings of the National Academy of Sciences of the United States of America.
[2] V. Pan. METHODS OF COMPUTING VALUES OF POLYNOMIALS , 1966 .
[3] L. R. Kerr,et al. On Minimizing the Number of Multiplications Necessary for Matrix Multiplication , 1969 .