A new parallel algorithm for lagrange interpolation on a hypercube

Authors:
C. P. Katti;R. Kumari
Affiliations:
-;-
Venue:
Computers & Mathematics with Applications
Year:
2006

Citing 6
Cited 0

Threshold pivoting for dense LU factorization on distributed memory multiprocessors

Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Lagrange interpolation on a processor tree with ring connections

Journal of Parallel and Distributed Computing
A parallel algorithm for Lagrange interpolation on the star graph

Journal of Parallel and Distributed Computing
A Parallel Algorithm for Lagrange Interpolation on k-ary n-Cubes

ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
An Efficient Parallel Algorithm for Lagrange Interpolation and its Performance

HPC '00 Proceedings of the The Fourth International Conference on High-Performance Computing in the Asia-Pacific Region-Volume 2 - Volume 2
Parallel Lagrange Interpolation on the Star Graph

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing

Quantified Score

Hi-index	0.09

Visualization

Abstract

We present a new parallel algorithm for computing N point lagrange interpolation on an n-dimensional hypercube with total number of nodes p = 2^n. Initially, we consider the case when N = p. The algorithm is extended to the case when only p (p fixed) processors are available, p