Greedy algorithms for optimizing multivariate Horner schemes
ACM SIGSAM Bulletin
Evaluation algorithms for multivariate polynomials in Bernstein--Bézier form
Journal of Approximation Theory
Parallel computation of the minimal elements of a poset
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
Efficient evaluation of large polynomials
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis
Advances in Computational Mathematics
Hi-index | 0.00 |
We present an efficient version of the Horner scheme for the evaluation of multivariate polynomials and study its stability properties. In particular, we show that the backward error of evaluation is bounded by a quantity that is linear in the total degree of the polynomial, which itself is usually significantly smaller than the number of operations involved in the evaluation process. Moreover, we show that the same type of estimates holds also for the forward error, provided that the polynomial basis is chosen suitably.