Lagrange polynomial
From Wikipedia, the free encyclopedia
In numerical analysis, a Lagrange polynomial, named after Joseph Louis Lagrange, is the interpolation polynomial for a given set of data points in the Lagrange form. It was first discovered by Edward Waring in 1779 and later rediscovered by Leonhard Euler in 1783.
As there is only one interpolation polynomial for a given set of data points it is a bit misleading to call the polynomial Lagrange interpolation polynomial. The more precise name is interpolation polynomial in the Lagrange form.
Contents |
[edit] Definition
Given a set of k + 1 data points
where no two xj are the same, the interpolation polynomial in the Lagrange form is a linear combination
of Lagrange basis polynomials
[edit] Proof
The function we are looking for has to be a polynomial function L(x) of degree k with
The Lagrange polynomial is a solution to the interpolation problem:
As can be easily seen
- is a polynomial and has degree k.
Thus the function L(x) is a polynomial with degree k and
There can be only one solution to the interpolation problem since the difference of two such solutions would be a polynomial with degree at most k and k+1 zeros.
Therefore L(x) is our unique interpolation polynomial.
[edit] Main idea
Solving an interpolation problem leads to a problem in linear algebra where we have to solve a matrix. Using a standard monomial basis for our interpolation polynomial we get the very complicated Vandermonde matrix. By choosing another basis, the Lagrange basis, we get the much simpler identity matrix = δi,j which we can solve instantly.
[edit] Usage
[edit] Example
We wish to interpolate f(x) = tan(x) at the points
x0 = − 1.5 | f(x0) = − 14.1014 |
x1 = − 0.75 | f(x1) = − 0.931596 |
x2 = 0 | f(x2) = 0 |
x3 = 0.75 | f(x3) = 0.931596 |
x4 = 1.5 | f(x4) = 14.1014 |
Now, the basis polynomials are:
Thus the interpolating polynomial then is
[edit] Notes
The Lagrange form of the interpolation polynomial shows the linear character of polynomial interpolation and the uniqueness of the interpolation polynomial. Therefore, it is preferred in proofs and theoretical arguments. But, as can be seen from the construction, each time a node xk changes, all Lagrange basis polynomials have to be recalculated. A better form of the interpolation polynomial for practical (or computational) purposes is the Newton polynomial. Using nested multiplication amounts to the same idea.
Lagrange and other interpolation at equally spaced points, as in the example above, yield a polynomial oscillating above and below the true function. This oscillation is lessened by choosing interpolation points at Chebyshev nodes.
The Lagrange basis polynomials are used in numerical integration to derive the Newton-Cotes formulas.
Lagrange interpolation is often used in digital signal processing of audio for the implementation of fractional delay FIR filters (e.g., to precisely tune digital waveguides in physical modelling synthesis).
[edit] See also
- Polynomial interpolation
- Newton form of the interpolation polynomial
- Bernstein form of the interpolation polynomial
- Newton-Cotes formulas
- Lagrange Method of Interpolation - Notes, PPT, Mathcad, Mathematica, Matlab, Maple at Holistic Numerical Methods Institute