Fast parallel algorithm for polynomial interpolation

This paper presents a parallel algorithm for polynomial interpolation implemented on a mesh of trees. The algorithm is based on the Lagrangeʹs interpolation formula. It requires O(log n) time using n2 processors where n is the number of input data points at which the values of the function will be specified. We have also shown how the algorithm can be extended to the case when only p2 processors (p < n) will be available. The algorithm mapped on p2 processors has a time complexity of O((n2/p2) log n).