Scribd
Upload
66 views2 pages

MA-201 Tutorial Sheet-2

This tutorial sheet provides 11 problems involving various numerical techniques for finding roots of equations such as bisection method, Newton-Raphson method, secant method, regula-falsi method, and fixed-point iteration method. The problems involve using these techniques to find roots within a certain accuracy, determining an iteration function and interval of convergence, and analyzing the order of convergence for iterative root-finding methods.

Uploaded by

Ankit Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
66 views2 pages

MA-201 Tutorial Sheet-2

This tutorial sheet provides 11 problems involving various numerical techniques for finding roots of equations such as bisection method, Newton-Raphson method, secant method, regula-falsi method, and fixed-point iteration method. The problems involve using these techniques to find roots within a certain accuracy, determining an iteration function and interval of convergence, and analyzing the order of convergence for iterative root-finding methods.

Uploaded by

Ankit Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DEPARTMENT OF MATHEMATICAL SCIENCES, IIT (BHU)

Numerical Techniques (MA-201)


TUTORIAL SHEET- 2

1. Use Bisection method to find a bound for the number of iterations needed to achieve an
approximation with accuracy 10 to the solution of   −  − 1 = 0 lying in the
interval
1, 2 and also find an approximation to the root with this degree of accuracy.
2. The function  =   −   − 2 has a zero on the interval
0,1 . Find this zero correct
to three significant digits using Newton-Raphson Method.
3. Use Secant method and method of Regula-Falsi to find the solution to within 10 for the
function  = 2 + 3 cos  −   for 0 ≤  ≤ 1 .
4. Given that the equation  . = 69 has a root between 5 and 8. Use the method of Regula-
Falsi to determine it.
5. Let  =  be a root of  = 0 and let  be an interval containing the point  = . Let
 and ′ be continuous in , where  is defined by the equation =
 which is equivalent to  = 0. Then if | ′| < 1 for all  in , the sequence of
approximations $ , % ,  , … , ' defined by '(% = '  converges to the root ,
provided that the initial approximation $ is chosen in .
6. For each of the following equations, determine a function  and an interval
), * on
which fixed-point iteration method (General iteration method) will converge to a positive
solution of the equation
+ , ( -
(a)  = (b)  − cos  = 0

7. Find a zero of  =   + 10 cos  by using the fixed - point iteration method for an
appropriate iteration function  .
8. Using the Newton-Raphson Method, show that the iteration formula for finding the ./0
root of a positive real number 1 is
4(5
2% 3 9
'(% = 467 and use it to find √32 correct to 4 decimal places.
2 3
9. Determine the order of convergence of the iteration method
< => > =< 
;(% = for finding a simple root of the equation  = 0
=> =< 
10. Let the function  be four times continuously differentiable and have a simple zero .
Successive approximations ' , ? = 1,2, … to  are computed form
% @ @@ 
'(% = '(% + '(%

@
=3  @@
B3  =
where '(% = ' − , '(% = ' − , C = .
= A 3  BA 3  = A 
Prove that if the sequence D' E converges to  then the convergence is cubic.
11. The function  = 1 − 1− has a double root at  = 1. Use Modified Newton-
Raphson Method to find the root correct to 3 decimal places.

************

You might also like