Matematiska vetenskaper, Chalmers Tekniska Högskola och Göteborgs Universitet

[hem, vecka 1, vecka 2, vecka 3, vecka 4, vecka 5, vecka 6, vecka 7]

ALA-A, studio 4.1 - 4.3, 2006

The fixed point algorithm

1. The teacher presents sections 5-9 in Solving the equation f(x)=0. But skip the proof of the Fixed Point Theorem, I will do this in the lecture in week 5.

2. Write a flowchart for the fixed point algorithm.

3. Write a program for the fixed point algorithm according to the template fixpoint.m and your flowchart.

4. Use the program on the equations mentioned in the lecture notes.

5. Observe how the computed sequences converge. How many steps of the algorithm does it take to make the error less than 1e-10?

/stig