Approximations and expansions Concept
Lagrange interpolation
Summary
Lagrange interpolation is an explicit formula for the polynomial of least degree through given points. It writes the interpolation polynomial as a combination of basis polynomials, each equal to at one node and at the others. The formula works over every field and shows at once that the interpolation polynomial exists. It is used in numerical analysis, in coding theory and in secret sharing.
Where this leads
5 pages build on this one.
Further reading
About this page
| Tag | 237KR6FRCK |
|---|---|
| URI | m2://237KR6FRCK |
| Kind | concept |
| Writing | W0 stub |
| MSC | 41A05, 65D05 |
| Specializes | Polynomial interpolation |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- Pseudospectral optimal control
- Lebesgue constant
- Inverse quadratic interpolation
- Faber's theorem on interpolation