On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
From MaRDI portal
Publication:3214408
DOI10.1145/321796.321810zbMath0271.68040OpenAlexW2088283884WikidataQ60198260 ScholiaQ60198260MaRDI QIDQ3214408
Publication date: 1974
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/On_the_number_of_multiplications_for_the_evaluation_of_a_polynomial_and_some_of_its_derivatives/6608003
Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05)
Related Items
On the cost of evaluating polynomials and their derivatives, A heuristic irreducibility test for univariate polynomials, Higher-order iteration functions for simultaneously approximating polynomial zeros, Fast methods for computing the values of the derivatives of a rational function, Fast modular transforms, A survey of techniques in applied computational complexity, Selection of good algorithms from a family of algorithms for polynomial derivative evaluation, On computation of a power series root with arbitrary degree of convergence, Error analysis of splitting algorithms for polynomials, Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain, Rounding error analysis of Horner's scheme, A new upper bound on the complexity of derivative evaluation, On a global descent method for polynomials
