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.
Construct the polynomial interpolant of data in Lagrange form.
Solution. The Lagrange form of the interpolant of is
For the given data,
with
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
For the above data construct the divided difference table
The interpolant is
Efficiently evaluate the Newton form of the polynomial interpolant determined above at , using Horner's scheme.
Solution. The above interpolant is evaluated as
Replace the sampling points , in the data set so as to minimize the interpolation error over the interval
Solution. The interpolation error is minimized for the Chebyshev points, in this case the roots of , rescaled to cover the interval
First, determine through the recursion
Denote and find roots of quadratic
Quiz questions:
True or false: a basis exists for all vector spaces.
True
True or false: a basis can be effectively constructed for all vector spaces.
False
What is the projection of along in a Hilbert space spanned by ?
, with denoting scalar product in the Hilbert space
What is the error of a polynomial interpolant of , sampled by when ?
Zero
What is the degree of the polynomial interpolant of data ?
The four conditions determine a cubic polynomial, degree=3.
Construct the Hermite interpolant of data in Newton form.
Solution. The four conditions determine a polynomial of degree 3
For the repeated points
The resulting polynomial is
Construct the Hermite interpolant of the above data in Lagrange form.
Solution. The Lagrange form of a first-order Hermite interpolant is
where , , , . A polynomial has a simple root if
and a double root if
The Lagrange basis polynomials
satisfy .
The conditions , at state that has double roots, , hence is proportional to . Since satisfies derivative conditions at , increase degree by one for the additional derivative condition at
Impose , to obtain
with solution
and
The conditions , , state are double roots and is a simple root, immediately satisfied by
Evaluating the derivative at gives
hence leads to .
For given data
Present a spline interpolant of data set , , where the restriction of to interval is of the form
Solution. There are intervals, hence parameters to determine. At apply interpolation conditions
Add condition at , , to define conditions. At continuity in derivatives
defines another conditions,
for a total of . One additional condition can be defined, say
to complete the system.
Find the best inf-norm approximant of ,
Solution. The family from which to take the approximant was not specified, hence can be freely chosen, for example a constant . By the equioscillation theorem , leading to
Quiz questions:
True or false: The monomials are a basis for
False. Some functions require an infinite series, e.g., .
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.
What is the degree of the polynomial interpolant of data ?
9 conditions, degree = 8
True or false: A best inf-norm approximant within a finite subspace exists for all Banach spaces.
True, theorem of best approximant.
True or false: There are more polynomials than there are continuous functions.
False, e.g., are not polynomials but are continuous.