3 research outputs found
The Efficient Calculation of Powers of Polynomials
Suppose we are given a polynomial in variables, let bound the degree of in all variables , and we wish to raise to the power, . In a recent paper which compared the iterative versus the binary method it was shown that their respective computing times were versus when using single precision arithmetic. In this paper a new algorithm is given whose computing time is shown to be O((mn)^{r+1). Also if we allow for polynomials with multiprecision integer coefficients, the new algorithm presented here will be faster by a factor of over the binary method and faster by a factor of over the iterative method. Extensive empirical studies of all three methods show that this new algorithm will be superior for polynomials of even relatively small degree, thus guaranteeing a practical as well as a useful result