Parallel Lagrange Interpolation on the Star Graph

Authors:
Affiliations:
Venue:
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Year:
2000

Citing 0
Cited 4

A parallel algorithm for Lagrange interpolation on the star graph

Journal of Parallel and Distributed Computing
Cost-efficient parallel programs based on set-distributions for polynomial interpolation

Journal of Parallel and Distributed Computing
A parallel algorithm for interpolation in pancake graph

SEPADS'07 Proceedings of the 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
A new parallel algorithm for lagrange interpolation on a hypercube

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a parallel algorithm for computing an N=n!-point Lagrange interpolation on an n-star (n2). It exploits several communication techniques on stars in a novel way, which can be adapted for computing similar functions. The algorithm is optimal and consists of three phases: initialization, main and final. While there is no computation in the initialization phase, the main phase is composed of n!/2 steps, each consisting of four multiplications, four subtractions and one communication operation, and an additional step including one division and one multiplication. The final phase is carried out in (n-1) sub-phases each with O(log n) steps where each step takes three communications and one addition.