Efficient evaluation of large polynomials

DOI10.1007/978-3-642-15582-6_55MaRDI QIDQ5747902zbMATH OpenOpenAlexFDO

Authors Charles E. Leiserson, Liyun Li, Marc Moreno Maza, Yuzhen Xie

Publication date 14 September 2010

Published in Mathematical Software – ICMS 2010 (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/90262

zbMATH Keywords

Cilk++code optimizationmultivariate polynomial evaluation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• Amortized multi-point evaluation of multivariate polynomials
• Algorithms – ESA 2004
• On the parallel evaluation of multivariate polynomials
• scientific article; zbMATH DE number 850292
• On the evaluation of some sparse polynomials

Cited in

(11)

• Dense polynomial multiplication with reduced array manipulation overhead
• Amortized multi-point evaluation of multivariate polynomials
• Memory-optimal evaluation of expression trees involving large objects
• Code optimization in FORM
• Improving multivariate Horner schemes with Monte Carlo tree search
• Potential of FORM 4.0
• Algorithms – ESA 2004
• Efficient Evaluation of Low Degree Multivariate Polynomials in Ring-LWE Homomorphic Encryption Schemes
• Runtime repeated recursion unfolding in CHR: a just-in-time online program optimization strategy that can achieve super-linear speedup
• Algorithms for accurate, validated and fast polynomial evaluation
• Evaluation of high degree polynomials

This page was built for publication: Efficient evaluation of large polynomials

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