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.

• Type: Conference
• Year: 1997
• Where: PPSC
• Authors: Chenyi Hu
• Keywords: Data Measurement Errors, Interval Nodes, Interval Polynomial Interpolation, PPSC 1997, PPSC 2001