Fast parallel multi-point evaluation of sparse polynomials

DOI10.1145/3096730.3096732MaRDI QIDQ4630096zbMATH OpenOpenAlexFDO

Authors Alan Wong, Michael Monagan

Publication date 29 March 2019

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Symbolic computation and algebraic computation (68W30)

Recommendations

• On the evaluation of some sparse polynomials
• On the parallel evaluation of a sparse polynomial at a point
• Algorithms – ESA 2004
• Computing sparse multiples of polynomials
• Computing sparse multiples of polynomials

Cited in

(8)

• A fast parallel sparse polynomial GCD algorithm
• Fast memory efficient evaluation of spherical polynomials at scattered points
• scientific article; zbMATH DE number 5872171 (Why is no real title available?)
• scientific article; zbMATH DE number 1254017 (Why is no real title available?)
• Sparse Evaluation of Compositions of Functions Using Multiscale Expansions
• On the evaluation of some sparse polynomials
• Algorithms – ESA 2004
• Parallel evaluation of sparse polynomials; based on Estrin's algorithm: conception and analysis of schedulings

This page was built for publication: Fast parallel multi-point evaluation of sparse polynomials

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