This paper describes a systolic algorithm for interpolation and evaluation of polynomials over any field using a linear array of processors. The periods of these algorithms are O(n) for interpolatin and O(1) for evaluation. This algorithm is readily adapted for Chinese remaindering, easily generalized for the multivariable interpolation and can be extended for rational interpolation to produce Pade approximants. The instruction systolic array implementation of the algorithm is presented here
The authors consider the problem of producing all the roots of a polynomial p(x)=a0xn+a1xn-1+. . .+a...
The problem of interpolating multivariate polynomials whose coefficient domain is the rational numbe...
Newton’s interpolation is a classical polynomial interpolation approach and plays a significant role...
This paper describes a systolic algorithm for interpolation and evaluation of polynomials over any f...
This paper describes a systolic algorithm for rational interpolation based on Thiele's reciprocal di...
Several time-optimal and spacetime-optimal systolic arrays are presented for computing a process dep...
We present parallel algorithms for the computation and evaluation of interpolating polynomials. The ...
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerica...
AbstractThis paper presents a parallel algorithm for polynomial interpolation implemented on a mesh ...
A new basis of interpolation points for the special case of the Newton two variable polynomial inter...
AbstractWe give an algorithm for the interpolation of a polynomial A given by a straight-line progra...
AbstractEight different algorithms for polynomial interpolation are compared with respect to stabili...
This paper describes a data parallel algorithm for the inversion of polynomial matrix using evaluati...
AbstractThe fastest known algorithms for the problems of polynomial evaluation and multipoint interp...
AbstractA new algorithm for sparse multivariate polynomial interpolation is presented. It is a multi...
The authors consider the problem of producing all the roots of a polynomial p(x)=a0xn+a1xn-1+. . .+a...
The problem of interpolating multivariate polynomials whose coefficient domain is the rational numbe...
Newton’s interpolation is a classical polynomial interpolation approach and plays a significant role...
This paper describes a systolic algorithm for interpolation and evaluation of polynomials over any f...
This paper describes a systolic algorithm for rational interpolation based on Thiele's reciprocal di...
Several time-optimal and spacetime-optimal systolic arrays are presented for computing a process dep...
We present parallel algorithms for the computation and evaluation of interpolating polynomials. The ...
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerica...
AbstractThis paper presents a parallel algorithm for polynomial interpolation implemented on a mesh ...
A new basis of interpolation points for the special case of the Newton two variable polynomial inter...
AbstractWe give an algorithm for the interpolation of a polynomial A given by a straight-line progra...
AbstractEight different algorithms for polynomial interpolation are compared with respect to stabili...
This paper describes a data parallel algorithm for the inversion of polynomial matrix using evaluati...
AbstractThe fastest known algorithms for the problems of polynomial evaluation and multipoint interp...
AbstractA new algorithm for sparse multivariate polynomial interpolation is presented. It is a multi...
The authors consider the problem of producing all the roots of a polynomial p(x)=a0xn+a1xn-1+. . .+a...
The problem of interpolating multivariate polynomials whose coefficient domain is the rational numbe...
Newton’s interpolation is a classical polynomial interpolation approach and plays a significant role...