A new upper bound on the complexity of derivative evaluation

DOI10.1016/0020-0190(74)90053-2zbMath0286.68031OpenAlexW1974830618MaRDI QIDQ1845616

H. T. Kung

Publication date: 1973

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

Full work available at URL: https://doi.org/10.1016/0020-0190(74)90053-2

Mathematics Subject Classification ID

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

Related Items (5)

A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity ⋮ Generalization of Taylor's theorem and Newton's method via a new family of determinantal interpolation formulas and its applications ⋮ On the arithmetic operational complexity for solving Vandermonde linear equations ⋮ A survey of techniques in applied computational complexity ⋮ Selection of good algorithms from a family of algorithms for polynomial derivative evaluation

Cites Work

• Unnamed Item
• On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its Derivatives
• New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences

This page was built for publication: A new upper bound on the complexity of derivative evaluation