I've been quite out of free time lately. Looking for a written algorithm (in any language, i'll translate) is not that easy.
What i'm looking for is:
- given a set of points in the Euclidian plane: Pn={x;y}
- find a suitable function y=f(x) so that if i input {Pn;x} the function return an interpolated y (and y is a real).
That means, a 1D continuous function.
I'm looking for the Bernstein method for this, as it seems to produce more precise polynoms than Lagrange method, and which are less prone to the 'wavelet syndrome'.
|