Scribd
Upload
9 views2 pages

Problem Set On Interpolation

This document outlines an assignment for a Numerical Analysis course focused on interpolation techniques, specifically Lagrange Interpolation and Neville's method. It includes various problems requiring the construction of interpolation polynomials, error analysis, and the application of interpolation methods to specific functions. The assignment also explores the uniqueness of polynomial interpolants and convergence properties of polynomial approximations.

Uploaded by

coolboygkp07
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views2 pages

Problem Set On Interpolation

This document outlines an assignment for a Numerical Analysis course focused on interpolation techniques, specifically Lagrange Interpolation and Neville's method. It includes various problems requiring the construction of interpolation polynomials, error analysis, and the application of interpolation methods to specific functions. The assignment also explores the uniqueness of polynomial interpolants and convergence properties of polynomial approximations.

Uploaded by

coolboygkp07
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MTH 408/522: Numerical Analysis-2024

Assignment -IV
Topic: Interpolation (Lagrange Interpolation)

1. For the given functions f (x), let x0 = 0, x1 = 0.6, and x2 = 0.9. Construct interpolation
polynomials of degree at most one and at most two to approximate f (0.45), and find the absolute
error.

a) f (x) = cos x b) f (x) = ln(x + 1)


√
c) f (x) = 1 + x d) f (x) = tan x

2. Let P3 (x) be the interpolating polynomial for the data (0, 0), (0.5, y), (1, 3), and (2, 2). The
coefficient of x3 in P3 (x) is 6 . Find y.
√
3. Let f (x) = x − x2 and P2 (x) be the interpolation polynomial on x0 = 0, x1 and x2 = 1. Find
the largest value of x1 in (0, 1) for which f (0.5) − P2 (0.5) = −0.25.
√
4. Use Neville’s method to approximate 3 with the following functions and values.

a) f (x) = 3x and the values x0 = −2, x1 = −1, x2 = 0, x3 = 1, and x4 = 2.


√
b) f (x) = x and the values x0 = 0, x1 = 1, x2 = 2, x3 = 4, and x4 = 5.
c) Compare the accuracy of the approximation in parts (a) and (b).

5. Let x0 , . . . , xn be distinct real points, and consider the following interpolation problem. Choose
a function n
X
Pn (x) = cj ejx
j=0

such that
Pn (xi ) = yi i = 0, 1, . . . , n
with the {yi } given data. Show there is a unique choice of c0 , . . . , cn .

6. Let f be a polynomial of degree ≤ n, and let pn be a polynomial interpolant to f , at the n + 1


distinct nodes x0 , x1 , . . . , xn . Prove that pn (x) = f (x) for all x.

7. Assume that for any real c,


cn
lim = 0.
n→∞ n!

Use this to prove that, if pn is the polynomial interpolate to f (x) = sin x on the interval [a, b],
using any distribution of distinct nodes xk , 0 ≤ k ≤ n, then kf − pn k∞ → 0 as n → ∞. Hint:
Can we justify |wn (x)| ≤ cn+1 for some c ?

8. Can you repeat the above for f (x) = ex ? Why/why not?

9. Let P3 (x) be the interpolating polynomial for the data (0, 0), (0.5, y), (1, 3), and (2, 2). Use
Neville’s method to find y if P3 (1.5) = 0.

1
x0 = 0 P0 = 0
x1 = 0.4 P1 = 2.8 P0,1 = 3.5
27
x2 = 0.7 P2 P1,2 P0,1,2 = 7

10. Neville’s method is used to approximate f (0.5), giving the following table. Determine P2 =
f (0.7).

11. Suppose xj = j, for j = 0, 1, 2, 3 and it is known that

P0,1 (x) = x + 1, P1,2 (x) = 3x − 1, and P1,2,3 (1.5) = 4.

Find P0,1,2,3 (1.5).

12. Neville’s Algorithm is used to approximate f (0) using f (−2), f (−1), f (1), and f (2). Suppose
f (−1) was overstated by 2 and f (1) was understated by 3 . Determine the error in the original
calculation of the value of the interpolating polynomial to approximate f (0).

You might also like