On the choice of a multiplication algorithm for polynomials and polynomial matrices

DOI10.1007/S10958-010-9992-ZMaRDI QIDQ2452938zbMATH OpenOpenAlexFDO

Authors G. I. Malashonok, Yu. D. Valeev, A. O. Lapaev

Publication date 6 June 2014

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-010-9992-z

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Symbolic computation and algebraic computation (68W30)

Recommendations

• Fast multiplication and sparse structures
• On the bit-complexity of sparse polynomial and series multiplication
• Parallel multiplication and powering of polynomials
• On fast multiplication of polynomials over arbitrary algebras
• On short multiplications and divisions

Cites work

• Fast multiplication and sparse structures
• Gaussian elimination is not optimal
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• Introduction to algorithms.

Cited in

(8)

• On fast multiplication of polynomials over arbitrary algebras
• On the bit-complexity of sparse polynomial and series multiplication
• Polynomial modular product verification and its implications
• scientific article; zbMATH DE number 3866580 (Why is no real title available?)
• Comparing the speed of programs for sparse polynomial multiplication
• Chunky and equal-spaced polynomial multiplication
• scientific article; zbMATH DE number 5026599 (Why is no real title available?)
• Parallel multiplication and powering of polynomials

This page was built for publication: On the choice of a multiplication algorithm for polynomials and polynomial matrices

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