Lagrange polynomial

From Free net 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.

Image:Lagrangepolys.png

Contents 1 Definition 2 Proof 3 Main idea 4 Usage 4.1 Example 4.2 Notes 5 See also

Definition

Given a set of k + 1 data points

<math>(x_0, y_0),\ldots,(x_k, y_k)</math>

where no two x_j are the same, the interpolation polynomial in the Lagrange form is a linear combination

<math>L(x) := \sum_{j=0}^{k} y_j \ell_j(x)</math>

of Lagrange basis polynomials

<math>\ell_j(x) := \prod_{i=0,\, j\neq i}^{k} \frac{x-x_i}{x_j-x_i} = \frac{x-x_0}{x_j-x_0} \cdots \frac{x-x_{j-1}}{x_j-x_{j-1}} \frac{x-x_{j+1}}{x_j-x_{j+1}} \cdots \frac{x-x_{k}}{x_j-x_{k}}.</math>

Proof

The function we are looking for has to be polynomial function L(x) of degree k with

<math>L(x_j) = y_j \qquad j=0,\ldots,k</math>

According to the Stone-Weierstrass theorem such a function exists and is unique. The Lagrange polynomial is the solution to the interpolation problem.

As can be easily seen

1. <math>\ell_j(x)</math> is a polynomial and has degree k.
2. <math>\ell_i(x_j) = \delta_{ij},\quad 0 \leq i,j \leq k.\, </math>

Thus the function L(x) is a polynomial with degree k and

<math>L(x_i) = \sum_{j=0}^{k} y_j \ell_j(x_i) = y_i.</math>

Therefore L(x) is our unique interpolation polynomial.

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.

Usage

Example

Image:LagrangeInterp.png We wish to interpolate <math>f(x)=\tan{x}</math> at the points

<math>x_0=-1.5</math>	<math>f(x_0)=-14.1014</math>
<math>x_1=-0.75</math>	<math>f(x_1)=-0.931596</math>
<math>x_2=0</math>	<math>f(x_2)=0</math>
<math>x_3=0.75</math>	<math>f(x_3)=0.931596</math>
<math>x_4=1.5</math>	<math>f(x_4)=14.1014</math>

Now, the basis polynomials are:

<math>\ell_0(x)={x - x_1 \over x_0 - x_1}\cdot{x - x_2 \over x_0 - x_2}\cdot{x - x_3 \over x_0 - x_3}\cdot{x - x_4 \over x_0 - x_4}

            ={1\over 243} x (2x-3)(4x-3)(4x+3)</math>

<math>\ell_1(x)={x - x_0 \over x_1 - x_0}\cdot{x - x_2 \over x_1 - x_2}\cdot{x - x_3 \over x_1 - x_3}\cdot{x - x_4 \over x_1 - x_4}

            =-{8\over 243} x (2x-3)(2x+3)(4x-3)</math>

<math>\ell_2(x)={x - x_0 \over x_2 - x_0}\cdot{x - x_1 \over x_2 - x_1}\cdot{x - x_3 \over x_2 - x_3}\cdot{x - x_4 \over x_2 - x_4}

            ={1\over 243} (243-540x^2+192x^4)</math>

<math>\ell_3(x)={x - x_0 \over x_3 - x_0}\cdot{x - x_1 \over x_3 - x_1}\cdot{x - x_2 \over x_3 - x_2}\cdot{x - x_4 \over x_3 - x_4}

            =-{8\over 243} x (2x-3)(2x+3)(4x+3)</math>

<math>\ell_4(x)={x - x_0 \over x_4 - x_0}\cdot{x - x_1 \over x_4 - x_1}\cdot{x - x_2 \over x_4 - x_2}\cdot{x - x_3 \over x_4 - x_3}

            ={1\over 243} x (2x+3)(4x-3)(4x+3)</math>

Thus the interpolating polynomial then is

<math>{1\over 243}\Big(f(x_0)x (2x-3)(4x-3)(4x+3)-8f(x_1)x (2x-3)(2x+3)(4x-3)</math>

<math>+f(x_2)(243-540x^2+192x^4)-8f(x_3)x (2x-3)(2x+3)(4x+3) \,</math>

<math>+f(x_4)x (2x+3)(4x-3)(4x+3)\Big)\,</math>

<math>=-1.47748x+4.83456x^3.\,</math>

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 x_k 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).

See also

• Polynomial interpolation
• Newton form of the interpolation polynomial
• Bernstein form of the interpolation polynomial
• Newton-Cotes formulascs:Lagrangeova interpolace

fr:Interpolation lagrangienne pt:Polinômio de Lagrange ru:Интерполяционный многочлен Лагранжа sr:Лагранжов полином