**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.

Concept# Hermite interpolation

Summary

In numerical analysis, Hermite interpolation, named after Charles Hermite, is a method of polynomial interpolation, which generalizes Lagrange interpolation. Lagrange interpolation allows computing a polynomial of degree less than n that takes the same value at n given points as a given function. Instead, Hermite interpolation computes a polynomial of degree less than mn such that the polynomial and its m − 1 first derivatives have the same values at n given points as a given function and its m − 1 first derivatives.
Hermite's method of interpolation is closely related to the Newton's interpolation method, in that both are derived from the calculation of divided differences. However, there are other methods for computing a Hermite interpolating polynomial. One can use linear algebra, by taking the coefficients of the interpolating polynomial as unknowns, and writing as linear equations the constraints that the interpolating polynomial must satisfy. For another method, see .
Hermite interpolation consists of computing a polynomial of degree as low as possible that matches an unknown function both in observed value, and the observed value of its first m derivatives. This means that n(m + 1) values
must be known. The resulting polynomial has a degree less than n(m + 1). (In a more general case, there is no need for m to be a fixed value; that is, some points may have more known derivatives than others. In this case the resulting polynomial has a degree less than the number of data points.)
Let us consider a polynomial P(x) of degree less than n(m + 1) with indeterminate coefficients; that is, the coefficients of P(x) are n(m + 1) new variables. Then, by writing the constraints that the interpolating polynomial must satisfy, one gets a system of n(m + 1) linear equations in n(m + 1) unknowns.
In general, such a system has exactly one solution. Charles Hermite proved that this is effectively the case here, as soon as the x_i are pairwise different, and provided a method for computing it, which is described below.

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.

Related concepts (3)

Related people (22)

Related MOOCs (4)

Related units (10)

Related lectures (70)

Related courses (11)

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.

Bernstein polynomial

In the mathematical field of numerical analysis, a Bernstein polynomial is a polynomial that is a linear combination of Bernstein basis polynomials. The idea is named after Sergei Natanovich Bernstein. A numerically stable way to evaluate polynomials in Bernstein form is de Casteljau's algorithm. Polynomials in Bernstein form were first used by Bernstein in a constructive proof for the Weierstrass approximation theorem. With the advent of computer graphics, Bernstein polynomials, restricted to the interval [0, 1], became important in the form of Bézier curves.

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.

, , , , , , , , ,

Basic signal processing concepts, Fourier analysis and filters. This module can
be used as a starting point or a basic refresher in elementary DSP

Adaptive signal processing, A/D and D/A. This module provides the basic
tools for adaptive filtering and a solid mathematical framework for sampling and
quantization

Advanced topics: this module covers real-time audio processing (with
examples on a hardware board), image processing and communication system design.

MATH-212: Analyse numérique et optimisation

L'étudiant apprendra à résoudre numériquement divers problèmes mathématiques. Les propriétés théoriques de ces
méthodes seront discutées.

MATH-250: Numerical analysis

Construction et analyse de méthodes numériques pour la solution de problèmes d'approximation, d'algèbre linéaire et d'analyse

MATH-494: Topics in arithmetic geometry

P-adic numbers are a number theoretic analogue of the real numbers, which interpolate between arithmetics, analysis and geometry. In this course we study their basic properties and give various applic

Delay compensation: Estimation and implementationMOOC: Digital Signal Processing I

Covers delay compensation in communication channels, including estimation and implementation.

Gauss-Legendre Quadrature Formulas

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

The Wrong Method: Polynomial InterpolationMOOC: Numerical Analysis for Engineers

Explores the inefficiencies of the incorrect method for polynomial interpolation.

Related publications (87)

Giovanni De Cesare, Paolo Perona, Robin Schroff

This article investigates the performance and accuracy of continuous Real-Time Kinematic (RTK) Global Navigation Satellite System (GNSS) position tracking for hydromorphological surveys, based on a comprehensive river restoration monitoring campaign. The a ...

2024Volkan Cevher, Thomas Michaelsen Pethick, Wanyun Xie

This paper presents a theoretical analysis of linear interpolation as a principled method for stabilizing (large-scale) neural network training. We argue that instabilities in the optimization process are often caused by the nonmonotonicity of the loss lan ...

2023The goal of this thesis is the development and the analysis of numerical methods for problems where the unknown is a curve on a smooth manifold. In particular, the thesis is structured around the three following problems: homotopy continuation, curve inter ...