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
Abstract(i) First we show that all the known algorithms for polynomial division can be represented a...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...
AbstractThis paper explains how computer algebra (Reduce) was used to analyse the expressions result...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
Computers use algorithms to evaluate polynomials. This paper will study the efficiency of various al...
We have previously presented a new one parameter family of algorithms and a program for evaluation t...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
In recent years a number of algorithms have been designed for the "inverse" computational ...
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation ...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation ...
AbstractCertain questions concerning the arithmetic complexity of univariate polynomial evaluation a...
AbstractWe give complexity estimates for the problems of evaluation and interpolation on various pol...
Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer scien...
Abstract(i) First we show that all the known algorithms for polynomial division can be represented a...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...
AbstractThis paper explains how computer algebra (Reduce) was used to analyse the expressions result...
The evaluation of several polynomial forms is considered. New algorithms for the evaluation of a pol...
Computers use algorithms to evaluate polynomials. This paper will study the efficiency of various al...
We have previously presented a new one parameter family of algorithms and a program for evaluation t...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
In recent years a number of algorithms have been designed for the "inverse" computational ...
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation ...
We review the complexity of polynomial and matrix computations, as well as their various correlation...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation ...
AbstractCertain questions concerning the arithmetic complexity of univariate polynomial evaluation a...
AbstractWe give complexity estimates for the problems of evaluation and interpolation on various pol...
Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer scien...
Abstract(i) First we show that all the known algorithms for polynomial division can be represented a...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...
AbstractThis paper explains how computer algebra (Reduce) was used to analyse the expressions result...