Architecture-aware classical Taylor shift by 1

DOI10.1145/1073884.1073913MaRDI QIDQ5262764zbMATHOpenAlexFDO

Authors Jeremy R. Johnson, Werner Krandick, A. D. Ruslanov

Publication date 16 July 2015

Published in Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

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

zbMATH Keywords

loop unrollingpolynomialshigh-performance computingmemory hierarchycode generationperformance tuningmultiprecision arithmeticTaylor shiftdelayed carry propagationILP schedulingregister tiling

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1254031
• scientific article; zbMATH DE number 3856407
• Fast multiplication and its applications
• On fast multiplication of polynomials over arbitrary algebras
• Design, analysis, and implementation of a multiprecision polynomial rootfinder

Cited in

(3)

• On the computing time of the continued fractions method
• Logcf: an efficient tool for real root isolation
• Fast arithmetic for triangular sets: from theory to practice

This page was built for publication: Architecture-aware classical Taylor shift by 1

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