Fast Parallel Algorithm for Polynomial Evaluation

DOI10.1080/10637190310001633673zbMath1069.68652OpenAlexW2050929134MaRDI QIDQ4820805

Przemysław Stpiczyński

Publication date: 1 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637190310001633673

zbMATH Keywords

Parallel AlgorithmsPolynomial EvaluationFirst-Order Linear Recurrence Systems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)

Uses Software

• LAPACK

Cites Work

• Unnamed Item
• Review of general and Toeplitz vector bidiagonal solvers
• On the parallel evaluation of a sparse polynomial at a point
• A note on the vectorization of scalar recursions
• On the numerical evaluation of linear recurrences
• Optimal algorithms for parallel polynomial evaluation
• High Degree Polynomial Interpolation in Newton Form
• A Simple Parallel Algorithm for Polynomial Evaluation
• Automated empirical optimizations of software and the ATLAS project

This page was built for publication: Fast Parallel Algorithm for Polynomial Evaluation