Scribd
Upload
30 views

Tutorialdd ! DM

This document contains a tutorial sheet with 10 problems related to numerical methods for approximating roots. The problems cover applying the bisection, Newton's, and secant methods to find roots of equations within specified intervals and tolerances. They also involve analyzing the order of convergence and implementation of the methods in programming languages.

Uploaded by

Roshan Saini
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
30 views

Tutorialdd ! DM

This document contains a tutorial sheet with 10 problems related to numerical methods for approximating roots. The problems cover applying the bisection, Newton's, and secant methods to find roots of equations within specified intervals and tolerances. They also involve analyzing the order of convergence and implementation of the methods in programming languages.

Uploaded by

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

Indian Institute of Technology Indore

MA204 Numerical methods


Instructor: Dr. Debopriya Mukherjee
Tutorial Sheet 1

1. Show that the error in approximation of the root at the nth step (n = 1, 2, 3, . . . ) in the
bisection method is bounded by (b − a)/2n , where [a, b] is the interval containing the root
that is being approximated.
√
2. Find an approximation to 3 25 correct to within 10−4 using the bisection method.

3. (a) Show that the order of convergence of Newton’s (or also called the Newton–Raphson)
method is 2, i.e. the method is quadratically convergent.
√
(b) Show that the order of convergence of the secant method is (1 + 5)/2 ≈ 1.618.

4. Use Newton’s method to find solutions accurate to within 10−5 to the following problems
(a) ln (x − 1) + cos (x − 1) = 0, for 1.3 ≤ x ≤ 2.
(b) ex + 2−x + 2 cos x = 6, for 1 ≤ x ≤ 2.
You may use the mid point of the interval as the initial guess in each case.

5. Repeat problem 5 with the secant method. Take x0 same as that taken in problem 5 and
x1 from the first iteration of Newton’s method but with only three significant digits after
rounding off.

6. Let f (x) = ex − x − 1. Show that f (x) has a zero of multiplicity 2 at x = 0. Find this root
accurate to within 10−5 by (i) Newton’s method and (ii) by modified Newton’s method.
[Realize the rate of convergence of the two methods to the root.]

7. A calculator is defective: it can only add, subtract, and multiply. Use the equation
1/x = 1.37, the Newton Method, and the defective calculator to find 1/1.37 correct to 8
decimal places.

8. Implement the bisection method, Newton’s method and the secant method in your favorite
programming language to find the root of x6 − x − 1 = 0 that lies in the interval [1, 2].
The tolerance for the error you may take as 10−5 . For Newton’s method, you may take
x0 = 1.5 and for the secant method you may take x0 = 1.5 and x1 = 1.

9. Show that x3 + 4x2 = 10 has a solution in [1, 2], and use the bisection method to determine
an approximation to this solution that is accurate to at least within 10−5 .

10. Use the bisection method to find solutions accurate to within 10−4 for the following prob-
lems
(a) ex − x2 + 3x = 2 for 0 ≤ x ≤ 1,
(b) x + 1 − 2 sin(πx) = 0 for 0.5 ≤ x ≤ 1.

You might also like