Fast Parallel Algorithm for Polynomial Evaluation
From MaRDI portal
Recommendations
Cites work
- A note on the vectorization of scalar recursions
- A Simple Parallel Algorithm for Polynomial Evaluation
- Automated empirical optimizations of software and the ATLAS project
- High Degree Polynomial Interpolation in Newton Form
- scientific article; zbMATH DE number 1513001 (Why is no real title available?)
- On the numerical evaluation of linear recurrences
- On the parallel evaluation of a sparse polynomial at a point
- Optimal algorithms for parallel polynomial evaluation
- Review of general and Toeplitz vector bidiagonal solvers
Cited in
(8)- On the parallel evaluation of a sparse polynomial at a point
- Evaluating recursive filters on distributed memory parallel computers
- scientific article; zbMATH DE number 3932280 (Why is no real title available?)
- scientific article; zbMATH DE number 4056871 (Why is no real title available?)
- scientific article; zbMATH DE number 1113877 (Why is no real title available?)
- Parallel Algorithms to Evaluate Orthogonal Polynomial Series
- A Simple Parallel Algorithm for Polynomial Evaluation
- A fast parallel method for polynomial evaluation at points in arithmetic progressions
This page was built for publication: Fast Parallel Algorithm for Polynomial Evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820805)