CUMODP is a CUDA library for exact computations with dense polynomials over finite fields. A variety of operations like multiplication, division, computation of subresultants, multi-point evaluation,â€¦ (More)

With the advent of hardware accelerator technologies, multi-core processors and GPUs, much effort for taking advantage of those architectures by designing parallel algorithms has been made. Toâ€¦ (More)

The Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations (multiplication, division, root isolation, etc.) for univariate and multivariate polynomials over common types ofâ€¦ (More)

2016 18th International Symposium on Symbolic andâ€¦

2016

We propose a new algorithm for multiplying densepolynomials with integer coefficients in a parallel fashion, targetingmulti-core processor architectures. Complexity estimates andexperimentalâ€¦ (More)

The multiplication of polynomials is a primitive widely used in computer algebra. It appears to contribute to a large panel of mathematical functions. Consequently, the optimization of this primitiveâ€¦ (More)

We propose parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques and targeting many-core GPUs. On thoseâ€¦ (More)

The CUDA Modular Polynomial (CUMODP) Library implements arithmetic operations for dense matrices and dense polynomials, primarily with modular integer coefficients. Some operations are available forâ€¦ (More)

The Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations (multiplication, division, root isolation, etc.) for univariate and multivariate polynomials over prime fields or withâ€¦ (More)