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

Lecture

Interpolation de Lagrange: General Case

Description

This lecture covers the Lagrange interpolation method for arbitrary n, focusing on constructing polynomials that pass through given points. It explains the basis of Lagrange polynomials, their properties, and how to solve interpolation problems. The lecture also discusses linearly independent bases and provides examples of applying the Lagrange interpolation in various scenarios.

In MOOC

Numerical Analysis for Engineers

Official source

Quiz

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (26)

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.

Chebyshev polynomials

The Chebyshev polynomials are two sequences of polynomials related to the cosine and sine functions, notated as and . They can be defined in several equivalent ways, one of which starts with trigonometric functions: The Chebyshev polynomials of the first kind are defined by Similarly, the Chebyshev polynomials of the second kind are defined by That these expressions define polynomials in may not be obvious at first sight, but follows by rewriting and using de Moivre's formula or by using the angle sum formulas for and repeatedly.

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.

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 (51)

Interpolation de Lagrange

Covers Lagrange interpolation, focusing on constructing polynomials that pass through given points.

Approximation of Data

Covers the least squares method for approximating data and handling errors.

Reed Solomon Codes: Basics and Applications

Introduces Reed Solomon Codes, their applications, polynomial definitions, interpolation, roots, and the Fundamental Theorem of Algebra.

Finite Dimensional Spaces

Explores finite dimensional spaces, covering extraction process, bases generation, and space completion.

Interpolation: Convergence I