Parallel sparse polynomial multiplication on modern hardware architectures

DOI10.1145/2442829.2442845zbMath1308.68159OpenAlexW2052401366MaRDI QIDQ5244520

F. Biscani

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2442829.2442845

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Symbolic computation and algebraic computation (68W30) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (1)

Parallelization of triangular decompositions: techniques and implementation

Uses Software

• gmp
• Magma
• TRIP
• Xcas
• Audi

This page was built for publication: Parallel sparse polynomial multiplication on modern hardware architectures