Optimal algorithms for parallel polynomial evaluation

DOI10.1016/S0022-0000(73)80043-1zbMath0256.68013OpenAlexW1995782589WikidataQ107417322 ScholiaQ107417322MaRDI QIDQ2559140

J. Ian Munro, Michael S. Paterson

Publication date: 1973

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(73)80043-1

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Related Items

A chained-matrices approach for parallel computation of continued fractions and its applications ⋮ A DIVIDE-AND-INNER PRODUCT PARALLEL ALGORITHM FOR POLYNOMIAL EVALUATION ⋮ PARALLEL POLYNOMIAL EVALUATION BY DECOUPLING ALGORITHM ⋮ Fast Parallel Algorithm for Polynomial Evaluation ⋮ On the Parallel Evaluation of Dwba Integrals ⋮ Minimal parallelism for associative computations under time constraints ⋮ A parallel method for fast and practical high-order Newton interpolation ⋮ Parallel evaluation of Chebyshev and trigonometric series ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO ⋮ New algorithms for polynomial and trigonometric interpolation on parallel computers ⋮ Limited width parallel prefix circuits ⋮ A survey of techniques in applied computational complexity ⋮ Stability of parallel algorithms to evaluate Chebyshev series ⋮ Berechnungen in partiellen Algebren endlichen Typs ⋮ Computing (and Life) Is All about Tradeoffs

Cites Work

• Generalizations of Horner's Rule for Polynomial Evaluation
• ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS
• Unnamed Item
• Unnamed Item