Evaluating Polynomials at Fixed Sets of Points

DOI10.1137/0204045zbMath0326.65027OpenAlexW2045706641MaRDI QIDQ4091364

Jeffrey D. Ullman, Kenneth Steiglitz, A. V. Aho

Publication date: 1975

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0204045

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05)

Related Items

Implementing the Tangent Graeffe Root Finding Method, Polynomial division and its computational complexity, Algebraic complexity of computing polynomial zeros, Sequential and parallel complexity of approximate evaluation of polynomial zeros, Symbolic treatment of geometric degeneracies, Polynomial evaluation and interpolation on special sets of points, On the complexity of algorithms for the translation of polynomials, On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms, Fast systematic encoding of multiplicity codes, Genus 2 point counting over prime fields, Matrix identities of the fast Fourier transform, On arithmetical algorithms over finite fields, Fast evaluation and interpolation at the Chebyshev sets of points, An efficient algorithm for multivariate Maclaurin-Newton transformation, Fast multidimensional Bernstein-Lagrange algorithms, Homotopy techniques for multiplication modulo triangular sets, Fast computation of special resultants, Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., On the complexities of multipoint evaluation and interpolation, Fast Hermite interpolation and evaluation over finite fields of characteristic two, Conformal mapping in linear time, Selection of good algorithms from a family of algorithms for polynomial derivative evaluation, A new approach to fast polynomial interpolation and multipoint evaluation, Nearly optimal computations with structured matrices, A Point Counting Algorithm Using Cohomology with Compact Support, Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros, On the complexity of skew arithmetic