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

Lecture

Interpolation in Finite Element Spaces

In course

MATH-451: Numerical approximation of PDEs

The course is about the derivation, theoretical analysis and implementation of the finite element method for the numerical approximation of partial differential equations in one and two space dimensions. ...

Description

This lecture covers the concept of interpolation in finite element spaces, focusing on the interpolation operator for degree r in a finite element space. The instructor explains the interpolation error, local interpolation estimates, and the continuous function mapping in a bounded domain. The lecture also discusses the regularity of solutions of partial differential equations in convex domains, emphasizing the importance of belonging to specific function spaces for accurate estimates.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Annalisa Buffa

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (32)

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.

Linear interpolation

In mathematics, linear interpolation is a method of curve fitting using linear polynomials to construct new data points within the range of a discrete set of known data points. If the two known points are given by the coordinates and , the linear interpolant is the straight line between these points. For a value in the interval , the value along the straight line is given from the equation of slopes which can be derived geometrically from the figure on the right. It is a special case of polynomial interpolation with .

Spline interpolation

In the mathematical field of numerical analysis, spline interpolation is a form of interpolation where the interpolant is a special type of piecewise polynomial called a spline. That is, instead of fitting a single, high-degree polynomial to all of the values at once, spline interpolation fits low-degree polynomials to small subsets of the values, for example, fitting nine cubic polynomials between each of the pairs of ten points, instead of fitting a single degree-ten polynomial to all of them.

Continuous function

In mathematics, a continuous function is a function such that a continuous variation (that is a change without jump) of the argument induces a continuous variation of the value of the function. This means that there are no abrupt changes in value, known as discontinuities. More precisely, a function is continuous if arbitrarily small changes in its value can be assured by restricting to sufficiently small changes of its argument. A discontinuous function is a function that is .

Related lectures (41)

Piecewise Linear Interpolation

Covers the concept of piecewise linear interpolation and the importance of dividing intervals correctly.

Interpolation of Lagrange: Dualité and Coupling

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

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.

Numerical Analysis: Polynomial Interpolation Techniques