Assignment 1&2

1. Write computer program to implement the following rootfinding techniques:

(a) Bisection method

(b) Method of false positions
(c) Fixed-point iteration
(d) Newton-Raphson or Newton’s method
(e) Secant method

2. Find all the roots of following equations by above methods:

(a) x3 − 3x2 + 3x − 1 = 0
(b) ex − 2 − x = 0
(c) x − tanh(βx) = 0 take β = 1, 2
(d) x − tan(x) = 0

3. The equation
2
f (x) ≡ x + e−Bx cos(x) = 0, B>0
has a unique root, and it is in the interval (−1, 0). Use Newton’s method to find it as
accurately as possible. Use values of B = 1, 5, 10, 25, 50. Among your choices of x0 ,
choose x0 = 0, and explain the behaviour observed in the iterates for the larger values
of B.

4. Determine if each function has a unique fixed point on the given interval. Use theorems
establishing conditions for the existence and uniqueness of a fixed point.

(a) g(x) = 1 − x2 /4 on [0, 1]

(b) g(x) = 2−x on [0, 1]
(c) g(x) = 1/x on [0.5, 5.2]

5. Let g(x) = x2 + x − 4. Can fixed-point iteration be used to find the solution(s) to the
equation x = g(x)? Why?