POLY: a new polynomial data structure for Maple 17

DOI10.1007/978-3-662-43799-5_24MaRDI QIDQ2799569zbMATH OpenOpenAlexFDO

Authors Roman Pearce, Michael Monagan

Publication date 12 April 2016

Published in Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43799-5_24

Mathematics Subject Classification ID

Data structures (68P05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Sparse polynomial multiplication and division in Maple 14
• The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
• scientific article; zbMATH DE number 1254037
• The basic polynomial algebra subprograms
• Parallel sparse polynomial multiplication on modern hardware architectures

Cites work

• Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries
• Sparse polynomial division using a heap

Cited in

(8)

• The geobucket data structure for polynomials
• The complexity of sparse Hensel lifting and sparse polynomial factorization
• POLY
• Using sparse interpolation in Hensel lifting
• scientific article; zbMATH DE number 5608928 (Why is no real title available?)
• Sparse polynomial multiplication and division in Maple 14
• The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
• The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}

Describes a project that uses

Uses Software

• Magma
• ALTRAN
• gmp
• Maple
• Maxima
• SINGULAR
• Macaulay2
• SageMath
• TRIP

This page was built for publication: POLY: a new polynomial data structure for Maple 17

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799569)