Parallel multiplication and powering of polynomials

DOI10.1016/S0747-7171(08)80108-3MaRDI QIDQ808710zbMATH OpenFDO

Authors Carl G. Ponder

Publication date 1991

Published in Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmssparse polynomialsalgebraic manipulationdense polynomialsshared-memory multiprocessing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• On fast multiplication of polynomials over arbitrary algebras
• Parallel Algorithms for Algebraic Problems
• Sparse polynomial powering using heaps
• On the choice of a multiplication algorithm for polynomials and polynomial matrices
• Parallel algorithms for some algebraic operations on polynomial equations

Cites work

• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 3709574 (Why is no real title available?)
• scientific article; zbMATH DE number 3709576 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• A Family of Algorithms for Powering Sparse Polynomials
• On Computing the Discrete Fourier Transform
• On the Computation of Powers of Sparse Polynomials
• Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments
• Sorting X + Y

Cited in

(15)

• scientific article; zbMATH DE number 1830915 (Why is no real title available?)
• Parallel sparse polynomial multiplication using heaps
• Obtuse matrix of arithmetic table
• Complexity and performance results for non FFT-based univariate polynomial multiplication
• Code Generation for Polynomial Multiplication
• scientific article; zbMATH DE number 3866580 (Why is no real title available?)
• Representations and Parallel Computations for Rational Functions
• scientific article; zbMATH DE number 179269 (Why is no real title available?)
• Sparse polynomial powering using heaps
• On the choice of a multiplication algorithm for polynomials and polynomial matrices
• On the bit-complexity of sparse polynomial and series multiplication
• BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
• scientific article; zbMATH DE number 3856402 (Why is no real title available?)
• Implementation of some algorithms for accelerating computer calculations
• Chunky and equal-spaced polynomial multiplication

This page was built for publication: Parallel multiplication and powering of polynomials

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