Vous êtes sur la page 1sur 14

Engineering Maths (Numerical Methods)

1. Applying the secant method, the first approximation to the root of 2x  log10 x  7  0
starting with function values at x0  3.5 & x1  4 is ___________.

2. Which of the following method will give more accurate result in solving initial value
problem?

(a) Euler’s method (b) Modified Euler’s method


(c) R-K method of 3rd order (d) R-K method of 4th order

3. For solving algebraic and transcendental equations which of the following is used
(a) Newton-Raphson (b) Green’s Theorem
(c) Euler’s theorem (d) Leibnitz’s method

4. The recurrence relation to find the root of x2  114  0 by using Newton-Raphson method
is

xn2 114xn xn2


(a) xn1   (b) xn1   114
2 2 2
x 2
114 1 114 
(c) xn1  n  (d) xn1   xn  
2 xn 2 xn 

dy
5. Consider  x  y, y(0)  0,h  0.2 , the value of y(0.2) of the solution by modified Euler’s
dx
method is __________

© Kreatryx. All Rights Reserved. 1 www.kreatryx.com


Engineering Maths (Numerical Methods)

6. Match the following applications to appropriate numerical method.


List-I(Applications)
1. Numerical integration
2. Solutions to transcendental Equation
3. Solutions to a system of linear equation.
4. Solutions to differential equation

List-II(Numerical method)
A. Newton Raphson method
B. Runge-kutta method
1
C. Simpson rule
3
D. Gauss Elimination method
Codes:
(a) 1-C 2-A 3-D 4-B
(b) 1-A 2-C 3-B 4-D
(c) 1-C 2-D 3-B 4-A
(d) 1-D 2-B 3-C 4-D

2
1
7. The value of  xdx computed using simpson’s 1/3 rule with a step of h=0.25 is
1

(a) 0.69430 (b) 0.69385


(c) 0.69325 (d) 0.69415

8. For k=0,1,2,............., the steps of Newton-Raphson method for solving a non-linear


2 5
equation is given as xk 1  xk  xk2 starting from a suitable initial choice as K tends to  ,
3 3
the iterate xk tends to _________

1
9. Given a>0, we wish to calculate the reciprocal value by Newton-Raphson method for
a
f(x)=0. The Newton-Raphson algorithm for the function will be

1 a 1 a 2
(a) xk 1   xk   (b) xk 1   xk  xk 
2 xk  2 2 
a 2
(c) xk 1  2xk  axk2 (d) xk 1  xk  x
2 k

© Kreatryx. All Rights Reserved. 2 www.kreatryx.com


Engineering Maths (Numerical Methods)

10. Simpson’s one third rule and Simpson’s three-eight rule considers curves of polynomial
of order _________ and ___________ respectively.

(a) 2,3 (b) 2,2


(c) 3,3 (d) 1,2

11. The real root of equation xex  2  0 correct to three decimal places according to
Newton Raphson’s method is
(a) 0.853 (b) 0.8679
(c) 0.871 (d) 0.8135

12. The iterative formula to find the root of x  N1/3 where N is positive real number. Use
Newton Raphson method

2xn3  N 2xn3  N
(a) (b)
3xn2 3xn2
3xn3  N
(c) (d) None of these
2xn3

dy
13. Given  3(1  x)  y and y=4 when x=1. Using Runga-Kutta fourth order method, the
dx
approximate value of y when x=1.2 will be _________

2
dx
14. Using trapezoidal rule the value of  1  sinx
0
is __________[assume 6 intervals]

(a) 2 (b) 1
(c) 3 (d) 4

15. By the application of Simpson’s 1/3rd rule for numerical integration, with two sub
1
dx
intervals, the value of 1 x
0
is

17 17
(a) (b)
24 36
25 17
(c) (d)
36 25

© Kreatryx. All Rights Reserved. 3 www.kreatryx.com


Engineering Maths (Numerical Methods)

16. The Runga-Kutta method of order four is used to solve the differential equation
dy
 f(x) at y(0)=0 with step size h. The solution at x=h is given by
dx

h h  h h 
(a) y(h)   f(0)  4f    f(h) (b) y(h)  f(0)  2f    f(h)
6 2  6 2 
h h h 
(c) y(h)  f(0)  f(h) (d) y(h)  2f(0)  f    2f(h)
6 6 2 

© Kreatryx. All Rights Reserved. 4 www.kreatryx.com


Engineering Maths (Numerical Methods)

Solutions

1. Ans: 3.6 to 3.8


x 0 f1  x1f0
Solution: The first approximation is x2 
f1  f0
x0=3.5, f(3.5)= -0.544,
x1=4, f(4)= 0.4
x2=3.78

2. Ans: (d)
Solution: Order of error in the R-K method of 4th order is h5

3. Ans: (a)
Solution: Green theorem is used to convert line integral into surface integral.
Euler method is used for numerical solution of differential equation.
Newton-Raphson is used for transcendental and algebraic equation.

4. Ans: (d)
Solution: Let f(x)= x2  114
f(x)  2x
 f(xn )   xn2  114 
xn1  xn     xn   
 f (xn )   2xn 
2x 2  xn2  114 xn2  114
xn1  n 
2xn 2xn
1 114 
xn1   xn  
2 xn 

5. Ans: 0.02
Solution: Given x0  0, f(x, y)  x  y,h  0.2
In modified Euler’s method compute
K1  hf(x0 y 0 )  0.2(0  0)  0
K 2  hf(x0  h, y 0  k)  0.2(0.2  0)  0.04
1
Now K  K  K 2   0.02
2 1
Now y(0.2)  y 0  K  0  0.02  0.02

© Kreatryx. All Rights Reserved. 5 www.kreatryx.com


Engineering Maths (Numerical Methods)

6. Ans: (a)

7. Ans: (c)
1
Solution: f(x)  ,a  1,b  2,h  0.25
x
x 1 1.25 1.50 1.75 2
1 1 0.8 0.667 0.5714 0.5
f(x) 
x

2
1 h
 x dx  3  y
1
0
 y 4   4  y1  y 3   2  y 2    0.69325

8. Ans: 1.70 to 1.72


2 5
Solution: Given xk 1  x  x 2
3 k 3 k
As k   series converges
 xk 1  xk   =root of equation
2 5
    2
3 3
 5 1

3 3 2
3  5
  51/3  1.7099
xk  1.71

9. Ans: (c)
1
Solution: To calculate using N-R method,
a
1 1
Set up the equation as x  i.e.  a
a x
1
a0
x
1
i.e. f(x)   a  0
x
1
Now, f (x)  
x2

© Kreatryx. All Rights Reserved. 6 www.kreatryx.com


Engineering Maths (Numerical Methods)

1
f(xk )  a
xk

1
f (xk )  
xk2
f(xk )
For N-R method, xk 1  xk 
f (xk )

x k 1  x k 
1 / x k
 a
1

xk2
After simplification xk 1  2xk  axk2

10. Ans: (a)

11. Ans: (a)


Solution:
f(x)  xex  2
f(0)  2 and f(1)  0.7183
Hence root lies in (0,1) and nearer to 1
Take x0  1
f (x)  ex (1  x) & f(1)  5.4366
By Newton Raphson rule

f(x 0 ) 0.7183
1st approximation, x1  x0  1  0.8679
f (x0 ) 5.4366
 f(x1 )  0.0672

f (x1 )  4.4491
f(x1 ) 0.0672
2nd approximation, x 2  x1   0.8679   0.8528
f (x1 )
 4.4491
=0.853 correct to three decimal places

12. Ans: (b)


Solution: x  N1/3  x3  N
Let, f(x)= x3  N; f (x)  3x2
f(xn ) x3  N 2x 3  N
So, xn1  xn   xn  n 2  n 2
f (xn ) 3xn 3xn

© Kreatryx. All Rights Reserved. 7 www.kreatryx.com


Engineering Maths (Numerical Methods)

13. Ans: 4.3 to 4.5


Solution: x0  1, y 0  4,h  0.2
Here, f(x,y)=3(1+x)-y
 
k1  hf x0 , y0  0.2 f(1, 4)  0.2  2  0.4
 h h 
k 2  hf  x0  , y 0  k1   0.2 f(1.1, 4.20)  0.2  2.10  0.420
 2 2 
 h h 
k 3  hf  x0  , y 0  k 2   0.2 f(1.1, 4.21)  0.2  2.09  0.418
 2 2 
 h h 
k 4  hf  x0  , y 0  k 3   0.2  f(1.2, 4.418)  0.2  2.182  0.4364
 2 2 
k  2k 2  2k 3  k 4
Hence k  1  0.41873
6
Hence yn1  yn  k  4  0.41873  4.41873  4.419

14. Ans: (b)


 0
2 
Solution: Divide it into 6 intervals, each of width 
6 12
   5 
Hence ordinates are 0, , , , ,
12 6 3 12 2

 0     5 
12 6 4 3 12 2
1 1 0.7944 0.66667 0.58579 0.53590 0.50862 0.5
1  sin x

So,

2
1  1 
 1  sinxdx  12  2 (1  0.5)  0.79440  0.66667  0.58379  0.53590  0.50567  1.006  1
0

© Kreatryx. All Rights Reserved. 8 www.kreatryx.com


Engineering Maths (Numerical Methods)

15. Ans: (c)


1 1
Solution: h  ,y 
2 1x
1 x y

2 0 1  y0
1
10
3 0.5 1 2  y1

1  0.5 3
4 1 1 1  y2

11 2

2 1
y 0  1; y1  , y2 
3 2
1
dx h 25
By Simpson’s Rule,  1  xdx  3  y
0
0
 y 2   4y1  
36

16. Ans: (a)


Solution:
dy
 f(x), y(0)  0, x 0  0, y 0  0
dx
k1  hf  x0 , y 0   hf  x0   hf(0)
 h k   h h
k 2  hf  x 0  , y 0  1   hf  x 0    hf  
 2 2  2 2
 h k  h
k 3  hf  x0  , y 0  2   hf  
 2 2 2
k 4  hf  x0  h1y 0  k 3   hf h

1
 y1  y 0  k  2k 2  2k 3  k 4 
6 1
1 h h  h h 
y(h)  0  hf(0)  2hf    2hf    hf(h)  f(0)  4f    f(h)
6 2 2  6 2 

© Kreatryx. All Rights Reserved. 9 www.kreatryx.com


Engineering Maths (Numerical Methods)

We recommend you to take the Chapter Test first and then check
the Solutions.

© Kreatryx. All Rights Reserved. 10 www.kreatryx.com


Engineering Maths (Numerical Methods)

Chapter Test Solutions

1. Ans: (b)
Solution: If f(x)= xex  2
f (x)  xex  ex
Newton-Raphson iteration formula is
f(xn )
xn1  xn 
f (xn )
Taking x 0 =0.8679
f(x0 )
x1  x0   0.853
f (x0 )

2. Ans: (b)
Solution: Order of error in the methods respectively are h2 ,h3 and h5

3. Ans: (b)
a  b 1 5
Solution: x1    3  f(x1 )  0 andf(a)  0
2 2
1 3
 x2   2  f(x 2 )  0  x 2 is root
2
Only two iterations needed.

4. Ans: (c)
f(xn )
Solution: We have xn1  xn 
f (xn )
f(x)  x3  x  1
f(xn )  xn3  xn  1  f (xn )  3 xn2  1
xn3  xn  1 2xn3  1
 xn1  xn  
3 xn2  1 3xn2  1

© Kreatryx. All Rights Reserved. 11 www.kreatryx.com


Engineering Maths (Numerical Methods)

5. Ans: (c)
Solution: x6  x  4
By using Descartes rule of signs,
f(x)  + + +No positive real roots as there is no sign change in coefficient of f(x).
f(-x)  + - +Two negative real roots as there is 2 sign change in coefficient of f(-
x).
 At most 2 real and at least 4 complex roots

6. Ans: (b)
Solution: The Truncation error for Trapezoidal rule is
(b a) 2
h f (x) max
12 a,b
 

We required n=? (number of subintervals)


ba
h
n
Given f(x)  xex ,a  1,b  2
f (x)  xex  2ex
max f(x)  4e2
(1,2)

1
Also (Truncation error)   106
3
2
1  2 1 1
 4e   10
2 6

12  n  3

n  1000e

7. Ans: (c)
Solution: By Trapizoidal rule
2
h 1
 f(x)dx  2  y
0
0
 y 2  2(y1 )  
2
1  15  2(4)  12
But error=Exact value-Approximate value
For exact value to find, let f(x)  a0  a1 x  a2 x 2
Given,
At x=0, f(x)  1  1  a0  0  0  a0  1
At x=1, f(x)  4  4  1  a1  a2  a1  a2  3
At x=2, f(x)=15

© Kreatryx. All Rights Reserved. 12 www.kreatryx.com


Engineering Maths (Numerical Methods)

15  1  2a1  4 a2  2a1  4 a2  14

 f(x)  1  x  4 x 2
2 2
32
Exact value= 
 f(x)dx   1  x  4x dx 
2
 3
0 0

32 4
 Error=  12  
3 3

8. Ans: (a)
Solution: x  4 C
f(x)  x 4  C  0
f (x)  4 x3

xn4  C 3xn4  C
x n 1  x n  
4xn3 4xn3

9. Ans: (b)
1
Solution: x 
a
1
f(x)  2  a  0
x
2
f1(x)  3
x
 1 
 2  a 
xn xn  axn3 1  
xn1  xn  
 2 
  xn 
2
 3xn  axn3
2
 
 3 
 xn 

10. Ans: (b)


1
Solution: Simpson rule
3
h 0.25
 y 0  y 4   2  y 2   4  y 1  y 3    1  0.5   2  0.8   4  0.9412  0.64    0.7854
3   3  

© Kreatryx. All Rights Reserved. 13 www.kreatryx.com


Engineering Maths (Numerical Methods)

11. Ans: (d)


Solution: h=1 and  =6
fIV =ex max at x=6 i.e. fIV (max) = e6
3h5 IV 3 6
 f () = e
80 80

12. Ans: (b)


Solution:
f(x )
xn1  xn  n , f(x)  3 x  cosx  1
f (xn )

f(1)  1.4596
f (x)  3  sinx, f (1)  3.8414
1.4596
x1  1   0.62
3.8414

13. Ans: (a)

14. Ans: (c)


Solution: By trapezoidal rule
x0
h
 f(x)dx  2  y
x0
0
 yn   2  y1  y 2  ........y n1  ;h  5

X 0 5 10
Sin(1-x) 0.8414 0.7568 -0.412
5
So, f(x)  (0.8414  0.412)  2(0.7568)  =4.85=5 (approx)
2

15. Ans: (b)


Solution: For a=7, the iteration equation becomes
xk 1  2xk  7xk2
With x0  0.2
x1  2x 0  7x 02  2  0.2  7(0.2)2  0.12
And x2  2x1  7x12  2  0.12  7(0.12)2  0.1392

© Kreatryx. All Rights Reserved. 14 www.kreatryx.com

Vous aimerez peut-être aussi