 
Summary: Math 481a, Fall 2005
Project 1. The root finding problem
Due October 21, 2005
Problem 1: Compare performance of three algorithms: Newton's
method, bisection method, and the fixedpoint iteration method.
· Write a code implementing Newton's method, the bisection
method, and the fixedpoint method. Keep the programing in
such a way as to be able to compare performance of the three
methods on a selected function.
· Compare performance of each method on the following three
root problems:
f(x) = 0, on [0.9; 1], where f(x) = x2
sin x;
g(x) = 0, on [0.9; 1], where g(x) = x2
sin x  x;
h(x) = 0, on [0.9; 1], where h(x) = 3
x.
· Write a report. Include results of your calculations with some
minor comments, and justify the choice of examples. Attach
