Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmetic processors are presented. It is shown that, provided the degree of the polynomial to be evaluated exceeds k[log2k], an algorithm given is within one time unit of optimality
In this thesis, an optimized polynomial evaluation algorithm is presented. Compared to Horner's Rule...
Abstract ⎯ In this paper, we present a novel cubic-polynomial evaluation algorithm. It is suitable f...
We have previously presented a new one parameter family of algorithms and a program for evaluation t...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...
This paper presents new algorithms for the parallel evaluation of certain polynomial expres-sions. I...
In some applications polynomials should be evaluated, e.g., polynomial approximation of elementary f...
In some applications polynomials should be evaluated, e.g., polynomial approximation of elementary f...
In some applications polynomials should be evaluated, e.g., polynomial approximation of elementary f...
ABSTR&CT. The parallel evaluation of rational expressions i considered. New algorithms which min...
AbstractThe application of the recent techniques of the design of algebraic algorithms to the sequen...
Parallel evaluation of polynomials : a case study in transformational programming. - In: Economic pa...
Parallel evaluation of polynomials : a case study in transformational programming. - In: Economic pa...
International audienceWe propose an effi cient hardware-oriented method for evaluating complex polyn...
The evaluation of small degree polynomials is critical for the computation of elementary functions. ...
In this thesis, an optimized polynomial evaluation algorithm is presented. Compared to Horner's Rule...
In this thesis, an optimized polynomial evaluation algorithm is presented. Compared to Horner's Rule...
Abstract ⎯ In this paper, we present a novel cubic-polynomial evaluation algorithm. It is suitable f...
We have previously presented a new one parameter family of algorithms and a program for evaluation t...
Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmeti...
This paper presents new algorithms for the parallel evaluation of certain polynomial expres-sions. I...
In some applications polynomials should be evaluated, e.g., polynomial approximation of elementary f...
In some applications polynomials should be evaluated, e.g., polynomial approximation of elementary f...
In some applications polynomials should be evaluated, e.g., polynomial approximation of elementary f...
ABSTR&CT. The parallel evaluation of rational expressions i considered. New algorithms which min...
AbstractThe application of the recent techniques of the design of algebraic algorithms to the sequen...
Parallel evaluation of polynomials : a case study in transformational programming. - In: Economic pa...
Parallel evaluation of polynomials : a case study in transformational programming. - In: Economic pa...
International audienceWe propose an effi cient hardware-oriented method for evaluating complex polyn...
The evaluation of small degree polynomials is critical for the computation of elementary functions. ...
In this thesis, an optimized polynomial evaluation algorithm is presented. Compared to Horner's Rule...
In this thesis, an optimized polynomial evaluation algorithm is presented. Compared to Horner's Rule...
Abstract ⎯ In this paper, we present a novel cubic-polynomial evaluation algorithm. It is suitable f...
We have previously presented a new one parameter family of algorithms and a program for evaluation t...
DOI
Add to ORKG