Parallel sparse polynomial multiplication on modern hardware architectures
From MaRDI portal
Recommendations
- Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems
- Parallel sparse polynomial multiplication using heaps
- A fast parallel sparse polynomial GCD algorithm
- scientific article; zbMATH DE number 1263395
- On the parallelization of subproduct tree techniques targeting many-core architectures
Cited in
(13)- Parallelization of triangular decompositions: techniques and implementation
- POLY: a new polynomial data structure for Maple 17
- On the parallelization of subproduct tree techniques targeting many-core architectures
- Parallel sparse polynomial multiplication using heaps
- Sparse polynomial powering using heaps
- BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
- Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
- Overcoming the memory wall in symbolic algebra
- Comparing the speed of programs for sparse polynomial multiplication
- Highly scalable multiplication for distributed sparse multivariate polynomials on many-core systems
- Complexity and performance results for non FFT-based univariate polynomial multiplication
- Sparse polynomial multiplication and division in Maple 14
- Sparse polynomials in FLINT
This page was built for publication: Parallel sparse polynomial multiplication on modern hardware architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244520)