Scribd
Upload
13 views

MA-201 Tutorial Sheet 4

The document discusses numerical techniques for solving equations including Newton's method, secant method, bisection method, regula falsi method, and fixed point iteration. It provides examples of applying these methods to functions and determining their roots within intervals.

Uploaded by

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

MA-201 Tutorial Sheet 4

The document discusses numerical techniques for solving equations including Newton's method, secant method, bisection method, regula falsi method, and fixed point iteration. It provides examples of applying these methods to functions and determining their roots within intervals.

Uploaded by

kumarisezal81
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(BHU), Varanasi

Department of Mathematical Sciences


——————————————————————————
Numerical Techniques(MA-201)
Tutorial-4
——————————————————————————

1. The function f (x) = e2x − ex − 2 has a zero on the interval [0,1]. Find this zero correct to three significant
digits using Newton’s Method.
2. The function f (x) = 4sinx − ex has a zero on the interval [0,0.5]. Find the solution correct to three
significant digits using the Secant Method.
3. Find the smallest positive root correct up-to 4 significant digits of the following equations by using
(a) Bisection Method, (b)Secant Method, (c)Regula Falsi Method, (d)Newton’s Method, and(e)Modified
Regula Falsi Method(with the idea of approximate value of the root by Newton’s Method).
2
(i) x4 − 2x − 1 = 0, (ii) ex−1 − x3 − 2 = 0 ,(iii) Cos3x.ex + 1 = 0, (iv) ex + sin2x − 2 = 0.
4. Do three iterations of Newton’s Method to obtain the double root of f (x) = x3 − 2x2 − 0.75x + 2.25 = 0
which is close to 1 such that iterations converges quadratically .
5. Most functions can be rearranged in several waysrto give x = g(x) with which to begin the fixed-point
ex
method. For f (x) = ex − 2x2 , one g(x) is x = ± .
2

(a) Show that this converges to the root near 1.5 if the positive value is used and to the root near -0.5 if
the negative is used.
(b) There is a third root near 2.6 . Show that the sequence do not converge to this root even though
values near to the root are used to begin the iterations. Where does it converge if x0 = 2.5?. If x0 = 2.7?
(c) Find another rearrangement that does converge correctly to the third root.

6. For each of the following equations, determine a function a g and an interval [a,b] on which fixed-point
iteration will converge to a positive solution of the equation
(a) f (x) = 3x2 − ex , (b) x − cosx = 0.
7. Find the zero of f (x) = x2 + 10cosx by using the fixed-point iteration method for an appropriate iteration
function g.
2
8. Consider the function g(x) = e−x .
(a) Prove that g has a unique fixed point on the interval [0,1].
2
(b) With a starting approximation of x0 = 0, use the iteration scheme xn = e−xn−1 to approximate the
fixed-point on [0,1] to within 5 × 10−7 .
kn
(c) Use the theoretical error bound |xn − ξ| ≤ 1−k |x1 − x0 | to obtain a theoretical bound on the number
of iterations needed to approximate the fixed-point to within 5 × 10−7 . How does the number of iterations
performed in part (b) compare with the theoretical result.

∗ ∗ ∗ ∗ ∗ THE END ∗ ∗ ∗ ∗ ∗

You might also like