GATE MATHEMATICS

CHAPTER- 5
NUMERICAL METHODS QUESTIONS
1. Given the differential equation y’ = x-y with initial conditions y(0) = 0. The value of
y(0.1) calculated numerically up to the third place of decimal by the second order Runge-
Kutta method with step size h = 0.1 is (GATE-1993-All)
dy
2. Back ward Euler method for solving the differential equation = f ( x, y ) is specified by
dx
(GATE-1994-CS)
(a) y n+1 = y n + hf ( xn , y n ) (b) y n+1 = y n + hf ( xn+1 , y n+1 )

(c) y n+1 = y n−1 + 2hf (xn , yn ) (d) y n+1 = (1 = h) f ( xn+1 , y n+1 )

3. In the interval [0, Π ] the equation x = cos x has (GATE-1995-CS)

(a) No solution (b) Exactly one solution
(c) Exactly two solutions (d) an infinite number of solutions
4. The iteration formula to find the square root of a positive real number by using the
Newton- Raphson method is (GATE-1995-CS)
3 ( xk + b ) 2
xk + b xk − 2 xk − 1
(a) xk +1 = (b) x k +1 = (c) xk +1 = 2
(d) none
2 xk 2 xk xk + b

5. Let f ( x ) = x − cos x . using Newton Raphson method at the (n+1)th iteration. The point
x n +1 is Computed from x n as (GATE-1995-CS)

6. The formula used to compute an approximation for the second derivative of a function f
at a point x0 is (GATE-1996-CS)

f ( x0 + h ) + f ( x0 − h ) f ( x0 + h ) + f (x0 − h )
(a) (b)
2 2h
f ( x0 + h ) + 2 f ( x0 ) + f ( x0 − h ) f ( x0 + h ) − 2 f ( x 0 ) + f ( x0 − h )
(c) (d)
h2 h2
7. The Newton-Raphson iteration formula for finding 3 c , where c > 0 is,
3 3
2 xn + 3 c 2 xn − 3 c
(a) x n +1 = 2
(b) x n +1 = 2
(GATE-1996-CS)
3xn 3xn

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 225
GATE MATHEMATICS

3 3
2 xn + c 2 xn − c
(c) x n +1 = 2
(d) x n +1 = 2
3xn 3xn

8. The Newton-Raphson method is used to find the root of the equation x2-2. If the
iterations are started from -1, then the iteration will (GATE-1997-CS)
(a) converges to -1 (b) converges to √2
(c) converges to - √2 (d) not converge 2
9. The Newton- Raphson method is to be used to find the root of the equation and f’(x) is
(GATE-1999)
(a) always (b) only if f is a polynomial
(c) only if f(x0)<0 (d) none of the above
10. Given a>0, we wish to calculate its reciprocal value 1/a by using Newton-Raphson
method for f(x) = 0. For a=7 and starting wkith x0 = 0.2. the first 2 iterations will be
(GATE-2005)
(a) 0.11, 0.1299 (b) 0.12, 0.1392 (c) 0.12, 0.1416 (d) 0.13, 0.1428
11. Given a>0, we wish to calculate its reciprocal value 1/a by using Newton-Raphson
method for f(x) = 0. The Newton-Raphson algorithm for the function will be
(GATE-2005)
1 a  a 2
(a) x k +1 =  x k +  (b) xk +1 = xk + xk
2 xk  2

2 a 2
(c) xk +1 = 2 xk − axk (d) xk +1 = xk − xk
2
12. Starting from x0=1, one step of Newton-Raphson method in solving the equation
x 3 + 3 x − 7 = 0 Gives the next value x1 as (GATE-2005)
(a) x1 = 0.5 (b) x1 = 1.406 (c) x1= 1.5 (d) x1 = 2
13. For solving algebraic and transcendental equation which one of the following is used?
(GATE-2005)
(a) Coulomb’s theorem (b) Newton-Rapson method
(c) Euler’s method (d) Stroke’s method
14. Newton-Raphson formula to find the roots of an equation f(x) = 0 is given by
(GATE-2005)
f ( xn ) f ( xn )
(a) xn+1 = xn − (b) xn+1 = xn +
f ' ( xn ) f ' ( xn )

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 226
GATE MATHEMATICS

f ( xn ) xn f ( xn )
(c) xn+1 = (d) xn+1 =
xn f ' ( xn ) f ' ( xn )

15. The real root of the equation xe x = 2 is evaluated using Newton-Raphson’s method. If the
first approximation of the value of x is 0.8679 the second approximation of the value of x
correct to three decimal places is (GATE-2005)
(a) 0.865 (b) 0.853 (c) 0.849 (d) 0.838
16. Match the following and choose the correct combination (GATE-2005)
Group-I Group-П
E. Newton-Raphson method non-linear equations 1. Solving
F. Rungue-kutta method linear simultaneous equations 2. Solving
G. Simpson’s Rule ordinary differential equations 3. Solving
H. Gauss elimination integration method 4. Numerical
5. Interpolation
6. Calculation of Eigen values
(a) E-6, F-1, G-5, H-3 (b) E-1, F-6, G-4, H-3
(c) E-1, F-3, G-4, H-2 (d) E-5, F-3, G-4, H-1
17. The polynomial P(x) = x5+x+2 has (GATE-2007)
(a) All real roots (b) 3 real and 2 complex roots
(c) 1 real and 4 complex roots (d) all complex roots
18. Identify the Newton-Raphson iteration scheme for finding the square root of 2
(GATE-2007)
1 2  1 2 
(a) x n +1 =  x n +  (b) x n +1 =  x n − 
2 xn  2 xn 

 2 
(c) x n +1 =   (d) xn+1 = 2 + xn
 xn 
19. Given that one root of the equation x 3 − 10 x 2 + 31 x − 30 = 0 is 5 then other roots are
(GATE-2007)
(a) 2 and 3 (b) 2 and 4 (c) 3 and 4 (d) -2 and -3
20. The following equation needs to be numerically solved using the Newton-Raphson
method x 3 + 4 x − 9 = 0 . The iterative equation for this purpose is (k indicates the iteration
level) (GATE-2007)

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 227
GATE MATHEMATICS

3 3
2 xk + 9 3xk + 9
(a) x k +1 = 2
(b) x k +1 = 2
3 xk + 4 2 xk + 4
2
3 2 4 xk + 3
(c) xk +1 = xk − 3xk + 4 (d) x k +1 = 2
9 xk + 2

21. Match the exercise and choose the correct one out of the alternatives A,B,C,D
(GATE-2007)
Group-I Group-П
P. Second order differential equations 1. Runge-kutta method
Q. Non-linear algebraic equations 2. Newton-Raphson method
R. Linear algebraic equations 3. Gauss elimination
S. Numerical integration 4. Simpson’s rule
(a) P-3, Q-2, R-4, S-1 (b) P-2, Q-4, R-3, S-1
(c) P-1, Q-2, R-3, S-4 (d) P-1, Q-3, R-2, S-4
22. The equation x 3 − x 2 + 4 x − 4 = 0 is to be solved using the Newton- Raphson method. If
x = 2 taken as the initial approximation of the solution then the next approximation using
this method will be (GATE-2007)
(a) 2/3 (b) 4/3 (c) 1 (d) 3/2
23. Equation e x − 1 = 0 is required to be solved using Newton’s method with an initial guess
x0 = −1. Then after one step of Newton’s method estimate x1 of the solution will be given
by (GATE-2008)
(a) 0.71828 (b) 0.36784 (c) 0.20587 (d) 0.0000
24. It is known that two roots of the non-linear equation x 3 − 6 x 2 + 11 x − 6 = 0 are 1 and 3.
The third Root will be (GATE-2008)
(a) j (b) – j (c) 2 (d) 4
25. The recursion relation to solve using Newton-Raphson method is (GATE-2008)
(a) xn+1 = e − xn (b) xn+1 = xn − e − xn

=
(1 + xn )e − x n
x − (1 + xn )e − xn − 1
2
(c) xn+1 (d) x n +1 = n
(1 + e ) − xn
x n − e − xn

1 R 
26. The Newton-Raphson iteration x n +1 =  x n +  can be used to compute the
2 xn 
(GATE-2008)

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 228
GATE MATHEMATICS

(a) Square of R (b) Reciprocal of R (c) Square root of R (d) logarithm of R

27. Let x2-117 = 0. The iterative steps for the solution using Newton-Raphson’s method is
given by (GATE-2009)

1 117   117 
(a) x k +1 =  x k +  (b) x k +1 =  x k − 
2 x k   x k 

 x  1 117 
(c) xk +1 =  xk − k  (d) x k +1 = x k −  x k + 
 117  2 x k 

28. During the numerical solution of a first order differential equation using the Euler (also
known as Euler Cauchy) method with step size h, the local truncation error is of the order
of (GATE-2009)
(a) h2 (b) h3 (c) h4 (d) h5
dy (x )
29. Consider a differential equation − y (x ) = x with initial condition y (0 ) = 0 . Using
dx
euler’s first order method with a step size of 0.1 then the value of y(0.3) is
(GATE-2010)
(a) 0.01 (b) 0.031 (c) 0.0631 (d) 0.1
30. Newton-Rap son method is used to compute a root of the equation x 2 − 13 = 0 with 3.5 as
the initial value the approximation after one iteration is (GATE-2010)
(a) 3.575 (b) 3.677 (c) 3.667 (d) 3.607

31. A numerical solution of the equation f ( x ) = x + x − 3 can be obtained using Newton-

Raphson method. If the starting value is x = 2 for the iteration then the value of x that is
to be used in the next step is (GATE-2011)
(a) 0.306 (b) 0.739 (c) 1.694 (d) 2.306
32. The square root of a number N is to be obtained by applying Newton-Raphson iteration
to the equation x 2 − N = 0 If i denote the iteration index, the correct iterative scheme will
be (GATE-2011)

1 N 1 2 N 
(a) xi +1 =  xi +  (b) xi +1 =  xi + 2 
2 xi  2 xi 

1 N2 1 N
(c) xi +1 = x
 i +  (d) xi +1 =  xi − 
2 xi  2 xi 

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 229
GATE MATHEMATICS

33. Solution, the variable x1 and x 2 for the following equations is to be obtained by
employing the Newton-Raphson iteration method (GATE-2011)
10 x 2 − sin x1 − 0.8 = 0
Equation 2
10 x 2 − 10 x 2 − cos x1 − 0.6 = 0

Assuming the initial values x1 = 0.0 and x2 = 1.0 the Jacobean matrix is
10 − 0.8 10 0   0 − 0.8 10 0 
(a)   (b)   (c)   (d)  
 0 − 0.6  0 10 10 − 0.6 10 −10
1.5
dx
34. The estimate of ∫ x obtained using simpson’s rule with three-point function evaluation
0.5

exceeds the exact value by

(a) 0.235 (b) 0.068 (c) 0.024 (d) 0.012
35. When the Newton-Raphson method is applied to solve the euqaiton
f ( x ) = x3 + 2 x − 1 = 0 , the solution at the end of the first iteration with the initial value
as x0 = 1.2 is

(a) -0.82 (b) 0.49 (c) 0.705 (d) 1.69

dy
36. While numerically solving the differential equation + 2 xy 2 = 0, y ( 0 ) = 1 using
dx
Euler’s predictor corrector (improved Euler-Cauchy) method with a step size of 0.2, the
value of y after the first step is
(a) 1.00 (b) 1.03 (c) 0.97 (d) 0.96
37. Match the application to appropriate numerical method
Applications:
P1: Numerical integration
P2: Solution to a transcendental equation
P3: Solution to a system of linear equations
P4: Solution to a differential equation
Numerical Method:
M1: Newton-Raphson Method
M2: Runge-Kutta Method
M3: Simpson’s 1/3-rule

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 230
GATE MATHEMATICS

M4: Gauss Elimination Method

The function f ( x ) = e − 1is to be solved using Newton-Rapshon method. If the initial

x
38.
value of x0 is taken 1.0, then the absolute error observed at 2nd iteration is

39. The iteration step in order to solve for the cube roots of a given number ‘N’ using the
Newton-Raphson’s method is

1 1 N
(a) xk +1 = xk +
3
( N − xk3 ) (b) xk +1 =  2 xk +
3

xk2 

1 1 N
(c) xk +1 = xk −
3
( N − xk3 ) (d) xk +1 =  2 xk −
3

xk2 
40. The real root of the equation 5 x − 2cos x = 0 (up to two decimal accuracy) is
dy
41. Consider an ordinary differential equation = 4t + 4. If x = x0 at t = 0 , the increment
dx
in x calculated using Runge-Kutta fourth order multi-step method with a step size of
∆t = 0.2 is
(a) 0.22 (b) 0.44 (c) 0.66 (d) 0.88

If the equation sin ( x ) = x is solved by Newton Raphson’s method with the initial guess
2
42.
of x = 1, then the value of x after 2 iterations would be

43. A non-zero polynomial f ( x ) of degree 3 has roots at x = 1, x = 2 and x = 3 . which one

of the following must be TRUE?
(a) f ( 0 ) f ( 4 ) < 0 (b) f ( 0 ) f ( 4 ) > 0 (c) f ( 0 ) + f ( 4 ) > 0 (4) f ( 0 ) + f ( 4 ) < 0

44. In the Newton-Raphson method, an initial guess of x0 = 2 is made the sequence

x0 , x1 , x2 ,..... is obtained for the function
Consider of the statement
(I) x3 = 0

(II) The method converges to a solution in a finite number of iterations

Which of the following is TRUE?
(a) Only I (b) Only II (c) Both I and II (d) Neither I nor II

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 231
GATE MATHEMATICS

3 9
45. Simpson’s 1 rule is used to integrate the function f(x) = x 2 + b/w x =0 and x =1
3 5 5
using least numbers of subintervals the value of integral is (GATE – ME-15)

46. The values of the function f(x) at 5 discrete points are given below (GATE – ME-15)
x 0 0.1 0.2 0.3 0.4
f(x) 0 10 40 90 160
0.4
Using Trapezoidal rule with step size of 0.1, the value of ∫
0
f ( x ) dx

47. Using a unit stpe size the value of ∫ x ln xdx by trapezoidal rule
1
(GATE – ME-15)

48. N-R method is used to find the roots the equation x3 + 2 x 2 + 3x − 1 = 0 . If the initial
guesses x0 =1, then value of x after 2nd iterations is (GATE – ME-15)

49. The quadratic equation x 2 − 4 x + 4 = 0 is to be solved numerically, starting with the

initial guess x0 =3. The N-R method is applied once to get new estimate and secant
method is applied once using initial guess and this new estimate. The estimated value of
root after the application of second method is (GATE – CE-15)
50. In N-R iterative method, the initial guess value xini is considered as ‘0’ while finding the
roots of the equation f ( x) = −2 + 6 x − 4 x 2 + 0.5 x3 . The correction ∆x to be added to xini
in the first iteration is (GATE – CE-15)
51. For stepsize ∆x =0.4 the value of the following integral using simpson’s 1 rule
3
0.8

∫ (0.2 + 25 x − 200 x
2
+ 675 x 3 − 900 x 4 + 400 x 5 )dx (GATE – CE-15)
0

52. The solution of a nonlinear equation x3 − x = 0 is to be obtained by N-R method. If the

initial guess is x = 0.5, the method converges to which one of the following values
(GATE – CE-15)
A) -1 B) 0 C) 1 D) 2
3
53.The root of the function f(x) = x +x-1 obtained after first iteration on application of Newton-
Raphson scheme using an initial guess of x0=1 is (GATE – ME-16)

(A) 0.682 (B) 0.686 (C) 0.750 (D) 1.000

54.Solve the equation j = 10 cos(j) using the Newton-Raphson method. The initial guess is j =
û/4. The value of the predicted root after the first iteration, up to second decimal, is ______

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 232
GATE MATHEMATICS

(GATE – ME-16)
55. Gauss-Seidel method is used to solve the following equations (as per the given order):
j1 + 2j2 + 3j3 = 5

2j1 + 3j2 + j3 = 1

3j1 + 2j2 + j3 = 3
Assuming initial guess as j1 = j2 = j3 = 0, the value of j3 after the first iteration is ____
(GATE – ME-16)

56.Numerical integration using trapezoidal rule gives the best result for a single variable
function, which is (GATE – ME-16)
(A) linear (B) parabolic (C) logarithmic (D) hyperbolic

57.The error in numerically computing the integral þU ’‡„ j + “’ j Žj using the trapezoidal
ù

rule with three intervals of equal length between 0 and û is __________ (GATE – ME-16)
58. Consider the first order initial value problem (GATE – EC-16)
y' = y + 2x − x 2 , y (0) = 1, (0 ≤ x < ∞ )
with exact solution y( x) = x 2 + e x . For x = 0.1 the percentage difference between the exact
solution and the solution obtained using a single iteration of the second-order Runge-Kutta
method with step-size h = 0.1 is _______

59.Newton-Raphson method is to be used to find root of equation 3j − gj + sin j = 0. If the

initial trial value for the root is taken as 0.333, the next approximation for the root would be
________ (GATE – CE-16)
(note: answer up to three decimal)

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 233
GATE MATHEMATICS

NUMERICAL METHODS SOLUTIONS

1Sol.

Given y = x − y.......(1)
1

dy
= f ( x, y ) where f ( x, y ) = x − y
dx
Also given y ( 0 ) = 0.......( 2 )

and h = 0.1
y ( 0.1) = ?

1
Let 2nd order rungue-Kulta method is given by y1 = y ( x1 ) = y0 + ( k1 + k2 )
2
where k1 = hf ( x0 , y0 ) and k2 = hf ( x0 + h, y0 + k1 )

k1 = ( 0.1) [ x0 − y0 ] = ( 0.1)( 0 − 0) = 0

k2 ( 0.1) ( x0 + h ) − ( y0 + k1 ) 

= ( 0.1)  0 + 0.1 − ( 0 + 0 )  = 0.01

1
y1 = y ( 0.1) = 0 + ( 0 + 0.01)
2
0.01 1 1
= = =
2 2 × 100 200
2Sol. (a)

(
Back ward Euler method is given by yn+1 = yn + hf xn−1, yn−1 )
3Sol. (b)
Let f ( x ) = x − cos x = 0

−π 0 π 2π

The curves y = x and y = cos x intersect at only one point in the interval ( 0, π )

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 234
GATE MATHEMATICS

∴ The equation has exactly one solution in [ 0,π ]

4sol. (b)

Let x = b ( or ) x 2 − b = 0

Let f ( x ) = x − b and f ( x) = 2x
2 1

f ( xn )
xn +1 = xn − 1 = xn −
( xn2 − b )
f ( xn ) 2 xn

2 xn2 − xn2 + b xn2 + b

= =
2 xn 2 xn
5Sol.
Given f ( x ) = x − cos x

⇒ f 1 ( x ) = 1 + sin x
Newton-Raphson method is given by
f ( xn )
X n +1 = xn −
f 1 ( xn )

 xn − cos ( xn ) 
xn +1 = xn − 
1 + sin ( xn ) 

6Sol. (d)
The finite difference approximation for the 2nd derivative of a function f at a apint x0 is

f ( x0 + h ) − 2 f ( x0 ) + f ( x0 − h )
f 11 ( x ) =
h2
7Sol. (c)
3
Let x = 3 c then x − c = 0

⇒ f ( x ) = x3 − c = 0 and f 1 ( x ) = 3x2
Newton-Raphson method is givne by
f ( xn )
xn+1 = xn −
f 1 ( xn )

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 235
GATE MATHEMATICS

= xn −
(x 3
n − c)
=
3 xn3 − xn3 + c
3 xn2 3 xn2

2 xn3 + c
xn +1 =
3 xn2
8sol. (c)

Let f ( x ) = x − 2 and x0 = −1
2

f ( xn )
xn+1 = xn −
f 1 ( xn )

= xn −
(x 2
n − 2)
=
(x 2
n + 2)
2 xn 2 xn

xn+1 =
(x 2
n + 2)
2 xn

x02 + 2 1 + 2 −3
x1 = = = = −.15
2 x0 −2 2

x 2 + 2 ( −1.5 ) + 2
2

x2 = 1 =
2 x1 2 ( −1.5 )

9 17
+2
=4 = 4 = −1.4166
−3 −3

x22 + 2 ( −1.4166 ) + 2
2

x3 = =
2 x2 2 ( −1.4166 )

2.0067 + 2
= = −1.4141
−2.8332
Continuous like this, the value convency ~ −1.4141
9Sol. (d)
Newton Raphson formula converges provided the initial approximation x0 is chosen
sufficiently close to the root
10Sol. (b)

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 236
GATE MATHEMATICS

1 1
Let x = ( or ) − a = 0
a x
1
Taking f ( x ) = −a
x
1
⇒ f 1 ( x) = −
x2
Newton Raphson formula gives
f ( xn )
xn+1 = xn −
f 1 ( xn )

1 
 − a
x
= xn −  n −2  = 2 xn − axn2
− xn

xn+1 = 2 xn − axn2 for n = 0,1,2,....

Given a = 7 and x0 = 0.2

x1 = 2 x0 − ax02 = 2 ( 0.2 ) − 7 ( 0.2 )

2

= 0.4 − 7 ( 0.04 ) = 0.12

x1 = 0.12

x2 = 2 x1 − ax12 = 2 ( 0.12 ) − 7 ( 0.12 )

2

= 0.24 − 7 ( 0.0144 )
= 0.24 − 0.1008 = 0.1392
∴ x2 = 0.1392
11Sol. (c)
1 1
Let x = ( or ) − a = 0
a x
1 1
Then take f ( x ) = − a and f 1 ( x ) = − 2
x x
f ( Xn )
Now the Newton Raphson formula gives X n+1 = X n −
f 1( Xn )

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 237
GATE MATHEMATICS

 1 
 − a
X
= Xn −  n  = X +  1 − a X 2
1 n   n
− 2  Xn 
Xn

X n+1 = 2 X n − aX n2 for n = 0,1,2,3,.....

12Sol. (c)

Given f ( x ) = x + 3x − 7 and x0 = 1 ⇒ f ( x ) = 3x2 + 3,

3 1

Newton Raphson’s formula is

f ( Xn )
X n+1 = X n −
f 1( Xn )

f ( X0 ) f (1)
X1 = X 0 − =1− 1
f ( X0 )
1
f (1)

= 1−
( −3) = 3 = 1.5
6 2
∴ X 1 = 1.5
13Sol. (b)
Newton Raphson method is one of the method to solve algebraic and transcendental
equations.
14Sol. (a)
Newton-Raphson formula is
f ( Xn )
X n+1 = X n − n = 0,1,2,3,.......
f 1( Xn )
15Sol. (b)

Given f ( x ) = xe − 2 = 0
x

and x1 = 0.8679 (Q f ( x ) = xe
1 x
+ ex )

Newton-Raphson’s method is given by

f ( x1 )
x2 = x1 −
f 1 ( x1 )

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 238
GATE MATHEMATICS

= 0.8679 −
( 0.8679e 0.8679
− 2)
( 0.8679e 0.8679
+ e 0.8679 )

= 0.853
16Sol. (c)
E − 1, F − 3, G − 4, H − 2
17Sol. (c)

Given p ( x ) = x + x + 2
5

The signs of all the terms p ( x ) are same. Then p ( x ) = 0 does one change of sign

from − to +
∴ p ( x ) = 0 has at most one negative root

The degree of p ( x ) = 0 is odd then the equation has at least one real root.

But the total roots of p ( x ) = 0 are five. Out of five roots one is negative real root and
remaining 4 are complex roots.
18Sol. (a)

Let x = 2 ( or ) x 2 − 2 = 0

Taking f ( x ) = x − 2 and f ( x ) = 2x
2 1

Newton-Raphson’s formula is
f ( Xn )
X n+1 = X n −
f 1( Xn )

= Xn −
(X 2
n − 2)
=
2 X n2 − X n2 + 2
2Xn 2Xn

X n2 + 2 1  2 
∴ X n−1 = = Xn + 
2Xn 2 Xn 
19Sol. (a)
By verification, 2 and 3 are the roots of a given equation
x 3 − 10 x 2 + 31x − 30 = 0

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 239
GATE MATHEMATICS

i.e. f ( 2 ) = 23 − 10 ( 2 ) + 31( 2 ) − 30 = 0
3

and f ( 3) = 3 − 10 ( 3) + 31( 3) − 30 = 0
3 2

By synthetic division we have

x=5 1 -10 31 -30
0 5 -25 30
1 -5 6 0

( x − 5) ( x 2 − 5x + 6 ) = 0
( x − 5) ( x − 3)( x − 2 )  = 0
∴ x = 5,3, 2
20Sol. (a)

Given f ( x ) = x + 4 x − 9 = 0
3

⇒ f 1 ( x ) = x2 + 4
Newton-Raphson formula is
f ( Xk )
X k +1 = X k −
f 1( Xk )

= Xk −
( X + 4 X − 9)
3
k k

(3 X + 4) 2
k

3 X k3 + 4 X k − X k3 − 4 X k + 9
=
( 3 X k2 + 4 )
2 X k3 + 9
∴ X k +1 =
3 X k2 + 4
21Sol. (c) P-1, Q-2, R-3, S-4
(1) Simpson’s Rule is one of the numerical integration technique (method).
(2) Gauss-elimination method is used to solve only system of linear algebraic equations
(3) Runge-Kutta method is used to solve the ordinary differential equations.
(4) Newton-Raphson method is used to solve the linear and non-linear algebraic equation

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 240
GATE MATHEMATICS

22Sol. (b)
Newton-Raphson formula
f ( Xn )
is X n+1 = X n −
f 1( Xn )

Given f ( x ) = x − x + 4 x − 4 = 0 and x0 = 2
3 2

f ' ( x ) = 3x 2 − 2 x + 4

f ( X0 )
X1 = X 0 −
f 1 ( X0 )

X1 = 2−
(2 3
− 22 + 4 ( 2 ) − 4 )
3( 2 ) − 2 ( 2 ) + 4
2

8
= 2−
12
4
∴ x1 =
3
23Sol. (a)

Given f ( x ) = e − 1 = 0 and x0 = −1
x

⇒ f 1 ( x ) = ex
Newton-Raphson’s formula is
f ( Xn )
X n+1 = X n −
f 1( Xn )

f (X )
X 1 = X 0 − 1 0 = −1 −
( e − 1) −1

f ( X0 ) e −1

1 
 − 1
e 
= −1  = −1 − (1 − e )
1
e
x1 = −2 + e
x1 = 0.71828

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 241
GATE MATHEMATICS

24Sol. (c)
d
For the equation ax 3 + bx 2 + cx + d = 0 , product of roots =
a
∴ For the given equation let X be the third root
∴ 1× 3 × X = 6
∴ X =2
25Sol. (c)

Given f ( x ) = x − e
−x
=0

⇒ f 1 ( x ) = 1 + e− x
Newton – Raphson formula is
f ( Xn )
X n+1 = xn −
f 1( Xn )

= Xn −
(X −e ) n
− Xn

(1 + e ) − Xn

X n + X ne− X n − X n + e− X n
=
(
1 + e− X n )
e − X n (1 + X n )
=
(1 + e )
− Xn

26Sol. (c)

1 R 
The given Newton’s iterative formulae X n +1 =  Xn + 
2 Xn 
Let us suppose the formula converges to the root after n iterations
Then X n = X n +1 = x ( root )

1 R
The formula becomes X = X + 
2 X

∴ X= R
27Sol. (a)

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 242
GATE MATHEMATICS

Given f ( x ) = x − 117 = 0
2

⇒ f 1 ( x ) = 2x
Newton-Raphson’s formula is
f ( xk )
xk +1 = xk −
f 1 ( xk )

xk +1 = xk −
(x2
k − 117 )
2 xk

2 xk2 − xk2 + 117 xk2 + 117

= =
2 xk 2 xk

1 117 
∴ xk +1 =  xk + 
2 xk 
28Sol. (a)

( )
In the Euler method, the truncation error is proportional to h 2 denoted as 0 b 2

29Sol. (b)
dy
Given − y = x → (1)
dx
and y ( 0 ) = 0 → ( 2 )

Also given h = 0.1

y ( 0.3) = ?
from (2), we have
dy
x0 = 0, y0 = 0 and f ( x, y ) = = y+x
dx
x1 = x0 + 1h = 0 + 0.1 = 0.1

x2 = x0 + 2h = 0 + 2 ( 0.1) = 0.2

x3 = x0 + 3h = 0 + 3 ( 0.1) = 0.3
Euler’s first order method is given by

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 243
GATE MATHEMATICS

 dy 
y1 = y0 + hf ( x0 , y0 ) = y0 + h  
 dx  p

y1 = 0 + ( 0.1) ( x0 + y0 ) = 0.1[ 0 + 0] = 0.0

y2 = y1 + hf ( x1 , y1 )

= 0.0 + ( 0.1) [1 + 0.0] = 0.0 + 0.01 = 0.01

y3 = y2 + hf ( x2 , y2 )

= 0.01 + ( 0.1) [ 0.2 + 0.01] = 0.01 + 0.021

= 0.031
30Sol. (d)

Given x − 13 = f ( x ) = 0 and x0 = 3.5

2

Newton-Raphson formula is
f ( Xn )
X n+1 = X n −
f 1( Xn )

f ( X0 )
X1 = X 0 −
f 1( X0 )

( 3.5)2 − 13
= 3.5 −   Q f 1 x = 2x
( ( ) )
2 ( 3.5)

= 3.5 − (12.25 ) − 13 = 3.5 −

( −0.75)
7
24.5 + 0.75 25.25
x1 = = = 3.607
7 7
31So. ()

Given f ( x ) = x + x − 3 = 0 & x0 = 2

1
f 1 ( x) = 1+
2 x
Newton-Raphson formula is

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 244
GATE MATHEMATICS

f ( Xn )
X n+1 = X n −
f 1( Xn )

f ( X0 )
⇒ X1 = X 0 −
f 1( X0 )

= 2−
(2 + 2 −3 ) = 1.6939
 1 
1 + 
 2 2
X1 = 1.6939
32Sol. (a)

Given f ( x ) = x − N = 0
2

⇒ f 1 ( x ) = 2x
Newton-Raphson formula is
f ( Xi )
X i +1 = X i −
f 1 ( Xi )

= Xi −
(X i
2
− N)
=
2 X i2 − X i2 + N
2Xi 2Xi

1 N
X i +1 = Xi + 
2 Xi 
33Sol. (b)
Given 10 x2 sin x1 − 0.8 = 0

10 x22 − 10 x2 cos x1 − 0.6 = 0

and x10 = 0.0, x20 = 1.0

let u ( x1 , x2 ) = 10 x2 sin x1 − 0.8

and v ( x1 , x2 ) = 10 x2 − 10 x2 cos x1 − 0.6

2

Then the Jacobian matrix ‘J’ is given by

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 245
GATE MATHEMATICS

u x u x2 
Jk =  1
 vx1 vx2 

10 x cos x1 10sin x1 

J = 2
10 x2 sin x1 20 x2 − 10cos x1  ( x , x20 )
10

10 0 
J =
 0 10
34Sol. (d)
X 0.5 1 1.5
1 2
f (X) = 2 1
X 3
1.5
1 h
By simpson’s rule ∫ X dx = 3 ( y
0.5
0 + 4 y1 + y2 )

1
= ( 2 + 4 + 0.666 ) = 1.111
6
By direct integration
1.5
1
∫ X dX = log
0.5
e 3

Estimated value – Exact value

= 1.111 − 1.0986 = 0.012
35Sol. (c)

Given f ( x ) = x + 2 x − 1 = 0
2

⇒ f 1 ( x ) = 3x 2 + 2 x
x0 = 1.2
The Newton-Raphson iterative formula is
f ( xn ) 1
xn+1 = xn = − f ( xn ) ≠ 0 & n0,1,2,.....
f 1 ( xn )

f (x ) (1.2 ) + 2 (1.2 ) − 1 3

x1 = x0 − 1 0 = 1.2 −  
f ( x0 ) 3(1.2 ) + 2
2

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 246
GATE MATHEMATICS

= 0.705
36Sol. (d)
dy
= −2 xy 2 = f ( x, y )
dx
f ( 0,1) = 0

y1p = y0 + hf ( x0 , y0 ) = 1 + 0.2 ( 0) = 1

h
y1c = y0 +  f ( x0 , y0 ) + f ( x1 , y1p ) 
2
0.2
= 1+ ( 0 − 0.4 ) = 0.96
2
37Sol. (b)
The Numerical methods described the corresponding applications
38Sol. (0.06)

f '( x ) = ex

f ( x0 )  e −1  1
x1 = x0 − = 1−  =
f ' ( x0 )  e  e

f ( x1 )
x2 = x1 −
f ' ( x1 )

1  e1/ e − 1 
= −  1/ e  = 0.06
e  e 
39Sol. (b)
3
Let N = 3 x ⇒ x = N

Let f ( x ) = x − N = 0
3

f ' ( x ) = 3x 2

f ( xn )
∴ xn +1 = xn −
f ' ( xn )

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 247
GATE MATHEMATICS

= xn −
(x 3
n − N)
3 xn2

1  2 xn3 + N 
=  
3  xn2 
40Sol. (0.54)
Let f ( x ) = ( 5 x − 2cos x − 1)

f ' ( x ) = 5 + 2sin x
Apply Newton-Raphson method iteration formula
f ( xn )
xn+1 = xn −
f ' ( xn )

Let x0 = 1then x1 = 0.5631

x2 = 0.5426, x3 = 0.5425
41Sol. (d)
dx
Given that = ( 4t + 4 )
dt
At t = 0, x = x0 = 0

h = 0.2, f ( t , x ) = ( 4t + 4 )
By R-K fourth order method
1
x1 = x0 + ( K1 + 2K 2 + 2K3 + K 4 )
6
where

K1 = hf ( t0 , x0 ) = 0.2 × 4 = 0.8

 h K 
K 2 = hf  t0 + , x0 + 1 
 2 2 

= ( 0.2 )  4 ( 0 + 0.1) + 4  = 0.88

 h K 
K 3 = hf  t0 + , x0 + 2 
 2 2 

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 248
GATE MATHEMATICS

= ( 0.2 )  4 ( 0 + 0.1) + 4  = 0.88

K4 = hf ( t0 + h, x0 + K3 )

= ( 0.2 )  4 ( 0 + 0.2 ) + 4  = 0.96

1
∴ x1 = 0 + 0.8 + 2 ( 0.88) + 2 ( 0.88 ) + 0.96 = 0.88
6
42Sol. (0.73)

f ( x ) = x 2 − sin x

f ' ( x ) = 2 x − cos x

x0 = 1

f ( x0 )  1 − sin1 
∴ x1 = x0 − =1−   = 0.8915
f ' ( x0 )  2 − cos1 

f ( x1 )
x2 = x1 −
f ' ( x1 )

 1 − sin ( 0.89 ) 
= 0.8915 −   = 0.73 (approximately)
 2 − cos ( 0.89 ) 
43Sol. (a)
Let f ( x ) = k ( x − 1)( x − 2 )( x − 3)( k ≠ 0 )

Now f ( 0 ) and f ( 4 ) have opposite signs

∴ f ( 0). f ( 4) < 0
44Sol. (a)

( )
Let f ( x ) = 0.75 x 3 − 2 x 2 − 2 x + 4 = 0

f ' ( x ) = ( 2.25 x 3 − 4 x − 2 )

given x0 = 2

f ( x0 )
x1 = x0 − =0
f ' ( x0 )

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 249
GATE MATHEMATICS

Similarly x2 = x3 = 0, x4 = 2, x5 = 0.....

∴ The iterations will not converge to root.

45. Sol:

X 0 1 1
2
Y 9 39 12
5 20 5

1 1
2 .  9 + 12  + 4  39   = 0.0208
∫0 ydx = 
2  5 5 
  
 20  
46 Sol: By Trapezoidal rule
0.4
h 0.1
∫ f ( x) dx = ( y0 + y4 ) + 2 ( y1 + y2 + y3 )  = ( 0 + 160 ) + 2(10 + 40 + 90)  = 22
0
2 2 

47. Sol:
X 1 2
xlnx 0 2ln2
2
1
By trapezoidal rule ∫ x ln xdx = 2 [0 + 2 ln 2 ] = ln 2 = 0.69
1

f ( x0 )
48. Sol: By N-R method x1 = x0 − = 1− 5 = 1
f ′( x0 ) 10 2

f ( x1 )
2nd iteration x2 = x1 − = 0.3043
f ′( x1 )

49. Sol: f ( x) = x 2 − 4 x + 4 , x0 =3 f ′( x) = 2 x − 4
f ( x0 ) 1
By N-R method x1 = x0 − = 3 − = 2.5
f ′( x0 ) 2
For secant method x0 = 2.5 and x1 =3
By secant method
x1 − x0 (3 − 2.5) 0.5
x2 = x1 − f ( x1 ) = 3 − × f (3) = 3 − ×1 = 2.333
f ( x1 ) − f ( x0 ) f (3). f (2.5) 1 − 0.25
50. Sol: f ( x) = −2 + 6 x − 4 x 2 + 0.5 x3 , f(0)=-2
f ′( x) = 6 − 8 x + 1.5 x 2 , f ′(0) =6

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 250
GATE MATHEMATICS

f ( x0 ) (−2)
By N-R method x1 = x0 − = 0− = 0.333
f ′( x0 ) 6

51. Sol: Given h = ∆x =0.4

X 0 0.4 0.8
f(x) 0.2 24.456 -126.744
0.8
0.4
By Simpson’s 1 rule
3 ∫ f ( x)dx = [(0.2 − 126.744) + 4(24.456)] = −3.8293
0
3
3
52. Sol: f ( x) = x − x initial guess x0 = 0.5
f ( x0 ) (0.5)3 − 0.5
f ′( x) = 3x 2 − 1 , First iteration x1 = x0 − = 0.5 − = −1 ⇒ x1 = −1
f ′( x0 ) 3(0.5) 2 − 1
So, it converges to -1
53. Ans: (C)
Sol: Let f(x) = x3 + x -1 & x0 = 1
Then f’ (x) = 3x2 + 1
øjU  1 + 1 − 1
j% = jU − = 1 − = 0.75
ø F jU  3 + 1
54. Ans: (1.564)

Sol: ÝgÞ øj = j − 10“’j& jU = Ÿ ¢

ù
G

æℎg„ ø ′ j = 1 + 10’‡„j

a Á(
ŸØ ¢
j% = jU − = −
OÛ(  ù √:
Á(
O′ Û(  G Ÿ%n ¢
√:

+
ù W.8µCT
G µ.UT%%
⇒ =1.564

55. Ans: (– 6)
Sol: Let x + 2y +3z =5
2x + 3y + z = 1
3x+2y + z = 3 and x0 = 0, y0 = 0, z0 = 0
Then first iteration will be
x1 = 5– 2y0 – 3z0 = 5 – 0 –0 = 5

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 251
GATE MATHEMATICS

1 1
j8 = l% = 1 − 2j% − ‹U  = 1 − 10 − 0 = −3
3 3
X3 = z1 = 3- 3x1 – 2y1 = 3 – 15 + 6 = -6

∴ x3 = -6

56. Ans: (A)

Sol: f(x) is a linear function
57.Ans: 0.1862
ù

ëìí: M = >sin j + “’jŽj

U
û 2û
3 3
x 0 π

f(x) 1 3 3 -1
2 2

− û−0 û
ℎ= = =
„ 3 3
By trapezoida, rule, we have
ù
ℎ
> øjŽj = ?l + lA  + 2l% + l8 @
2 U
U

û √3 √3
= 11 − 1 + 2 › + œ3
6 2 2
= 1.813799364 (approximate value)
By Exact method
ù

M = >sinj + cosjŽj
U

= ?− cosj + ’‡„j@ùU
= cos(0) – cos(π)+sin(π) – sin 0
= 1-(-1)= 2 (Exact value)
∴ Error = Exact value – approximate value
= 2- 1.813799364 = 0.1862

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 252
GATE MATHEMATICS

58.Ans: 0.06
dy
Sol: = y + 2x − x2 y (0) = 1, (0 ≤ x < ∞ )
dx
Given f ( x, y) = y + 2 x − x 2 , x0 = 0, y0 = 1, h = 0.1
k1 = hf(x 0 , y 0 ) = 0.1(1 + 2(0) − 0 2 ) = 0.1
k 2 = hg(x 0 + h, y 0 + k1 ) = 0.1(y 0 + k1 ) + 2(x 0 + h) − (x 0 + h) 2 )

= 0.1(1 + 0.1) + 2(0.1) − (0.1) 2

= 0.1(1.1 + 0.2 − 0.01)
= 0.129
1
∴ y1 = y 0 + (k1 + k 2 )
2
1
= 1+ (0.1 + 0.129)
2
= 1+0.1145 = 1.1145
Exact solution, y( x) = x 2 + e x
y(0.1) = (0.1) 2 + e0.1
= 0.01 + 1.1052 = 1.1152
ERROR = 1.1152 – 1.1145
= 0.00062
Percentage Error = 0.00062 ×100 = 0.06%
59.Ans: 0.3601

f ( x0 )
x1 = x 0 −
f ' ( x0 )
Soln:

f ( 0.333)
x1 = 0.333 −
f ' ( 0.333)

f(0.333) = 3(0.333)− e0.333+sin(0.333)

= 0.999 − 1.3951+0.3268
= − 0.0693

f ′(0.333)=3− e0.333+ cos(0.333)

=3− 1.3951+0.9450
=2.5499

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 253
GATE MATHEMATICS

0.0693
∴ x1 = 0.333 +
2.5499
= 0.333 + 0.02717
= 0.3601

VANI INSTITTUTE WWW.VANIINSTITUTE.COM

Page 254