Evaluating polynomials at many points

DOI10.1016/0020-0190(71)90009-3zbMath0226.65036OpenAlexW2019875151MaRDI QIDQ2549230

Allan Borodin, J. Ian Munro

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1016/0020-0190(71)90009-3

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Computer aspects of numerical algorithms (65Y99)

Related Items (4)

An algebraic approach to approximate evaluation of a polynomial on a set of real points ⋮ A fast method for interpolation using preconditioning ⋮ Fast modular transforms ⋮ Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten

Cites Work

• Gaussian elimination is not optimal
• On the number of multiplications necessary to compute certain functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Evaluating polynomials at many points