Lagrange interpolation (dup): Difference between revisions
From JSXGraph Wiki
A WASSERMANN (talk | contribs) No edit summary |
A WASSERMANN (talk | contribs) No edit summary |
||
Line 43: | Line 43: | ||
</script> | </script> | ||
</html> | </html> | ||
=== References === | |||
* [http://en.wikipedia.org/wiki/Lagrange_polynomial] | |||
=== The underlying JavaaScript code === | |||
<source lang="javascript"> | <source lang="javascript"> | ||
board = JXG.JSXGraph.initBoard('box', {originX: 250, originY: 250, unitX: 50, unitY: 25}); | board = JXG.JSXGraph.initBoard('box', {originX: 250, originY: 250, unitX: 50, unitY: 25}); |
Revision as of 12:25, 15 December 2008
Constructs a polynomial of degree n through n+1 given points. Points can be added by clicking on "Add point".
References
The underlying JavaaScript code
board = JXG.JSXGraph.initBoard('box', {originX: 250, originY: 250, unitX: 50, unitY: 25});
// Axes
b1axisx = board.createElement('axis', [[0,0], [1,0]], {});
b1axisy = board.createElement('axis', [[0,0], [0,1]], {});
var p = [];
p[0] = board.createElement('point', [-1,2], {style:6});
p[1] = board.createElement('point', [3,-1], {style:6});
var polynomial = function(x) {
var i;
var y = 0.0;
var xc = [];
for (i=0;i<p.length;i++) {
xc[i] = p[i].X();
}
for (i=0;i<p.length;i++) {
var t = p[i].Y();
for (var k=0;k<p.length;k++) {
if (k!=i) {
t *= (x-xc[k])/(xc[i]-xc[k]);
}
}
y += t;
}
return y;
};
graph = board.createElement('curve', ['x', polynomial, 'x', -10, 10], {curveType:'graph'});
function addPoint() {
p.push(board.createElement('point',[(Math.random()-0.5)*10,(Math.random()-0.5)*3],{style:6}));
board.update();
}