Abstract
We propose a parallel algorithm to perform the Newton interpolation in time on a newly proposed mesh-of-unshuffle network of
processors, where n + 1 is the number of given points. The algorithm is cost-optimal in the sense that number of processors times execution time is minimized. Besides, if
processors are used in the network, the problem can be solved faster in
time.