A Parallel Algorithm for Interval Polynomial Interpolation

By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinations of interval nodes are used. The high computational complexity makes it necessary to perform the computation parallelly. In this paper, we report a parallel algorithm which effectively perform the combinatorical computation. A brief introduction of interval polynomial interpolation is reviewed in section 1. Currently used sequential algorithms are reported in section 2. A parallel algorithm with discussions on computation decomposition, mapping, and load balancing is presented in section 3. A numerical example is presented in section 4. We conclude this paper with section 5.