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

Lecture

Finite Element Interpolation: Clément Operator

Description

This lecture covers the concept of finite element interpolation using the Clément operator, which is used to construct an interpolation operator for functions that are not continuous. The instructor explains how to compute coefficients for the basis functions when the function is not continuous, and discusses the properties and limitations of the Clément operator. The lecture also delves into the estimation of interpolation errors over elements and the importance of understanding the behavior of the interpolation operator in such cases.

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

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.

Function (mathematics)

In mathematics, a function from a set X to a set Y assigns to each element of X exactly one element of Y. The set X is called the domain of the function and the set Y is called the codomain of the function. Functions were originally the idealization of how a varying quantity depends on another quantity. For example, the position of a planet is a function of time. Historically, the concept was elaborated with the infinitesimal calculus at the end of the 17th century, and, until the 19th century, the functions that were considered were differentiable (that is, they had a high degree of regularity).

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 .

Approximation error

The approximation error in a data value is the discrepancy between an exact value and some approximation to it. This error can be expressed as an absolute error (the numerical amount of the discrepancy) or as a relative error (the absolute error divided by the data value). An approximation error can occur for a variety of reasons, among them a computing machine precision or measurement error (e.g. the length of a piece of paper is 4.53 cm but the ruler only allows you to estimate it to the nearest 0.

Related lectures (45)

Numerical Analysis: Polynomial Interpolation Techniques

Provides an overview of polynomial interpolation techniques in numerical analysis, focusing on Lagrange interpolation and error estimation methods.

Numerical Integration: Lagrange Interpolation, Simpson Rules

Explains Lagrange interpolation for numerical integration and introduces Simpson's rules.

Polynomial Interpolation: Lagrange Method

Covers the Lagrange polynomial interpolation method and error analysis in function approximation.

Lagrange Interpolation: Case 2 MOOC: Numerical Analysis for Engineers

Explains Lagrange interpolation with M=2, covering base polynomials and linear independence.

Numerical Analysis: Introduction to Computational Methods