Approximations and expansions Interpolation Concept
Lagrange polynomial
Summary
Take points in the plane with distinct first coordinates. Their Lagrange polynomial is the unique polynomial function of degree at most whose graph passes through all of them. It is written as a sum of basis polynomials, each equal to at one node and at the others. It gives an explicit solution of polynomial interpolation and is the starting point of numerical differentiation and quadrature rules. The definition gives the formula.
Where this leads
4 pages build on this one.
Further reading
About this page
| Tag | Y7KSGE97GK |
|---|---|
| URI | m2://Y7KSGE97GK |
| Kind | concept |
| Writing | W0 stub |
| MSC | 41A05, 65D05, 26C05 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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
- Spectral element method
- Gauss–Legendre Runge–Kutta methods
- Gauss–Jacobi quadrature
- Barycentric interpolation formula