On the Virtues of Generic Programming for Symbolic Computation

  • Xin Li
  • Marc Moreno Maza
  • Éric Schost
Conference paper

DOI: 10.1007/978-3-540-72586-2_35

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4488)
Cite this paper as:
Li X., Maza M.M., Schost É. (2007) On the Virtues of Generic Programming for Symbolic Computation. In: Shi Y., van Albada G.D., Dongarra J., Sloot P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4488. Springer, Berlin, Heidelberg

Abstract

The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM high-level algorithms, such as polynomial factorization. More precisely, given a high-level AXIOMpackage P parametrized by a univariate polynomial domain U, we have compared the performances of P when applied to different U’s, including an AXIOM wrapper for our C level code.

Our experiments show that when P relies on U for its univariate polynomial computations, our specialized C level code can provide a significant speed-up. For instance, the improved implementation of square-free factorization in AXIOM is 7 times faster than the one in Maple and very close to the one in MAGMA. On the contrary, when P does not rely much on the operations of U and implements its private univariate polynomial operation, then P cannot benefit from our highly optimized C level code. Consequently, code which is poorly generic reduces the speed-up opportunities when applied to highly efficient and specialized

Keywords

Generic programming fast arithmetic efficient implementation high performance polynomials 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Xin Li
    • 1
  • Marc Moreno Maza
    • 1
  • Éric Schost
    • 1
  1. 1.University of Western Ontario, London N6A 1M8 

Personalised recommendations