ISSN:
1573-1340
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract In many practical problems, we need to use interpolation: we know that the value of a quantity is uniquely determined by some other quantity x (i.e., y = f(x)), we have measured several pairs of values (xi, yi), and we want to predict y for a given x. We can only guarantee estimates for y if we have some a priori information about the function f(x). In particular, in some problems, we know that f(x) is a polynomial of known degree d (e.g., that it is linear, or that it is quadratic). For this polynomial interpolation, with interval uncertainty of the input data (xi, yi), we present several reasonable algorithms that compute, for a given x0, guaranteed bounds for f(x0).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1009946531786
Permalink