On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
- 1 January 1974
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 21 (1) , 161-167
- https://doi.org/10.1145/321796.321810
Abstract
A family of new algorithms is given for evaluating the first m derivatives of a polynomial. In particular, it is shown that all derivatives may be evaluated in 3 n - 2 multiplications. The best previous result required 1/2 n ( n + 1) multiplications. Some optimality results are presented.Keywords
This publication has 3 references indexed in Scilit:
- HORNERS RULE IS UNIQUELY OPTIMALPublished by Elsevier ,1971
- Error analysis of the algorithm for shifting the zeros of a polynomial by synthetic divisionMathematics of Computation, 1971
- Associated Polynomials and Uniform Methods for the Solution of Linear ProblemsSIAM Review, 1966