On the parallel evaluation of a sparse polynomial at a point

DOI10.1023/A:1019116203957zbMath0936.65017OpenAlexW430154137MaRDI QIDQ1805905

Dario Andrea Bini, Giuseppe Fiorentino

Publication date: 3 May 2000

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019116203957

zbMATH Keywords

algorithmnumerical stabilityparallel computationspolynomial evaluationsparse polynomialsRuffini-Horner rule

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05) Real polynomials: analytic properties, etc. (26C05)

Related Items

Fast Parallel Algorithm for Polynomial Evaluation, Finding polynomial roots by dynamical systems -- a case study

Uses Software

• na10