Computing values of a polynomial with only few multiplications

DOI10.1016/0020-0190(94)90051-5MaRDI QIDQ1313709zbMATH OpenOpenAlexWikidataFDO

Authors Darko Veljan

Publication date 24 February 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)90051-5

zbMATH Keywords

polynomialStirling numbers

Mathematics Subject Classification ID

Computational number theory (11Y99) Symbolic computation and algebraic computation (68W30)

Review text

It is shown that the values of a polynomial can be computed with very few multiplications, if one has a database of Stirling numbers.

Recommendations

• Computing polynomials with few multiplications
• The computation of multiple roots of a polynomial
• Numerical computation of the least common multiple of a set of polynomials
• scientific article; zbMATH DE number 4080740
• scientific article; zbMATH DE number 2143198
• Computing sparse multiples of polynomials
• Computing sparse multiples of polynomials
• Computers and the Multiplicity of Polynomial Roots
• Computing the measure of a polynomial
• Computing multiple roots of inexact polynomials

This page was built for publication: Computing values of a polynomial with only few multiplications

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