Skip to main content
SpringerLink
Log in

Code Generation for Polynomial Multiplication

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5743))

Included in the following conference series:

  • 1076 Accesses

Abstract

We discuss the family of “divide-and-conquer” algorithms for polynomial multiplication, that generalize Karatsuba’s algorithm. We give explicit versions of transposed and short products for this family of algorithms and describe code generation techniques that result in high-performance implementations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bodrato, M., Zanoni, A.: Integer and polynomial multiplication: towards optimal Toom-Cook matrices. In: ISSAC 2007, pp. 17–24. ACM, New York (2007)

    Google Scholar 

  2. Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3-4), 235–265 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bostan, A., Lecerf, G., Schost, É.: Tellegen’s principle into practice. In: ISSAC 2003, pp. 37–44. ACM, New York (2003)

    Google Scholar 

  4. Brent, R.P., Kung, H.T.: Fast algorithms for manipulating formal power series. J. ACM 25(4), 581–595 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic complexity theory. Grund. Math. Wissen, vol. 315. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  6. Cantor, D.G., Kaltofen, E.: On fast multiplication of polynomials over arbitrary algebras. Acta Informatica 28(7), 693–701 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cooley, J., Tukey, J.: An algorithm for the machine calculation of complex Fourier series. Mathematics of computation 19 (1965)

    Google Scholar 

  8. Gaudry, P., Thomé, E.: The mpFq library and implementing curve-based key exchanges. In: SPEED, pp. 49–64 (2007)

    Google Scholar 

  9. Hanrot, G., Quercia, M., Zimmermann, P.: The middle product algorithm. I. Appl. Algebra Engrg. Comm. Comput. 14(6), 415–438 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hanrot, G., Zimmermann, P.: A long note on Mulders’ short product. J. Symb. Comput. 37(3), 391–401 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Math. Dokl. 7, 595–596 (1963)

    Google Scholar 

  12. Monagan, M., Pearce, R.: Parallel sparse polynomial multiplication using heaps. In: ISSAC 2009. ACM, New York (to appear, 2009)

    Google Scholar 

  13. Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation 44(170), 519–521 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mulders, T.: On short multiplications and divisions. Appl. Algebra Engrg. Comm. Comput. 11(1), 69–88 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Schönhage, A., Strassen, V.: Schnelle Multiplikation großer Zahlen. Computing 7, 281–292 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  16. Shoup, V.: A library for doing number theory, http://www.shoup.net/ntl/

  17. Shoup, V.: A new polynomial factorization algorithm and its implementation. J. Symb. Comp. 20(4), 363–397 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Toom, A.: The complexity of a scheme of functional elements realizing the multiplication of integers. Doklady Akad. Nauk USSR 150(3), 496–498 (1963)

    MATH  Google Scholar 

  19. van der Hoeven, J.: Relax, but don’t be too lazy. J. Symbolic Comput. 34(6), 479–542 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  20. von zur Gathen, J., Gerhard, J.: Modern computer algebra, 2nd edn. Cambridge University Press, Cambridge (2003)

    MATH  Google Scholar 

  21. Winograd, S.: Arithmetic complexity of computations. In: CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 33. SIAM, Philadelphia (1980)

    Google Scholar 

  22. Zimmermann, P.: Irred-ntl patch, http://www.loria.fr/~zimmerma/irred/

Download references

Author information

Authors and Affiliations

  1. ORCCA, Computer Science Department, The University of Western Ontario, London, Ontario, Canada

    Ling Ding & Éric Schost

Authors
  1. Ling Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Éric Schost
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Joint Institute for Nuclear Research, Laboratory of Information Technologies, Dubna, Russia

    Vladimir P. Gerdt

  2. Technische Universität München‘, Institut für Informatik, Garching, Germany

    Ernst W. Mayr

  3. Institute of Theoretical and Applied Mechanics, Russian Academy of Sciences, Novosibirsk, Russia

    Evgenii V. Vorozhtsov

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ding, L., Schost, É. (2009). Code Generation for Polynomial Multiplication. In: Gerdt, V.P., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2009. Lecture Notes in Computer Science, vol 5743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04103-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04103-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04102-0

  • Online ISBN: 978-3-642-04103-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation