Abstract
We modify an old algorithm for expanding powers of dense polynomials to make it work for sparse polynomials, by using a heap to sort monomials. It has better complexity and lower space requirements than other sparse powering algorithms for dense polynomials. We show how to parallelize the method, and compare its performance on a series of benchmark problems to other methods and the Magma, Maple and Singular computer algebra systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Fateman, R.: On the computation of powers of sparse polynomials. Studies in Appl. Math. 53, 145–155 (1974)
Fateman, R.: Polynomial multiplication, powers, and asymptotic analysis: some comments. SIAM J. Comput. 3(3), 196–213 (1974)
Fettis, H.: Algorithm 158. Communications of the ACM 6, 104 (1963)
Gentleman, M.: Optimal multiplication chains for computing a power of a symbolic polynomial. Math Comp. 26(120), 935–939 (1972)
Heindel, L.: Computation of powers of multivariate polynomials over the integers. J. Comput. Syst. Sci. 6(1), 1–8 (1972)
Horowitz, E., Sahni, S.: The computation of powers of symbolic polynomials. SIAM J. Comput. 4(2), 201–208 (1975)
Johnson, S.C.: Sparse polynomial arithmetic. ACM SIGSAM Bulletin 8(3), 63–71 (1974)
Knuth, D.: The Art of Computer Programming, Seminumerical Algorithms, vol. 2. Addison-Wesley (1998)
Moenck, R.: Another Polynomial Homomorphism. Acta Informatica 6, 153–169 (1976)
Ponder, C.: Parallel multiplication and powering of polynomials. J. Symbolic. Comp. 11(4), 307–320 (1991)
Probst, D., Alagar, V.: A Family of Algorithms for Powering Sparse Polynomials. SIAM J. Comput. 8(4), 626–644 (1979)
Monagan, M., Pearce, R.: Parallel Sparse Polynomial Multiplication Using Heaps. In: Proc. of ISSAC 2009, pp. 295–315. ACM Press (2009)
Monagan, M., Pearce, R.: Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol. 4770, pp. 295–315. Springer, Heidelberg (2007)
Monagan, M., Pearce, R.: Sparse Polynomial Division Using a Heap. J. Symbolic. Comp. 46(7), 807–922 (2011)
Monagan, M., Pearce, R.: Parallel Sparse Polynomial Division Using Heaps. In: Proc. of PASCO 2010, pp. 105–111. ACM Press (2010)
Rowan, W.: Efficient Polynomial Substitutions of a Sparse Argument. ACM Sigsam Bulletin 15(3), 17–23 (1981)
Zeilberger, D.: The J.C.P. Miller recurrence for exponentiating a polynomial, and its q-analog. J. Difference Eqns and Appls 1(1), 57–60 (1995), http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimPDF/power.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monagan, M., Pearce, R. (2012). Sparse Polynomial Powering Using Heaps. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2012. Lecture Notes in Computer Science, vol 7442. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32973-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-32973-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32972-2
Online ISBN: 978-3-642-32973-9
eBook Packages: Computer ScienceComputer Science (R0)