Next Article in Journal
Models for MADM with Single-Valued Neutrosophic 2-Tuple Linguistic Muirhead Mean Operators
Previous Article in Journal
Construction of Fair Dice Pairs
Previous Article in Special Issue
First Integrals of the May–Leonard Asymmetric System
Open AccessArticle

Algorithms and Data Structures for Sparse Polynomial Arithmetic

Department of Computer Science, University of Western Ontario, London, ON N6A 5B7, Canada
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(5), 441; https://doi.org/10.3390/math7050441
Received: 1 February 2019 / Revised: 11 May 2019 / Accepted: 12 May 2019 / Published: 17 May 2019
(This article belongs to the Special Issue Computer Algebra in Scientific Computing)
We provide a comprehensive presentation of algorithms, data structures, and implementation techniques for high-performance sparse multivariate polynomial arithmetic over the integers and rational numbers as implemented in the freely available Basic Polynomial Algebra Subprograms (BPAS) library. We report on an algorithm for sparse pseudo-division, based on the algorithms for division with remainder, multiplication, and addition, which are also examined herein. The pseudo-division and division with remainder operations are extended to multi-divisor pseudo-division and normal form algorithms, respectively, where the divisor set is assumed to form a triangular set. Our operations make use of two data structures for sparse distributed polynomials and sparse recursively viewed polynomials, with a keen focus on locality and memory usage for optimized performance on modern memory hierarchies. Experimentation shows that these new implementations compare favorably against competing implementations, performing between a factor of 3 better (for multiplication over the integers) to more than 4 orders of magnitude better (for pseudo-division with respect to a triangular set). View Full-Text
Keywords: sparse polynomials; polynomial arithmetic; normal form; pseudo-division; pseudo-remainder; sparse data structures sparse polynomials; polynomial arithmetic; normal form; pseudo-division; pseudo-remainder; sparse data structures
Show Figures

Figure 1

MDPI and ACS Style

Asadi, M.; Brandt, A.; Moir, R.H.C.; Moreno Maza, M. Algorithms and Data Structures for Sparse Polynomial Arithmetic. Mathematics 2019, 7, 441.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop