The Basic Polynomial Algebra Subprograms

Changbo Chen (1) , Svyatoslav Covanov (2) , Farnam Mansouri (3) , Robert H. C. Moir (1) , Marc Moreno Maza (1) , Ning Xie (1) , Yuzhen Xie (1)

1 ORCCA - Ontario Research Center for Computer Algebra
2 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
3 Microsoft [Vancouver]

The Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations (multiplication, division, root isolation, etc.) for univariate and multivariate polynomials over common types of coefficients (prime fields, complex rational numbers, rational functions, etc.). The code is mainly written in CilkPlus [10] targeting multicore processors. The current distribution focuses on dense polynomials and the sparse case is work in progress. A strong emphasis is put on adaptive algorithms as the library aims at supporting a wide variety of situations in terms of problem sizes and available computing resources. The BPAS library is publicly available in source at www.bpaslib.org.

Domaines: Calcul formel [cs.SC]

Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Robert H. C. Moir, Marc Moreno Maza, et al.. The Basic Polynomial Algebra Subprograms. ACM Communications in Computer Algebra, 2016, 50 (3), pp.97--100. ⟨10.1145/3015306.3015312⟩. ⟨hal-01404718⟩