The first laboratory exercise of the semester consists of implementing algorithms for the following rootfinding methods:
For each of the algorithms, you must establish a tolerance for your computations. When you have what you think is a solution within your desired tolerance, the algorithm should stop. You must also keep an iteration count, and if the count is exceeded the algorithm should stop and report non-convergence.
For each of the algorithms, we shall test efficiency by counting the number of functional calculations required to achieve the desired tolerance. Be creative.
Additionally, we shall time the algorithms (wall clock time) to see which algorithms actually finish in the least amount of time, regardless of overhead.
If you have any questions, please contact Dr. Eggen.