Generalizations of Horner's Rule for Polynomial Evaluation
From MaRDI portal
Publication:5336721
DOI10.1147/rd.62.0239zbMath0128.37202OpenAlexW2221264131MaRDI QIDQ5336721
Publication date: 1962
Published in: IBM Journal of Research and Development (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1147/rd.62.0239
Related Items (10)
Some parallel methods for polynomial root-finding ⋮ Precise and fast computation of Fermi-Dirac integral of integer and half integer order by piecewise minimax rational approximation ⋮ A DIVIDE-AND-INNER PRODUCT PARALLEL ALGORITHM FOR POLYNOMIAL EVALUATION ⋮ PARALLEL POLYNOMIAL EVALUATION BY DECOUPLING ALGORITHM ⋮ Stability of parallel algorithms for polynomial evaluation ⋮ Multi-party updatable delegated private set intersection ⋮ Parallel evaluation of Chebyshev and trigonometric series ⋮ Speedup of linear stationary iteration processes in multiprocessor computers. I ⋮ Stability of parallel algorithms to evaluate Chebyshev series ⋮ Optimal algorithms for parallel polynomial evaluation
This page was built for publication: Generalizations of Horner's Rule for Polynomial Evaluation
