Tutorial Sheet – 3

Unit – III (Numerical Analysis) MA-102 (Mathematics – II)

Group A

1. State Newton’s forward and backward interpolation formula and use these to
calculate the value of ( ) from the given data:
1.7 1.8 1.9 2.0 2.1 2.2 2.3
( ) 5.474 6.050 6.686 7.389 8.166 9.025 9.974

2. Using Newton’s forward and backward formula, find the value of ( ) and ( ), if
0.1 0.2 0.3 0.4 0.5 0.6
( ) 2.68 3.04 3.38 3.68 3.96 4.21

3. Find the values ( ) and ( ) if the following data are given:

3 4 5 6 7 8 9
2.7 6.4 12.5 21.6 34.3 51.2 72.9

4. Construct the Lagrange interpolation polynomial using data from the following table:
-1 0 2 5
10 7 7 22

5. Using Lagrange interpolation formula find ( ) from the data in the following table:
5 6 9 11
12 13 14 16

6. Find the real positive root of the equation by fixed point iteration
method correct to two decimal places, assuming the initial approximation is as .

7. Find a real root of correct to three decimal places using fixed point
iteration method.

8. Find the real root of the equation by Newton-Raphson method,

which is near to .

9. Write the Newton-Raphson procedure for finding √ , where p is a real number. Use
it to find √ correct to two decimals, assuming 2.5 as the initial approximation.

10. Find a root of the following equations correct to three significant figures using
Newton's iterative method:
(a) , (b) ,
(c) , (d) , near to .
11. Solve the following system of linear equations by Gauss-Jacobi's and Gauss-Seidal's
method correct up to four decimal places:
(a) , , .
(b) , , .
(c) , , .

12. Perform three iterations of the Gauss-Jacobi's and Gauss-Seidal's iteration method for
solving the system of equations:
(a) , , .
(b) , , .

13. Employ Picard's method to obtain the solution for the differential equation, correct to
four places of decimal,
for , given that when .

14. Using Picard's approximation, obtain a solution up to the fifth approximation of the
equation
, ( ) .

15. Using Picard's approximation, obtain a solution up to the third approximation of the
equation
, ( ) .

16. Evaluate ( ) correct to four places of decimals from , ( ) , by

the Taylor's series method.

17. Employ Taylor's series method to obtain approximate value of at for the
differential equation
, ( ) .
Compare the numerical solution with the exact solution.

18. Apply Runge-Kutta fourth order method, to find an approximate value of when
given that , ( ) .

19. Using Runge-Kutta fourth order method, solve , ( ) at .

20. Solve the initial value problem

( ), ( ) ,
in the interval [2, 2.4] using Runge-Kutta fourth order method with the step size
.
 Group B

dy
1. The fourth order Runge-Kutta (RK4) method to solve an ordinary differential equation dx
=
f (x, y) is given as:
1
y(x + h) = y(x) + (k1 + 2k2 + 2k3 + k4 )
6
h k1
k1 = hf (x, y), k2 = hf (x + , y + )
2 2
h k2
k3 = hf (x + , y + ), k4 = hf (x + h, y + k3 )
2 2
For a special case when the function f depends solely on x, the above RK4 method reduces to
(GATE 2023, CE)

(A) Euler’s explicit method (B) Trapezoidal rule

(C) Euler’s implicit method (D) Simpson’s 1/3 rule

R1
2. The integral 0 (5x3 + 4x2 + 3x + 2)dx is estimate numerically using 3 alternative methods, namely
the rectangle, trapezoidal and Simpson’s rule with a common step size. In this context which one
of the following statements is true? (GATE 2020, CE)

(A) Simpson’s rule, rectangle rule as well as trapezoidal rule of estimation will give nonzero error.

(B) Only Simpson rule will give zero error.

(C) Simpson and rectangle give non-zero error.

(D) Only rectangle will give zero error.

3. Consider the following recursive iteration scheme for different values of variable P with the initial
guess x1 = 1:
 
1 p
xn+1 = xn + , n = 1, 2, 3, 4, 5
2 xn

For P = 2, x5 is obtained to be 1.414, rounded-off to three decimal places. For P = 3, X5 is

obtained to be 1.732, rounded-off to three decimal places.
If P = 10, the numerical value of x5 is ( round off to three decimal places)
(GATE 2022, CE)

4. Consider the differential equation

dy
= 4(x + 2) − y
dx
For the initial condition y = 3 at x = 1, the value of y at x = 1.4 obtained using Euler’s method
with a step-size of 0.2 is . (round off to one decimal place) (GATE 2022, CE)
R1
5. For real numbers α1 and α2 , if the formula −1 f (x)dx = α1 f (− 21 ) + α2 f ( 21 ) is exact for all
polynomials of degree ≤ 1, then 2α1 + 3α2 equals (GATE 2018, XE)
R 1.4
6. Evaluate the definite integral −1 x|x|dx by using Simpson’s 1/3rd (one-third) rule with step size
h = 0.6. (GATE 2020, ME)
 dy
7. An explicit forward Euler method is used to numerically integrate the differential equation dx =y
using a time step of 0.1. With the initial condition y(0) = 1, the value of y(1) computed by this
method is (correct to two decimal places) (GATE 2018, ME)

8. Let f be a three times continuously differentiable real valued function on (0, 5) such that its third
1
derivative f 3 = 100 for all (0,5). If P (x) is a polynomial of degree ≤ 2 such that P (1)= f (1), P (2)
=f (2) and P (3) = f (3) then |f (4) − P (4)| equals (GATE 2018, XE)

9. The initial value problem dy

dt
+ 2y = 0, y(0) = 2 is solved numerically using the forward Euler’s
method with a constant and positive time step of ∆t. Let, yn represent the numerical solution
obtained after n steps. The condition |yn+1 | ≤ |yn | is satisfied if and only if ∆t does not exceed
(Answer in integer) (GATE 2023, ME)

10. The values of abscissa (x) and ordinates (y) of a curve are as follows:

x 2.0 2.5 3.0 3.5 4.0

y 5.00 7.25 10.00 13.25 17.00

By Simpson’s 1/3rd rule, the area under the curve (round off to two decimal places) is
(GATE 2021, CE)
R1
11. Find the value of 0 ex dx using the trapezodial rule with four equal subintervals. (GATE 2021,
CE)

12. The ordinary differential equation dy

dt
= −πy subject to an initial condition y(0) = 1 is solved
numerically using the following scheme:

y(tn+1 ) − y(tn )
= −πy(tn )
h
where h is the time step, tn = nh, and n = 0, 1, 2, .... This numerical scheme is stable for all
values of h in the interval (GATE 2021, ME)
2 π
(a) 0 < h < π
(c) 0 < h < 2
(b) 0 < h < 1 (d) for all h > 0

13. Consider the data of f (x) given in the table.

i 0 1 2
xi 1 2 3
f (xi ) 0 0.3010 0.4771

The value of f (1.5) estimated using second-order Newton’s interpolation formula is

(rounded off to 2 decimal places). (GATE 2024 CE1)

14. The second derivative of a function f is computed using the fourth-order Central Divided Differ-
ence method with a step length h. The correct expression for the second derivative is: (GATE
2024 CE2)
1 1
(a) 12h2
[−fi+2 + 16fi+1 − 30fi + 16fi−1 − fi−2 ] (c) 12h2
[−fi+2 − 16fi+1 + 30fi + 16fi−1 + fi−2 ]
1 1
(b) 12h2
[−fi+2 + 16fi+1 − 30fi + 16fi−1 + fi−2 ] (d) 12h2
[−fi+2 − 16fi+1 + 30fi − 16fi−1 − fi−2 ]
15. The Newton-Raphson method is used to solve f (x) = 0, where f (x) = ex − 5x. If the initial guess
x(0) = 1.0, then find the value of the next iterate x(1) ?, (rounded off to 2 decimal places). (GATE
2024 CH)
dy
16. In order to numerically solve the ordinary differential equation dt
= −y for t > 0, with an initial
condition y(0) = 1 , the following scheme is employed:

yn+1 − yn 1
= − (yn+1 + yn )
∆t 2
Here, ∆t is the time step and yn = y(n∆t) for n = 0, 1, 2, . . . . This numerical scheme will yield a
solution with non-physical oscillations for ∆t > h. The value of h is: (GATE 2024 ME)
1 3
(a) 2
(c) 2
(b) 1 (d) 2

17. The absolute relative error in evaluating the integral

Z 1
x2 dx
0

by the trapezoidal rule with the step size 0.25 is _____ % (rounded off to 2 decimal places).
(GATE 2024 BT)

18. The root of the function,

f (x) = x3 − 2x2 + 3x − 1
in the interval [0, 1] using the bisection method after two iterations, is _____ (rounded off to 2
decimals).(GATE 2024 MN)

19. Let f (x) = |x| + |x − 1| + |x − 2|, x ∈ [−1,

R 22]. Which one of the following numerical integration
rules gives the exact value of the integral −1 f (x) dx (GATE 2024 MA)

(a) The Simpson’s rule. (c) The composite Simpson’s rule by dividing
(b) The trapezoidal rule [−1, 2] into 4 equal subintervals.
(d) The composite trapezoidal rule by dividing
[−1, 2] into 3 equal subintervals.

20. For the initial value problem

y ′ = f (x, y), y(x0 ) = y0 ,
generate approximations yn to y(xn ), xn = x0 + nh, for a fixed h > 0 and n = 1, 2, 3, . . ., using
the recursion formula
yn+1 = yn + ak1 + bk2 ,
where
k1 = hf (xn , yn ), k2 = hf (xn + αh, yn + βk1 ).

Which one of the following choices of a, b, α, βfor the above recursion formula gives the Runge-
Kutta method of order 2? (GATE 2024 MA)

(a) a = 1.5, b = −1, α = 0.5, β = 0.5 (c) a = 0.25, b = 0.75, α = 2/3, β = 2/3
(b) a = 0.5, b = 0.5, α = 2, β = 2 (d) a = 0.5, b = 0.5, α = 1, β = 2