Scribd
Upload
45 views2 pages

MA 214: Introduction To Numerical Analysis, Spring 2014: Mid-Semester Examination

This document provides instructions and questions for a mid-semester examination in a numerical analysis course. It includes 6 questions testing concepts like polynomial interpolation, numerical integration, solving systems of equations, and orthonormal polynomials. Students are instructed to write identifying information on their answer book and that calculators are not permitted.

Uploaded by

Nishal Caleb
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
45 views2 pages

MA 214: Introduction To Numerical Analysis, Spring 2014: Mid-Semester Examination

This document provides instructions and questions for a mid-semester examination in a numerical analysis course. It includes 6 questions testing concepts like polynomial interpolation, numerical integration, solving systems of equations, and orthonormal polynomials. Students are instructed to write identifying information on their answer book and that calculators are not permitted.

Uploaded by

Nishal Caleb
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
You are on page 1/ 2

MA 214: Introduction to Numerical Analysis, Spring 2014

Mid-Semester Examination

Wednessday, 14:00 - 16:00


February 19, 2014 Weightage 30%

• Write roll number, division and tutorial batch on the main answer book and on the supplements.
Complete the index on the top page of your answer book. Failure to do so will invite a penalty
of 2 marks.

• Use of calculators is not permitted.

1. (a) Let f : [a, b] → IR and x0 , x1 , · · · , xn be n + 1 distinct points in [a, b]. Show that there exists
a polynomial pn of degree ≤ n such that

pn (xi ) = f (xi ), i = 0, 1, · · · , n,

and that it is unique. (2 marks)


(b) Define the divided difference f [x0 , x1 , · · · , xn ] as the coefficient of xn in pn in part (a). Prove
the following recurrence formula.
f [x1 , · · · , xn ] − f [x0 , · · · , xn−1 ]
f [x0 , x1 , · · · , xn ] = .
xn − x0
(3 marks)

2. Let f : [a, b] → IR be 4 times continuously differentiable function.

(a) Write down the formula for the cubic polynomial p3 (x) which interpolates f and f 0 at a
and at b and for the error associated with this cubic Hermite interpolation.
(2 marks)
(b) Let
a = t0 < t1 < · · · < tn = b
b−a
be an uniform partition of [a, b] and let h = ti+1 − ti = , i = 0, 1, . . . , n − 1.
n
Let g : [a, b] → IR be a piecewise cubic polynomial with respect to the above partition and
be such that
g(ti ) = f (ti ), g 0 (ti ) = f 0 (ti ), i = 0, 1, . . . , n.
Show that the maximum error kf − gk∞ = max |f (x) − g(x)| is of the order of h4 .
x∈[a,b]
(3 marks)

1
3. (a) Consider the quadrature rule
Z 1  
1 1 2
f (x)dx ≈ f (0) + 3f ( ) + 3f ( ) + f (1) .
0 8 3 3

Determine the degree of precision of this rule. (2 marks)


(b) Derive the Trapezoidal rule along with the error formula. (3 marks)

4. (a) Let f : [a, b] → IR be thrice differentiable function and x0 ∈ [a, b]. Show that
d
f [x0 , x] = f [x0 , x, x]. (2 marks)
dx
(b) Let A = [aij ] be an invertible tridiagonal matrix, that is aij = 0 if |i − j| > 1. Compute
the number of operations needed to solve the system Ax = b by Gauss elimination without
partial pivoting. (3 marks)

5. Let  
1 2 3 4
2 5 8 11
 
A= .
 
 3 8 14 20 
4 11 20 30
Find a lower triangular matrix L with all the diagonal entries equal to 1 and an upper triangular
matrix U such that A = LU. Also, find the determinant of A. (5 marks)

6. Let q0 , q1 , . . . be the orthonormal polynomials with respect to the usual inner product
Z b
hf, gi = f (x)g(x)dx
a

obtained by applying an orthonormalization process to {1, x, x2 , . . .}. Note that

span{q0 , q1 , . . . , qn+1 } = span{1, x, . . . , xn+1 }.

Let
qn+1 (x) = αn+1 (x − x0 )(x − x1 ) · · · (x − xn ).
For i = 0, 1, . . . , n, let
n
Y (x − xp )
li (x) =
p=0
(xi − xp )
p6=i

denote the Lagrange polynomial. Show that


n
X
(a) li (x) = 1, (1 mark)
i=0
Z b
(b) li (x)lj (x)dx = 0, if i 6= j, (2 marks)
a
Z b
(c) li (x)dx > 0, i = 0, 1, . . . , n. (2 marks)
a

————————–

You might also like