Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries

DOI10.1007/11758525_60MaRDI QIDQ3545109zbMATH OpenOpenAlexFDO

Authors Mickaël Gastineau, Jacques Laskar

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758525_60

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Comparing the speed of programs for sparse polynomial multiplication
• Parallel sparse polynomial multiplication on modern hardware architectures
• scientific article; zbMATH DE number 3866580
• Sparse polynomial multiplication and division in Maple 14
• Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems

Cited in

(3)

• TRIP
• Sparse polynomials in FLINT
• Sparse polynomial division using a heap

Describes a project that uses

Uses Software

• SINGULAR
• PSPCLink

This page was built for publication: Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries

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