Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Polynomial Interpolation: Lagrange Interpolation

Description

This lecture covers the concept of polynomial interpolation, focusing on Lagrange interpolation as a unique polynomial of degree 2N through 2N + 1 points. It explains the necessity of smoothness in interpolation and the drawbacks of using different sets of polynomials based on dataset length.

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (28)

Interpolation

In the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.

Polynomial interpolation

In numerical analysis, polynomial interpolation is the interpolation of a given bivariate data set by the polynomial of lowest possible degree that passes through the points of the dataset. Given a set of n + 1 data points , with no two the same, a polynomial function is said to interpolate the data if for each . There is always a unique such polynomial, commonly given by two explicit formulas, the Lagrange polynomials and Newton polynomials.

Lagrange polynomial

In numerical analysis, the Lagrange interpolating polynomial is the unique polynomial of lowest degree that interpolates a given set of data. Given a data set of coordinate pairs with the are called nodes and the are called values. The Lagrange polynomial has degree and assumes each value at the corresponding node, Although named after Joseph-Louis Lagrange, who published it in 1795, the method was first discovered in 1779 by Edward Waring. It is also an easy consequence of a formula published in 1783 by Leonhard Euler.

Newton polynomial

In the mathematical field of numerical analysis, a Newton polynomial, named after its inventor Isaac Newton, is an interpolation polynomial for a given set of data points. The Newton polynomial is sometimes called Newton's divided differences interpolation polynomial because the coefficients of the polynomial are calculated using Newton's divided differences method. Given a set of k + 1 data points where no two xj are the same, the Newton interpolation polynomial is a linear combination of Newton basis polynomials with the Newton basis polynomials defined as for j > 0 and .

Trigonometric interpolation

In mathematics, trigonometric interpolation is interpolation with trigonometric polynomials. Interpolation is the process of finding a function which goes through some given data points. For trigonometric interpolation, this function has to be a trigonometric polynomial, that is, a sum of sines and cosines of given periods. This form is especially suited for interpolation of periodic functions. An important special case is when the given data points are equally spaced, in which case the solution is given by the discrete Fourier transform.

Related lectures (48)

Polynomial Interpolation: Optimizing Error

Covers the optimization of error in polynomial interpolation, focusing on minimizing the error by strategically placing interpolation points.

Interpolation by Intervals: Lagrange Interpolation

Covers Lagrange interpolation using intervals to find accurate polynomial approximations.

Interpolation of Lagrange: Dualité and Coupling

Explores Lagrange interpolation, emphasizing uniqueness and simplicity in reconstructing functions from limited values.

Interpolation de fonction

Explores interpolation of regular functions, error analysis, convergence, and Chebyshev polynomials.

Interpolation de Lagrange