MTP290 Tut2
MTP290 Tut2
(1) Write down the MATLAB script for computing a root of a given function
f (x) = 0 using bisection method.
(2) Use the bisection method to find the approximation of the root of f (x) =
x3 − 30x2 + 2552, starting from the interval [0, 20] with tolerance 1e − 5.
(3) Use the bisection method to find the solutions accurate to within 1e − 4 for
x3 − 7x2 + 14x − 6 = 0 on [0, 1].
(4) Use the bisection method to find the root of x = e−x with an accuracy of
10−4 . How many iterations did you need?
(5) Write down the MATLAB script for computing a root of a given function
f (x) = 0 using Newton Raphson’s method.
(6) Use Newton’s method to find solutions accurate within 1e − 5 for the fol-
lowing problems:
(a) x3 − 2x2 − 5 = 0 on the interval [1, 4].
(b) x cos(x) = 0 on the interval (0, π).
(7) Apply Newton’s method to find the approximation of the root of x = tanx,
starting with initial guess x0 = 4 and x0 = 4.6. Compare the results ob-
tained from these two initial guesses. Does the method converge?
(8) f (x) = x − 2 + log(x) has a root near x = 1.5. Use the Newton Raphson
formula to obtain the better estimate.
(9) Obtain an estimation (accurate till 4 decimal point) of the point of inter-
section of the curves y = x − 1 and y = cos x.
with the root x∗ = 0. What is the behavior of the iterates? Do they con-
verge, if yes, at what order?
(11) Use Newton’s method method for finding the approximations of the two
zeros, one in [−1, 0] and other in [0, 1] to within 1e − 3 accuracy of f (x) =
230x4 + 18x3 + 9x2 − 221x − 9. Use the mid point of the interval as initial
guess.
MTP 290 PROBLEM SET 2
(12) Solve the equation cos(x) − x = 0, x ∈ [0, π/2]. Compare numerical re-
sults to determine which algorithm among the Newton’s method and the
bisection method performance better for this problem.