Difference between revisions of "Lagrange Interpolation Formula"
(Added proof) |
m (typo) |
||
Line 52: | Line 52: | ||
<center> | <center> | ||
<math> | <math> | ||
− | + | f(x) = \sum_{i=0}^{n}y_i \frac{(x-x_0) \cdots (x-x_{i-1}) (x-x_{i+1}) \cdots (x-x_n)}{(x_i-x_0) \cdots (x_i-x_{i-1}) (x_i - x_{i+1}) \cdots (x_i - x_n)} | |
</math>. | </math>. | ||
</center> | </center> | ||
− | |||
== Trivia == | == Trivia == |
Latest revision as of 02:50, 20 November 2023
Definition
The Lagrange Interpolation Formula states that For any distinct complex numbers and any complex numbers , there exists a unique polynomial of degree less than or equal to such that for all integers , , and this polynomial is
.
This formula is useful for many olympiad problems, especially since such a polynomial is unique.
Proof
Consider an th-degree polynomial of the given form
.
Substituting into the given equation yields us
,
Thus
.
Again, substituting yields us
,
Thus
.
Repeating this process, by substituting in we get the Lagrange Interpolation Formula as:
.
Trivia
While this formula may appear intimidating, it's actually not so difficult to see what is going on: for each term in the sum, we are finding a polynomial of degree that goes through the points and for . When we add them all together, we end up with a polynomial that interpolates the desired points.