MATH 661.FA21 Midterm Examination 2

Solve the problems for your appropriate course track. Problems probe understanding of the definitions and results from the modules on real function approximation. Formulate your answers clearly and cogently. Sketch out an approach on scratch paper first. Then briefly transcribe the approach to the answer you turn in, followed by appropriate calculations and conclusions, within allotted time. Use concise, complete English sentences in the description of your approach.

Each question is meant to be completely answered and transcribed from proof to final copy within ten minutes. The test also contains 5 short Quiz 03 questions, meant to be answered in one minute each. Present a succint motivation for your quiz answers taking into account time constraints.

1Track 1

  1. Construct the polynomial interpolant of data 𝒟={(1,3),(2,4),(3,-1),(4,-18)} in Lagrange form.

    Solution. The Lagrange form of the interpolant of 𝒟={(xi,yi),i=0,..,n} is

    p(t)=∑i=0nℓi(t)⁡yi,ℓi(t)=∏j=0n't-xjxi-xj⁡.

    For the given data,

    p(t)=3⁡ℓ0(t)+4ℓ1(t)-ℓ2(t)-18ℓ3(t),

    with

    ℓ0(t)=(t-2)(t-3)(t-4)(1-2)(1-3)(1-4) ℓ1(t)=(t-1)(t-3)(t-4)(1-2)(1-3)(1-4) ℓ2(t)=(t-1)(t-2)(t-4)(1-2)(1-3)(1-4) ℓ3(t)=(t-1)(t-2)(t-3)(1-2)(1-3)(1-4)
  2. Construct the Newton form of the polynomial interpolant of the above data set, presenting the table of divided differences.

    Solution. The Newton form of the interpolant is

    p(t)=[y0]+[y1,y0](t-x0)+⋯+[yn,..,y0](t-x0)(t-xn-1).

    For the above data construct the divided difference table

    i xi [yi] [yi,yi-1] [yi,yi-1,yi-2] [yi,yi-1,yi-3] 0 1 3 - - - 1 2 4 1 - - 2 3 -1 -5 -3 - 3 4 -18 -17 -6 -1

    The interpolant is

    p(t)=3+(t-1)⋅1+(t-1)(t-2)(-3)+(t-1)(t-2)(t-3)(-1)
  3. Efficiently evaluate the Newton form of the polynomial interpolant determined above at t=-1, using Horner's scheme.

    Solution. The above interpolant is evaluated as

    p(t)=3+(t-1)(1+(t-2)(-3-(t-3)))
    p(-1)=3+(-2)(1+(-3)(-3+4))=7
  4. Replace the sampling points xi=1+i, i=0,..,3 in the data set 𝒟 so as to minimize the interpolation error over the interval [1,4]

    Solution. The interpolation error is minimized for the Chebyshev points, in this case the roots of T4(x), rescaled to cover the interval [1,4]

    t=32(x+1)+1

    First, determine T4(x) through the recursion

    Tn+1(x)=2x⁡Tn(x)-Tn-1(x)
    T0(x)=1,⁡T1(x)=x,T2(x)=2x2-1
    T3(x)=2x(2x2-1)-x=4x3-3x
    T4(x)=2x(4x3-3x)-(2x2-1)=8x4-8x2+1

    Denote z=x2 and find roots of quadratic

    8z2-8z+1=0⇒z1,2=4±88=2±24
    z1=2+24≅2+1.44=0.85⇒x1,2=±0.85≅±0.92
    z2=2-24≅2-1.44=0.15⇒x1,2=±0.15≅±0.39
  5. Quiz questions:

    1. True or false: a basis exists for all vector spaces.

      True

    2. True or false: a basis can be effectively constructed for all vector spaces.

      False

    3. What is the projection of f:ℝ→ℝ along bk(t) in a Hilbert space spanned by {b1(t),b2(t),..,bk(t),..}?

      (f,bk)bk(t), with (f,g) denoting scalar product in the Hilbert space

    4. What is the error of a polynomial interpolant p(t) of f:ℝ→ℝ, sampled by 𝒟={(xi,yi=f(xi)),i=0,…,n} when t=xi?

      Zero

    5. What is the degree of the polynomial interpolant of data 𝒟={(xi,yi=f(xi),yi'=f'(xi)),i=0,1}?

      The four conditions determine a cubic polynomial, degree=3.

2Track 2

  1. Construct the Hermite interpolant of data 𝒟={(xi,yi=f(xi),yi'=f'(xi)),i=0,1}={(1,3,2),(4,-18,-25)} in Newton form.

    Solution. The four conditions determine a polynomial of degree 3

    p(t)=y0+[y0,y0](t-x0)+[y1,y0,y0](t-x0)2+[y1,y1,y0,y0](t-x0)2(t-x1)

    For the repeated points

    [y0,y0]=y0'=2,[y1,y1]=y1'=-25
    i xi [yi] [yi,yi-1] [yi,yi-1,yi-2] [yi,yi-1,yi-3] 0 1 3 - - - 0 1 3 2 - - 1 4 -18 -7 -3 - 1 4 -18 -25 -6 -1

    The resulting polynomial is

    p(t)=3+2(t-1)-3(t-1)2-(t-1)2(t-4)
  2. Construct the Hermite interpolant of the above data in Lagrange form.

    Solution. The Lagrange form of a first-order Hermite interpolant is

    p(t)=∑i=0n[⁡ai(t)⁡yi+bi(t)⁡yi'],

    where ai(xj)=δi⁡j, ai'(xj)=0, bi'(xj)=δi⁡j, bi(xj)=0. A polynomial q(t) has a simple root r if

    q(r)=0,q'(r)≠0,

    and a double root if

    q(r)=0,q'(r)=0,q''(r)≠0.

    The Lagrange basis polynomials

    ℓi(t)=∏j=0n't-xjxi-xj

    satisfy ℓi(xj)=δi⁡j.

    The conditions ai(xj)=δi⁡j, ai'(xj)=0 at j≠i state that ai(t) has n double roots, {x0,..,xn}\{xi}, hence ai(t) is proportional to ℓi2(t). Since 2⁡ℓi(t)ℓi'(t) satisfies derivative conditions at j≠i, increase degree by one for the additional derivative condition at t=xi

    ai(t)=(ci+⁡di⁡t)⁡ℓi2(t).

    Impose ai(xi)=1, ai'(xi)=0 to obtain

    ci+di⁡xi=1
    ai'(t)=di⁡ℓi2(t)+2⁡(ci+di⁡t)⁡ℓi(t)ℓi'(t)⇒di+2(ci+di⁡xi)ℓi'(xi)=0

    with solution

    di=-2ℓi'(xi),⁡ci=1+2ℓi'(t)⁡xi,

    and

    ai(t)=[1-2(t-xi)ℓi'(xi)]⁡ℓi2(t)⁡.

    The conditions bi'(xj)=δi⁡j, bi(xj)=0, state {x0,..,xn}\{xi} are double roots and xi is a simple root, immediately satisfied by

    bi(t)=A(t-xi)ℓi2(t)⁡.

    Evaluating the derivative bi'(t)=Aℓi2(t)+2⁡A(t-xi)ℓi(t)ℓi'(t) at xi gives

    bi(xi)=A

    hence bi'(xi)=1 leads to A=1.

    For given data

    ℓ0(t)=t-x1x0-x1,ℓ0'(t)=1x0-x1,ℓ1(t)=t-x0x1-x0,ℓ1'(t)=1x1-x0
    a0(t)=[1-2t-x0x0-x1](t-x1x0-x1)2,b0(t)=(t-x0)(t-x1x0-x1)2,
    a1(t)=[1-2t-x1x1-x0](t-x0x1-x0)2,b1(t)=(t-x1)(t-x0x1-x0)2.
  3. Present a spline interpolant S of data set 𝒟={(xi=i⁡h,yi=f(xi)),i=0,..,n}, h=π/n, where the restriction of S to interval [xi-1,xi] is of the form

    Si(t)=ai+bi⁡cos⁡t+⁡ci⁡sin⁡t

    Solution. There are n intervals, hence 3n parameters (ai,bi,ci) to determine. At i=1,..,n apply interpolation conditions

    Si(xi)=ai+bi⁡cos⁡xi+⁡ci⁡sin⁡xi=yi⁡.

    Add condition at i=0, S1(0)=a1+b1=y0, to define n+1 conditions. At i=1,..,n-1 continuity in derivatives

    Si'(xi)=Si+1'(xi),Si''(xi)=Si+1''(xi),

    defines another 2(n-1) conditions,

    -bi⁡sin⁡xi+ci⁡cos⁡xi=-bi+1⁡sin⁡xi+ci+1⁡cos⁡xi
    -bi⁡cos⁡xi-ci⁡sin⁡xi=-bi+1⁡cos⁡xi-ci+1⁡sin⁡xi

    for a total of 3n-1. One additional condition can be defined, say

    S1'(x0)=Sn'(xn),

    to complete the system.

  4. Find the best inf-norm approximant of f:[0,π/2]→ℝ, f(t)=cos⁡t

    Solution. The family from which to take the approximant was not specified, hence can be freely chosen, for example a constant g(t)=c. By the equioscillation theorem f(0)-g(0)=-(f(1)-g(1)), leading to

    g(t)=12.
  5. Quiz questions:

    1. True or false: The monomials ℳ(t)={1,t,t2,..} are a basis for C∞(ℝ)

      False. Some functions require an infinite series, e.g., et.

    2. True or false: In a Hilbert space, Cauchy sequences converge to an element within the space

      True, by definition of a Hilbert space as a complete metric space.

    3. What is the degree of the polynomial interpolant of data 𝒟={(xi,yi=f(xi),yi'=f'(xi),yi''=f''(xi)),i=0,1,2}?

      9 conditions, degree = 8

    4. True or false: A best inf-norm approximant within a finite subspace exists for all Banach spaces.

      True, theorem of best approximant.

    5. True or false: There are more polynomials than there are continuous functions.

      False, e.g., et,⁡sin⁡t,⁡cos⁡t are not polynomials but are continuous.