Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
- Cite this paper as:
- Hart W., Novocin A. (2011) Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic. In: Gerdt V.P., Koepf W., Mayr E.W., Vorozhtsov E.V. (eds) Computer Algebra in Scientific Computing. CASC 2011. Lecture Notes in Computer Science, vol 6885. Springer, Berlin, Heidelberg
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for composition of power series, showing that it can be applied practically to composition of polynomials in ℤ[x] given in the standard monomial basis. We offer a complexity analysis, showing that it is asymptotically fast, avoiding coefficient explosion in ℤ[x]. Secondly we provide an improvement to Mulders’ polynomial division algorithm. We show that it is particularly efficient compared with the multimodular algorithm. The algorithms are straightforward to implement and available in the open source FLINT C library. We offer a practical comparison of our implementations with various computer algebra systems.
Unable to display preview. Download preview PDF.