Arabic
Bulgarian
Chinese
Croatian
Czech
Danish
Dutch
English
Estonian
Finnish
French
German
Greek
Hebrew
Hindi
Hungarian
Icelandic
Indonesian
Italian
Japanese
Korean
Latvian
Lithuanian
Malagasy
Norwegian
Persian
Polish
Portuguese
Romanian
Russian
Serbian
Slovak
Slovenian
Spanish
Swedish
Thai
Turkish
Vietnamese

Arabic
Bulgarian
Chinese
Croatian
Czech
Danish
Dutch
English
Estonian
Finnish
French
German
Greek
Hebrew
Hindi
Hungarian
Icelandic
Indonesian
Italian
Japanese
Korean
Latvian
Lithuanian
Malagasy
Norwegian
Persian
Polish
Portuguese
Romanian
Russian
Serbian
Slovak
Slovenian
Spanish
Swedish
Thai
Turkish
Vietnamese

definition of Wikipedia

Advertizing ▼

In numerical analysis, **Lagrange polynomials** are used for polynomial interpolation. For a given set of distinct points and numbers , the Lagrange polynomial is the polynomial of the least degree that at each point assumes the corresponding value (i.e. the functions coincide at each point). The interpolating polynomial of the least degree is unique, however, and it is therefore more appropriate to speak of "the Lagrange form" of that unique polynomial rather than "the Lagrange interpolation polynomial," since the same polynomial can be arrived at through multiple methods. Although named after Joseph Louis Lagrange, it was first discovered in 1779 by Edward Waring and rediscovered in 1783 by Leonhard Euler.

Lagrange interpolation is susceptible to Runge's phenomenon, and the fact that changing the interpolation points requires recalculating the entire interpolant can make Newton polynomials easier to use. Lagrange polynomials are used in the Newton-Cotes method of numerical integration and in Shamir's secret sharing scheme in Cryptography.

## Contents |

Given a set of *k* + 1 data points

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

of Lagrange basis polynomials

Note how, given the initial assumption that no two are the same, , so this expression is always well-defined. The reason pairs with are not allowed is that no interpolation function such that would exist; a function can only get one value for each argument . On the other hand, if also , then those two points would actually be one single point.

For all , includes the term in the numerator, so the whole product will be zero at :

On the other hand,

In other words, all basis polynomials are zero at , except , because it lacks the term.

It follows that , so at each point , , showing that interpolates the function exactly.

Function *L*(*x*) being sought is a polynomial in of the least degree that interpolates the given data set; that is, assumes value at the corresponding for all data points :

Observe that:

- In there are
*k*terms in the product and each term contains one*x*, so*L*(*x*) (which is a sum of these*k*-degree polynomials) must also be a*k*-degree polynomial.

Watch what happens if we expand this product. Because the product skips , If then all terms are (except where but that case is impossible as pointed out in the definition section---if you tried to write out that term you'd find that and since , , contrary to ). Also if then since doesn't preclude it, one term in the product **will** be for , i.e. , zeroing the entire product. So

where is the Kronecker delta. So:

Thus the function *L*(*x*) is a polynomial with degree at most *k* and where .

Additionally, the interpolating polynomial is unique, as shown by the unisolvence theorem at Polynomial interpolation.

This section requires expansion with: examples and explanation of what inverting means in this context. |

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 Vandermonde matrix. By choosing another basis, the Lagrange basis, we get the much simpler identity matrix = δ_{i,j} which we can solve instantly: the Lagrange basis *inverts* the Vandermonde matrix.

This construction is the same as the Chinese Remainder Theorem. Instead of checking for remainders of integers modulo prime numbers, we are checking for remainders of polynomials when divided by linears.

Find an interpolation formula for *ƒ*(*x*) = tan(*x*) given this set of known values:

The basis polynomials are:

Thus the interpolating polynomial then is

We wish to interpolate *ƒ*(*x*) = *x*^{2} over the range 1 ≤ *x* ≤ 3, given these three points:

The interpolating polynomial is:

We wish to interpolate *ƒ*(*x*) = *x*^{3} over the range 1 ≤ *x* ≤ 3, given these 3 points:

The interpolating polynomial is:

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. Uniqueness can also be seen from the invertibility of the Vandermonde matrix, due to the non-vanishing of the Vandermonde determinant.

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 barycentric form of the Lagrange interpolation (see below) or Newton polynomials.

Lagrange and other interpolation at equally spaced points, as in the example above, yield a polynomial oscillating above and below the true function. This behaviour tends to grow with the number of points, leading to a divergence known as Runge's phenomenon; the problem may be eliminated by choosing interpolation points at Chebyshev nodes.

The Lagrange basis polynomials can be used in numerical integration to derive the Newton–Cotes formulas.

Using

we can rewrite the Lagrange basis polynomials as

or, by defining the *barycentric weights*^{[1]}

we can simply write

which is commonly referred to as the *first form* of the barycentric interpolation formula.

The advantage of this representation is that the interpolation polynomial may now be evaluated as

which, if the weights have been pre-computed, requires only operations (evaluating and the weights ) as opposed to for evaluating the Lagrange basis polynomials individually.

The barycentric interpolation formula can also easily be updated to incorporate a new node by dividing each of the , by and constructing the new as above.

We can further simplify the first form by first considering the barycentric interpolation of the constant function :

Dividing by does not modify the interpolation, yet yields

which is referred to as the *second form* or *true form* of the barycentric interpolation formula. This second form has the advantage that need not be evaluated for each evaluation of .

The Lagrange polynomial can also be computed in finite fields. This has applications in cryptography, such as in Shamir's Secret Sharing scheme.

- Polynomial interpolation
- Neville's algorithm
- Newton form of the interpolation polynomial
- Bernstein form of the interpolation polynomial
- Newton–Cotes formulas
- Lebesgue constant (interpolation)
- The Chebfun system

**^**Jean-Paul Berrut, Lloyd N. Trefethen (2004). "Barycentric Lagrange Interpolation".*SIAM Review***46**(3): 501–517. DOI:10.1137/S0036144502417715.

- ALGLIB has an implementations in C++ / C# / VBA / Pascal.
- GSL has a polynomial interpolation code in C
- Lagrange Method of Interpolation — Notes, PPT, Mathcad, Mathematica, MATLAB, Maple at Holistic Numerical Methods Institute
- Lagrange interpolation polynomial on www.math-linux.com
- Weisstein, Eric W., "Lagrange Interpolating Polynomial" from MathWorld.
- Estimate of the error in Lagrange Polynomial Approximation at ProofWiki
- Module for Lagrange Polynomials by John H. Mathews
- Dynamic Lagrange interpolation with JSXGraph
- Numerical computing with functions: The Chebfun Project

sensagent's content

- definitions
- synonyms
- antonyms
- encyclopedia

Dictionary and translator for handheld

New : sensagent is now available on your handheld

Advertising ▼

Webmaster Solution

Alexandria

A windows (pop-into) of information (full-content of Sensagent) triggered by double-clicking any word on your webpage. Give contextual explanation and translation from your sites !

SensagentBox

With a SensagentBox, visitors to your site can access reliable information on over 5 million pages provided by Sensagent.com. Choose the design that fits your site.

Business solution

Improve your site content

Add new content to your site from Sensagent by XML.

Crawl products or adds

Get XML access to reach the best products.

Index images and define metadata

Get XML access to fix the meaning of your metadata.

Please, email us to describe your idea.

Lettris

Lettris is a curious tetris-clone game where all the bricks have the same square shape but different content. Each square carries a letter. To make squares disappear and save space for other squares you have to assemble English words (left, right, up, down) from the falling squares.

boggle

Boggle gives you 3 minutes to find as many words (3 letters or more) as you can in a grid of 16 letters. You can also try the grid of 16 letters. Letters must be adjacent and longer words score better. See if you can get into the grid Hall of Fame !

English dictionary

Main references

Most English definitions are provided by WordNet .

English thesaurus is mainly derived from The Integral Dictionary (TID).

English Encyclopedia is licensed by Wikipedia (GNU).

Copyrights

The wordgames anagrams, crossword, Lettris and Boggle are provided by Memodata.

The web service Alexandria is granted from Memodata for the Ebay search.

The SensagentBox are offered by sensAgent.

Translation

Change the target language to find translations.

Tips: browse the semantic fields (see From ideas to words) in two languages to learn more.

last searches on the dictionary :

ikigai ·
vikingen ·
the primal urge ·
Terlingua Creek ·
LISA BONET ·
Zachary Stevens ·
Los Angeles AFB ·
Magma (comics) ·
candidate ·
JANET PARSHALL ·

3271 online visitors

computed in 0.047s

I would like to report:

section :

a spelling or a grammatical mistake

an offensive content(racist, pornographic, injurious, etc.)

a copyright violation

an error

a missing statement

other

please precise: