2014 | OriginalPaper | Chapter
The Basic Polynomial Algebra Subprograms
Authors : Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Marc Moreno Maza, Ning Xie, Yuzhen Xie
Published in: Mathematical Software – ICMS 2014
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The Basic Polynomial Algebra Subprograms (
BPAS
) provides arithmetic operations (multiplication, division, root isolation, etc.) for univariate and multivariate polynomials over prime fields or with integer coefficients. 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. One of the purposes of the
BPAS
project is to take advantage of hardware accelerators in the development of polynomial systems solvers. The
BPAS
library is publicly available in source at
www.bpaslib.org
.