7.
5 Monomial, Lagrange, Newton
a.) Determine the polynomial interpolant to the data
t 1 2 3 4
y 11 29 65 125 using the monomial basis
b.) Determine the Lagrange polynomial interpolant to the same data and show that
the resulting polynomial is equivalent to that obtained in part a.
c.) Compute the Newton polynomial interpolant to the same data using each of the
three methods given in Section 7.3.3 (triangular matrix, incremental interpolation,
and divided differences) and show that each produces the same result as the
previous two methods.
7.7 Error Bound
Reconcile the error bound given in Section 7.3.5 with the behaviour shown in Fig.
7.7 of polynomial interpolants to Runge’s function,
f ( t )=1/(1+ 25 t 2 ),
for equally spaced points on [-1, 1].
7.13 Three-term recurrence of Chebyshev
a.) Verify that the Chebyshev polynomials of the first kind, as defined in Section
7.3.4, satisfy the three-term recurrence given there.
b.) Verify that the first six Chebyshev polynomials are as listed in Section 7.3.4.
c.) Verify that the expressions for the roots and extrema of T k given in Section
7.3.4 are correct.
8.4 Derivation of errors for midpoint and trapezoid
Fill in the details of the derivation of the error estimates for the midpoint and
trapezoid quadrature rules given in Section 8.3.1. In particular, show that the odd-
order terms drop out in both cases, as claimed.
8.6 Lagrange
Suppose that Lagrange interpolation at a given set of nodes x 1 , … , x n is used to
derive a quadrature rule. Prove that the corresponding weights are given by the
b
integrals of the Lagrange basis functions, w i=∫ l i ( x ) dx ,i=1 , … , n.
a
8.10 Newton-Coates and undetermined coefficients
Newton-Cotes quadrature rules are derived by fixing the nodes and then
determining the corresponding weights by the method of undetermined coefficients
so that the degree is maximized for the given nodes. The opposite approach could
also be taken, with the weights constrained and the nodes to be determined. In a
Chebyshev quadrature rule, for example, all of the weights are taken to have the
same value, w, thereby eliminating n multiplications in evaluating the resulting
quadrature rule, since the single weight can be factored out of the summation.
a.) Use the method of undetermined coefficients to determine the nodes and weight
for a three-point Chebyshev quadrature rule on the interval [-1, 1].
b.) What is the degree of the resulting rule?
8.15 Richarson Extrapolation (Archimedes)
Archimedes approximated the value of π by computing the perimeter of a regular
polygon inscribing or circumscribing a circle of diameter.
1. The perimeter of an inscribed polygon with n sides is given by
pn=n sin ( π /n ) ,
and that of a circumscribed polygon by
q n=n tan ( π /n ) ,
and these values provide lower and upper bounds, respectively, on the value of π .
a.) Using the power series expansions for the sine and tangent functions, show that
pn and q n can be expressed in the form
pn=a0 +a1 h2 +a2 h 4+ … and q n=b 0+ b1 h2+ b2 h4 + … ,
where h=1/n. What are the true values of a 0 and b 0?
b.) Given the values p6=3.0000 and p12=3.1058, use Richardson extrapolation to
produce a better estimate for π . Similarly, given the value q 6=3.4641 and q 12=3.2154,
use Richardson extrapolation to produce a better estimate for π .
9.2 Write ODES as first order
Write each of the following ODEs as an equivalent first-order system of ODEs:
a.) Van der Pol equation:
y ' ' = y ' ( 1− y 2 )− y .
b.) Blasius equation:
y ' ' ' =− yy ' ' .
c.) Newton’s Second Law of Motion for two-body problem:
y '1' =−GM y 1 /( y 21 + y 22)3 /2 ,
y '2' =−GM y 2 /( y 21 + y 22 )3 / 2.
9.3 Stable Solutions
Are solutions of the following system of ODEs stable?
y '1=− y 1 + y 2,
y '2=−2 y 2.
9.8 IVP, backward Euler, Newton, Euler
Consider the IVP for the ODE y '=− y 2 with the initial condition y ( 0 )=1. We will
use the backward Euler method to compute the approximate value of the solution
y 1 at time t 1=0.1 (i.e., take one step using the backward Euler method with the step
size h=0.1 starting from y 0=1 at t 0=0). Since the backward Euler method is
implicit, and the ODE is nonlinear, we will need to solve a nonlinear algebraic
equation for y 1.
a.) Write out that nonlinear algebraic equation for y 1.
b.) Write out the Newton iteration for solving the nonlinear algebraic equation.
c.) Obtain a starting guess for the Newton iteration by using one step of Euler’s
method for the ODE.
d.) Finally compute an approximate value for the solution y 1 by using one iteration
of Newton’s method for the nonlinear algebraic equation.
