Data parallel evaluation of univariate polynomials by the Knuth--Eve algorithm

DOI10.1016/S0167-8191(97)00096-3MaRDI QIDQ1127456zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 13 August 1998

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(97)00096-3

zbMATH Keywords

data parallelismKnuth-Eve algorithmNewton-Horner algorithmperformance measurementspolynomial evaluationprocessor arrayvector processor

Mathematics Subject Classification ID

Computer system organization (68M99) Distributed algorithms (68W15)

Recommendations

• Polynomial evaluation on superscalar architecture, applied to the elementary function \(e^x\)
• scientific article; zbMATH DE number 1254017
• scientific article; zbMATH DE number 3890599
• The actual complexity of parallel evaluation of low degree polynomials
• An efficient raster evaluation method for univariate polynomials

Cited in

(2)

• Aitken and Neville Inverse Interpolation Methods over Finite Fields
• Polynomial evaluation on superscalar architecture, applied to the elementary function \(e^x\)

This page was built for publication: Data parallel evaluation of univariate polynomials by the Knuth--Eve algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127456)