scientific article; zbMATH DE number 1254031

MaRDI QIDQ4227014zbMATHFDO

Authors Eugene Zima

Publication date 6 July 1999

zbMATH Keywords

complexityparallel computationpolynomial representationmultivariate polynomialsSIMD architecturepolynomial shifttables of finite differences

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Parallel multiplication and powering of polynomials
• On fast multiplication of polynomials over arbitrary algebras
• Very Fast Parallel Polynomial Arithmetic
• scientific article; zbMATH DE number 69493

Cited in

(2)

• Architecture-aware classical Taylor shift by 1
• scientific article; zbMATH DE number 5263329 (Why is no real title available?)

This page was built for publication:

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