The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a polynomial and its derivative, a polynomial at two points, a polynomial of high degree using multiple precision arithmetic, and a bivariate polynomial of the form Σa(i) xiyn−i are presented. Various “coefficient splitting techniques” are introduced in these algorithms and the optimality of certain techniques is shown
This paper presents new algorithms for the parallel evaluation of certain polynomial expres-sions. I...
Computers use algorithms to evaluate polynomials. This paper will study the efficiency of various al...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
We have previously presented a new one parameter family of algorithms and a program for evaluation t...
AbstractThe fastest known algorithms for the problems of polynomial evaluation and multipoint interp...
AbstractThe evaluation of multivariate polynomials of n variables in Bernstein–Bézier form is consid...
Abstract. We present a unified framework for most of the known and a few new evaluation algorithms f...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
AbstractThis paper concerns the fast numerical factorization of degree a + b polynomials in a neighb...
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation ...
A new algorithm for splitting polynomials is presented. This algorithm requires O(d log 1 ) 1+Æ floa...
A new basis of interpolation points for the special case of the Newton two variable polynomial inter...
Analysis of a family of algorithms for the evaluation of a polynomial and some of its derivative
This paper presents new algorithms for the parallel evaluation of certain polynomial expres-sions. I...
Computers use algorithms to evaluate polynomials. This paper will study the efficiency of various al...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
We have previously presented a new one parameter family of algorithms and a program for evaluation t...
AbstractThe fastest known algorithms for the problems of polynomial evaluation and multipoint interp...
AbstractThe evaluation of multivariate polynomials of n variables in Bernstein–Bézier form is consid...
Abstract. We present a unified framework for most of the known and a few new evaluation algorithms f...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
International audienceThe evaluation of a polynomial at several points is called the problem of mult...
AbstractThis paper concerns the fast numerical factorization of degree a + b polynomials in a neighb...
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation ...
A new algorithm for splitting polynomials is presented. This algorithm requires O(d log 1 ) 1+Æ floa...
A new basis of interpolation points for the special case of the Newton two variable polynomial inter...
Analysis of a family of algorithms for the evaluation of a polynomial and some of its derivative
This paper presents new algorithms for the parallel evaluation of certain polynomial expres-sions. I...
Computers use algorithms to evaluate polynomials. This paper will study the efficiency of various al...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...