**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Interpolation of Degree 1 by Intervals

Description

This lecture covers the concept of interpolating a function of degree 1 over an interval. The instructor explains how to construct a continuous interpolating function that coincides with the original function at equidistant points within the interval. The theoretical result regarding the maximum error of the interpolation is also discussed, showing that the error is bounded by a constant times the square of the step size, independent of the function being interpolated. Numerical experiments confirm that the error decreases by a factor of 4 each time the step size is halved.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In MOOCs (4)

Related concepts (21)

Instructor

Numerical Analysis for Engineers

Ce cours contient les 7 premiers chapitres d'un cours d'analyse numérique donné aux étudiants bachelor de l'EPFL. Des outils de base sont décrits dans les chapitres 1 à 5. La résolution numérique d'éq

Numerical Analysis for Engineers

Ce cours contient les 7 premiers chapitres d'un cours d'analyse numérique donné aux étudiants bachelor de l'EPFL. Des outils de base sont décrits dans les chapitres 1 à 5. La résolution numérique d'éq

Numerical Analysis for Engineers

Ce cours contient les 7 premiers chapitres d'un cours d'analyse numérique donné aux étudiants bachelor de l'EPFL. Des outils de base sont décrits dans les chapitres 1 à 5. La résolution numérique d'éq

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.

Multivariate interpolation

In numerical analysis, multivariate interpolation is interpolation on functions of more than one variable (multivariate functions); when the variates are spatial coordinates, it is also known as spatial interpolation. The function to be interpolated is known at given points and the interpolation problem consists of yielding values at arbitrary points . Multivariate interpolation is particularly important in geostatistics, where it is used to create a digital elevation model from a set of points on the Earth's surface (for example, spot heights in a topographic survey or depths in a hydrographic survey).

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.

Bilinear interpolation

In mathematics, bilinear interpolation is a method for interpolating functions of two variables (e.g., x and y) using repeated linear interpolation. It is usually applied to functions sampled on a 2D rectilinear grid, though it can be generalized to functions defined on the vertices of (a mesh of) arbitrary convex quadrilaterals. Bilinear interpolation is performed using linear interpolation first in one direction, and then again in another direction.

Nearest-neighbor interpolation

Nearest-neighbor interpolation (also known as proximal interpolation or, in some contexts, point sampling) is a simple method of multivariate interpolation in one or more dimensions. Interpolation is the problem of approximating the value of a function for a non-given point in some space when given the value of that function in points around (neighboring) that point. The nearest neighbor algorithm selects the value of the nearest point and does not consider the values of neighboring points at all, yielding a piecewise-constant interpolant.

Related lectures (136)

Error Analysis and InterpolationMATH-251(a): Numerical analysis

Explores error analysis and limitations in interpolation on evenly distributed nodes.

Numerical integration: continued

Covers numerical integration methods, focusing on trapezoidal rules, degree of exactness, and error analysis.

Interpolation de degré 2 par intervallesMOOC: Numerical Analysis for Engineers

Explores constructing a piecewise continuous function using degree 2 interpolation by intervals.

Gauss-Legendre Quadrature Formulas

Explores Gauss-Legendre quadrature formulas using Legendre polynomials for accurate function approximation.

Finite Element Method: Basis FunctionsMATH-451: Numerical approximation of PDEs

Explains the construction of basis functions in the Finite Element Method, focusing on local to global mapping and numerical accuracy.