Quote:
Originally posted by gmat
That's what i'm doing right now, a small app that will allow anyone to put a XML file and see the interpolated results on a graphical chart.
Currently i have implemented two polynomial interpolation methods, that seem to produce very similar polynoms, with differences in the order of 1.10^-16. I think the choice will be made on performance as the algorithms involved are totally different (Lagrange and Neville).
|
Not sure what you mean by such tiny differences.
What are the R-squared values, and how many points are you interpolating from?
Alchemy