请输入您要查询的字词:

 

单词 LectureNotesOnPolynomialInterpolation
释义

lecture notes on polynomial interpolation


1 Summary of notation and terminonlogy

  • multi-evaluation mapping: ev𝐱:𝒫mn,𝐱n. Here 𝒫m is the vector spaceMathworldPlanetmath of polynomials ofdegree m or less.

  • interpolation mapping: pol𝐱:n𝒫n-1,𝐱n where x1,,xn aredistinct;

  • Vandermonde matrixMathworldPlanetmath and polynomial;

  • overdetermined and underdetermined linear system;

  • overdetermined and underdetermined interpolationMathworldPlanetmath problem

2 The polynomial interpolation problem

Definition 1.

Let 𝐱n be given. Define ev𝐱:𝒫mn, the multi-evaluation mapping, to be the lineartransformation given by

ev𝐱:p[p(x1)p(xn)],p𝒫m.
Problem 2 (Polynomial interpolation).

Given (x1,y1),,(xn,yn)2to find a polynomial p𝒫m such that p(xi)=yi,i=1,,n. Equivalently, given 𝐱,𝐲n to find thepreimageMathworldPlanetmath ev𝐱-1(𝐲).

Theorem 3.

Fix xRn. The multi-evaluation mappingevx:Pn-1Rn is an isomorphismPlanetmathPlanetmathPlanetmathPlanetmath if and onlyif the componentsPlanetmathPlanetmath x1,,xn are distinct.

3 Vandermonde matrix, polynomial, and determinant

Definition 4.

For a given 𝐱n, the following matrix

𝖵𝖬(𝐱)=𝖵𝖬(x1,,xn)=[1x1x12x1n-11x2x22x2n-11x3x32x3n-11xnxn2xnn-1]

is calledthe Vandermonde matrix. Theexpression,

𝖵(𝐱)=𝖵(x1,,xn)=1i<jn(xj-xi)

is called the Vandermonde polynomial. Note: we define 𝖵(x1)=1; the usual convention is that the empty product is equal to 1.

Proposition 5.

The Vandermonde matrix is the transformation matrix of evx with themonomial basis [1,x,,xn] as the input basis and thestandard basis [e1,,en+1] as the output basis.

Theorem 6.

The Vandermonde polynomial gives the determinantMathworldPlanetmath of the Vandermondematrix:

|1x1x1n-11x2x2n-11xnxnn-1|=1i<jn+1(xj-xi),(1)

or more succinctly,

det𝖵𝖬(𝐱)=𝖵(𝐱).
Proof.

We will prove formulaMathworldPlanetmathPlanetmath (1) by inductionMathworldPlanetmath on n. Notethat

𝖵𝖬(x1)=[1],𝖵(x1)=1.

Evidently then, theformula works for n=1. Next, suppose that we believe the formulafor a given n. We show that the formula is valid for n+1. Forx1,,xn and a variable x, and consider thenth degree polynomial

p(x)=det𝖵𝖬(x1,,xn,x)=|1x1x1n-1x1n1x2x2n-1x2n1xnxnn-1xnn1xxn-1xn|

By the properties of determinants, x1,,xn are roots ofp(x). Taking the cofactor expansion along the bottom row, wesee that the coefficient of xn is 𝖵(x1,,xn).Therefore,

p(x)=𝖵(x1,,xn)(x-x1)(x-xn)=𝖵(x1,,xn,x),

as was to be shown.∎

4 Lagrange interpolation formula

Letx1,,xn be distinct. We know thatev𝐱:𝒫n-1n is invertiblePlanetmathPlanetmathPlanetmath. Letpol𝐱:n𝒫n-1 denote the inversePlanetmathPlanetmathPlanetmath. In principle,this inverse is described by the inverse of the Vandermonde matrix.Is there another way to solve the interpolation problem? Fori=1,,n let us define the polynomial

pi(x)=jix-xjxi-xj.

These n-1degree polynomials have been “engineered” so that pi(xi)=1 andso that pi(xj)=0 for ij

Theorem 7 (Lagrange interpolation formula).

Let x1,,xnR be distinct. Then,

pol𝐱(𝐲)=y1p1++ynpn.

5 Underdetermined and overdetermined interpolation

Definition 8.

Let T:𝒰𝒱 be a linear transformation of finite dimensionalvector spaces. A linear problem is an equation of the form

T(𝐮)=𝐯,

where 𝐯𝒱 is given, and 𝐮𝒰 isthe unknown. To be more precise, the problem is to determinethe preimage T-1(𝐯) for a given 𝐯𝒱. We say that theproblem is overdetermined if dim𝒱>dim𝒰, i.e. if thereare more equations than unknowns. The linear problem is said to beunderdetermined if dim𝒱<dim𝒰, i.e., if there are morevariables than equations.

Remark 9.

By the rank-nullity theoremMathworldPlanetmath, anunderdetermined linear problem will either be inconsistent, or willhave multiple solutions. Thus, an underdetermined system arises whenT is not one-to-one; i.e., the kernel ker(T) is non-trivial. Anoverdetermined linear system is inconsistent, unless 𝐯 satisfies anumber linear compatibility constraints, equations that describe the imageIm(T). To put it another way, an overdetermined system ariseswhen T is not onto.

Definition 10.

Let x1,,xn be distinct and letev𝐱:𝒫mn be the corresponding multi-evaluationmapping. Let 𝐲n be given. The linear equation

ev𝐱(p)=𝐲,p𝒫m

is called an underdetermined interpolation problem if mn.If mn-2, we call the above equation an overdeterminedinterpolation problem. Note that if m=n-1, the interpolationproblem is “just right”; there is exactly one solution, namely thepolynomialpol𝐱(𝐲) given by the Lagrange interpolation formula.

Proposition 11 (Underdetermined interpolation).

Let x1,,xnR be distinct. Define

q(x)=(x-x1)(x-xn)

to be the n𝑡ℎ degree polynomial with the xi as its roots.Suppose that mn. Then,the multi-evaluation mappingevx:PmRn is not one-to-one. A basis for thekernel is given by q(x),xq(x),,xm-nq(x). Let y1,,ynR be given. The solutionset to the interpolation problem evx(p)=y, is given by

ev𝐱-1(𝐲)={r+sq:s𝒫m-n},

wherer=polx(y)is the n-1𝑠𝑡 degree polynomial given by the Lagrangeinterpolation formula. To put it another way, the general solutionof the equation

ev𝐱(p)=𝐲

is given by

p=r+sq,s𝒫n-m free.
Proposition 12 (Overdetermined interpolation).

Let x1,,xnR be distinct.Suppose that mn-2. Then,the multi-evaluation mappingevx:PmRn is not onto. If m=n-2, thenyR4 belongs to Im(evx) if and only if

|1x1x1my11x2x2my21xn-1xn-1myn-11xnxnmyn|=0

More generally, for any mn-2, the interpolation problemevx(p)=y,yRn has a solution if and onlyif rankM(x,y)=m+1 where

M(𝐱,𝐲)=[1x1x1my11x2x2my21xm+1xm+1mym+11xnxnmyn]
Remark 13.

The compatibility constraints ony1,,yn for an overdetermined system amount to the conditionthat 𝐲 lie in the image of ev𝐱, or what is equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmath,belong to the column space of the corresponding transformation matrix.We can therefore obtain the constraint equations by row reducing theaugmented matrix M(𝐱,𝐲) to echelon formMathworldPlanetmath. The back entries ofthe last n-m-1 rows will hold the constraint equations.Equivalently, we can solve the interpolation problem for(x1,y1),,(xm,ym) to obtain a p=y1p1+ym+1pm+1𝒫m. The additional equations

yi=y1p1(xi)++ym+1pm+1(xi),i=m+2,,n

are the desired compatibility constraints on y1,,yn.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 9:23:35