Scribd
Upload
60 views

TutorialSheet 01

This document provides 15 numerical analysis problems involving various root-finding methods like bisection, Newton-Raphson, false position, and Graeffe's method. The problems cover finding roots of nonlinear equations, approximating solutions, determining number of iterations, and extracting factors from polynomials. Sample answers to the problems are provided.

Uploaded by

fucking
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
60 views

TutorialSheet 01

This document provides 15 numerical analysis problems involving various root-finding methods like bisection, Newton-Raphson, false position, and Graeffe's method. The problems cover finding roots of nonlinear equations, approximating solutions, determining number of iterations, and extracting factors from polynomials. Sample answers to the problems are provided.

Uploaded by

fucking
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Dr B R AMBEDKAR NIT JALANDHAR

NUMERICAL METHODS (MACI-203)

Tutorial Sheet-I

(1) (I) Find the interval in which the smallest positive root of the following equations lies:
(i) tan x + tanh x = 0 (ii) x3 − x − 4 = 0.
Determine the roots correct to two decimals using the Bisection method.
Answer: (i) 2.36875 (ii) 1.7969.

(II) Perform five iterations of the Bisection method to obtain the smallest positive
root of the equation
(i) cos x − xex = 0 (ii) x3 − 5x + 1 = 0.
Answer: (i) 0.515625 (ii) 0.203125.

(2) Use Newton-Raphson method to find solutions accurate to within 10−4 for the following
problems:
π
(i) x − 0.8 − 0.2 sin x = 0 for 0 ≤ x ≤
2
π
(ii) x − cos x = 0 for 0 ≤ x ≤
2
(iii) x3 − 2x2 − 5 = 0 for 1 ≤ x ≤ 4.
Answer: (i) 0.96434 (ii) 0.73909 (iii) 2.69065.

(3) Use False Position method to find solutions to within 10−3 for the following problems.
(i) 3xex = 0, for −1
2
≤ x ≤ 21
x
(ii) 2x + 3 cos x − e = 0, for 1 ≤ x ≤ 2 .
Answer: (i) −0.0003 (ii) 1.2395.

(4) Solve x3 − 8x2 + 17x − 10 = 0 using Graeffe’s method.


Answer: Exact roots are 5, 2, 1

(5) Determine the number of iterations necessary to solve f (x) = x3 + 4x2 − 10 = 0 with
accuracy 10−3 using a1 = 1 and b1 = 2.
Answer: 10.
xn
(6) (I) Derive the iteration method xn+1 = (3 − N x2n ) to obtain the square root of
2
the reciprocal of a number N > 0. Use Newton-Raphson method.

(II) Perform four iterations of the Newton-Raphson method to find the smallest pos-
itive root of the equation

x3 − 5x + 1 = 0.
Answer: 0.201640.

(7) The equation 4x2 − ex − e−x = 0 has two positive solutions x1 and x2 . Use Newton’s
method to approximate the solutions to within 10−5 with the following values of p0
(i) p0 = −10 (ii) p0 = −5 (iii) p0 = 1.
Answer: (i) −4.30624527 (ii) −4.30624527 (iii) 0.824498585.

(8) For f (x) = −x3 − cos x. Use the False Position method to find P3 when P0 = −1 and
P1 = 0.
Answer: −0.841356.

(9) Using Graeffe’s root squaring method, find the roots of


x3 − 4x2 + 5x − 2 = 0.
Answer: Exact roots are 2, 1, 1.

(10) Find the positive root of the equation


x2 x3 0.3x
ex = 1 + x + + e
2 6
correct to six decimal places.
Answer: 2.363376.

(11) Perform two iterations of the Bairstow method to extract a quadratic factor x2 + px + q
from the polynomial

p3 (x) = x3 + x2 − x + 2 = 0.
Use the initial approximations p0 = −0.9, q0 = 0.9.
Answer: The exact factor is x2 − x + 1.

(12) The sum of two numbers is 20. If each number is added to its square root, the product
of the two sums is 155.55. Determine the two numbers to within 10−4 .
Answer: 6.512849 and 13.487151.

(13) Show that the equation

f (x) = cos(π(x + 1)/8) + 0.148x − 0.9062 = 0.

has one root in the interval (−1, 0) and one in (0, 1). Calculate the negative root correct
to 4 decimals.
Answer: −0.5081.

(14) The fourth-degree polynomial


f (x) = 230x4 + 18x3 + 9x2 − 221x − 9 has two real zeros, one in [−1, 0] and the other
in [0, 1]. Attempt to approximate these zeros to within 10−3 using the method of False
Position.
Answer: −0.0404 and 0.9623.

(15) Use Newton’s method to approximate, to within 10−4 , the value of x that produces the
point on the graph of y = x2 that closest to (1, 0). [Hint: Minimize [d(x)]2 , where d(x)
represents the distance from (x, x2 ) to (1, 0).]
Answer: 0.589755.

You might also like