Ma311 Numerical Techniques (Mid - SP23)

Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

BIRLA INSTITUTE OF TECHNOLOGY, MESRA, RANCHI

(MID SEMESTER EXAMINATION SP2023)


CLASS: IMSc SEMESTER : IV/ VI
BRANCH: MATHS & COMPUTING SESSION : SP2023

SUBJECT: MA311 NUMERICAL TECHNIQUES


TIME: 02 Hours FULL MARKS: 25

INSTRUCTIONS:
1. The question paper contains 5 questions each of 5 marks and total 25 marks.
2. Attempt all questions.
3. The missing data, if any, may be assumed suitably.
4. Tables/Data handbook/Graph paper etc., if applicable, will be supplied to the candidates
-----------------------------------------------------------------------------------------------------------------------------

CO BL
Q.1(a) Define the absolute, relative and percentage errors [2] 1 1
Q.1(b) Perform five iterations of Newton’s method to find the real root of 𝑥 − 2𝑥 − 5 = 0 [3] 1 2
with initial guess 𝑥 = 2.

Q.2 Define the convergence rate. Prove that the Newton-Raphson method has second-order [5] 1 3
convergence.

Q.3 Using the Gauss elimination method, find the solution of the system of equations: 𝑥 + [5] 2 2
𝑦 + 𝑧 = 6 ; 3𝑥 + 3𝑦 + 3𝑧 = 20; 2𝑥 + 𝑦 + 3𝑧 = 13

Q.4(a) Determine the maximum absolute row sum norms of the following matrix, [2] 2 2
1 7 −4
4 −4 9 .
12 −1 3

Q.4(b) Perform three iterations of the Gauss-Seidel method to solve the system equations: [3] 2 3
−𝟐𝒙 − 𝒚 = 𝟕; −𝒙 + 𝟐𝒚 − 𝒛 = 𝟏; −𝒚 + 𝟐𝒛 = 𝟏; with initial guess 𝒙𝟎 = (𝟎, 𝟎, 𝟎).

Q.5(a) Using Newton’s divided difference interpolation formula, construct a unique polynomial, [2] 3 2
such that 𝑓(0) = 1, 𝑓( 1) = 3, 𝑓( 3) = 55.
Q.5(b) Find the missing term in the following table: [3] 3 3
x 0 1 2 3 4 5
y 1 2 4 8 k 32

::::::20/02/2023::::::M

You might also like