Math 2.0

Numerical analysis Proposition

Barycentric interpolation formula

Builds on Lagrange basis polynomialsLagrange polynomialPolynomial interpolationField

Statement

Let KK be a field, let n≥0n \ge 0, let x0,…,xn∈Kx_0, \dots, x_n \in K be pairwise distinct, and let y0,…,yn∈Ky_0, \dots, y_n \in K. Let pp be the interpolation polynomial of degree at most nn with p(xj)=yjp(x_j) = y_j for all jj. Define the barycentric weights wj=∏k≠j(xj−xk)−1w_j = \prod_{k \ne j} (x_j - x_k)^{-1} and let ℓ(x)=∏k=0n(x−xk)\ell(x) = \prod_{k=0}^{n} (x - x_k). Then for every x∈Kx \in K that is not a node:

  1. (first form) p(x)=ℓ(x)∑j=0nwjx−xj yj\displaystyle p(x) = \ell(x) \sum_{j=0}^{n} \frac{w_j}{x - x_j} \, y_j;
  2. (second form) p(x)=∑j=0nwjx−xj yj∑j=0nwjx−xj\displaystyle p(x) = \frac{\sum_{j=0}^{n} \frac{w_j}{x - x_j} \, y_j}{\sum_{j=0}^{n} \frac{w_j}{x - x_j}}.

Remarks

The Lagrange basis polynomials satisfy ℓj(x)=ℓ(x) wj/(x−xj)\ell_j(x) = \ell(x) \, w_j / (x - x_j), so the first form is the Lagrange formula p=∑jyjℓjp = \sum_j y_j \ell_j rewritten. Applying the first form to the constant data yj=1y_j = 1, whose interpolant is 11, gives 1=ℓ(x)∑jwj/(x−xj)1 = \ell(x) \sum_j w_j / (x - x_j). Dividing the first form by this identity gives the second form.

Example: nodes 0,10, 1 have weights w0=−1w_0 = -1 and w1=1w_1 = 1. The second form gives p(x)=−y0/x+y1/(x−1)−1/x+1/(x−1)=y0(1−x)+y1xp(x) = \dfrac{-y_0/x + y_1/(x - 1)}{-1/x + 1/(x - 1)} = y_0 (1 - x) + y_1 x, the line through the data.

Once the weights are computed, in O(n2)O(n^2) operations, each evaluation costs O(n)O(n) operations, and adding a new node updates the weights in O(n)O(n) operations. The weights do not depend on the data, so the same weights serve for many data sets.

Going deeper

For a student

The second form is the standard way to evaluate an interpolation polynomial in floating point arithmetic. For good node families, such as Chebyshev nodes, the weights have simple closed forms and the evaluation is numerically stable. Unlike the Newton form, it needs no ordering of the nodes and no table of divided differences.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Field concept
  2. Lagrange basis polynomials concept
  3. Lagrange polynomial concept
  4. Polynomial interpolation concept
  5. Barycentric interpolation formula statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Lagrange_polynomial
About this page
TagTPRFJNZ7S2
URIm2://TPRFJNZ7S2
Kindstatement, proposition
WritingW0 stub
MSC65D05, 41A05
StatusThis copy of the site has no build data. Run m2 status TPRFJNZ7S2.
AboutLagrange polynomial
UsesLagrange basis polynomials, Lagrange polynomial, Polynomial interpolation, Field

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.