Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

PPSC
1997

favoriteEmaildiscussreport

75views Distributed And Parallel Com...» more PPSC 1997»

A Parallel Algorithm for Interval Polynomial Interpolation

13 years 5 months ago

A Parallel Algorithm for Interval Polynomial Interpolation

Download www.cs.uca.edu

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 eﬀectively perform the combinatorical computation.

Chenyi Hu

Real-time Traffic

Data Measurement Errors | Interval Nodes | Interval Polynomial Interpolation | PPSC 1997 | PPSC 2001 |

claim paper

Related Content

» Parallel sparse polynomial interpolation over finite fields

» Modular Resultant Algorithm for Graphics Processors

» An FPGA Interpolation Processor for SoftDecision ReedSolomon Decoding

» Color filter array interpolation based on spatial adaptivity

» Computing modular polynomials in quasilinear time

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1997
Where	PPSC
Authors	Chenyi Hu

Comments (0)