A Fast Parallel Horner Algorithm

DOI10.1137/0219008zbMath0696.68055OpenAlexW2080123488MaRDI QIDQ3474278

Michael L. Dowling

Publication date: 1990

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

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

zbMATH Keywords

complexityparallel polynomial evaluation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05) Software, source code, etc. for problems pertaining to numerical analysis (65-04)

Related Items (3)

Multiplication-free evaluation of polynomials via a stochastic Bernstein representation ⋮ Decomposition implementation of Horner's scheme for calculating the values of multidimentional polynomials ⋮ New algorithms for polynomial and trigonometric interpolation on parallel computers

This page was built for publication: A Fast Parallel Horner Algorithm