A Simple Parallel Algorithm for Polynomial Evaluation
From MaRDI portal
Recommendations
Cited in
(24)- The parallel complexity of function approximation
- Parallelizable approximate solvers for recursions arising in preconditioning
- On the parallel evaluation of a sparse polynomial at a point
- Parallel evaluation of Chebyshev and trigonometric series
- Summing up function values in parallel: A complexity analysis
- scientific article; zbMATH DE number 3890599 (Why is no real title available?)
- scientific article; zbMATH DE number 3856402 (Why is no real title available?)
- scientific article; zbMATH DE number 3958731 (Why is no real title available?)
- scientific article; zbMATH DE number 4056871 (Why is no real title available?)
- scientific article; zbMATH DE number 69493 (Why is no real title available?)
- scientific article; zbMATH DE number 179269 (Why is no real title available?)
- A Direct Approach to the Parallel Evaluation of Rational Expressions with a Small Number of Processors
- scientific article; zbMATH DE number 1254017 (Why is no real title available?)
- scientific article; zbMATH DE number 1113877 (Why is no real title available?)
- Fast Parallel Algorithm for Polynomial Evaluation
- Parallel iteration methods
- A fast parallel method for polynomial evaluation at points in arithmetic progressions
- On the parallel evaluation of multivariate polynomials
- The actual complexity of parallel evaluation of low degree polynomials
- Polynomial estimation of the complexity of algorithms
- Stability of parallel algorithms to evaluate Chebyshev series
- Stability of parallel algorithms for polynomial evaluation
- A parallel algorithm for simple roots of polynomials
- Parallel algorithms for some algebraic operations on polynomial equations
This page was built for publication: A Simple Parallel Algorithm for Polynomial Evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870650)