Simple Fixed-Point Iteration Method

`
Open Method
Simple Fixed-Point Iteration
• Also called:
– one point iteration
– successive substitution

• Can be done by rearranging f(x)=0 so that x is on the left side.

f(x)=0 --> x=g(x)
Simple Fixed-Point Iteration
• For Example:

– x2+10x-2 = 0 --> x = (2-x2)/10

– e-x-x = 0 --> x = e-x

– ln (x) +3 = 0 --> x = ln (x) + x

Substitute the previous x value in the right side to get the new x in
the left side repeatedly.
Simple Fixed-Point Iteration Algorithm:
Step 1: rearranage the function to form: xi+1= g(xi).

Step 2: provide an initial x value (x0).

Step 3: Substitute latest value of x to g(xi).

Step 4: if error is less than or equal to the stopping criterion, STOP, then xi+1 is
the root.
Example 1
•
Example 2
•
Reflection Question:
• What was the most important thing you learned during this class today?
• What questions remained unanswered in your mind today?
• Of the concepts we learned today, what would you NOT like to have on the
exam?
• The clearest point of today’s class was:
• Summarize the main point of today’s lecture in one sentence.
• What was the most useful or meaningful thing you learned from this assignment?
• How I prepared for class today:
• What I liked best that helped me learn:
• One thing that I wish had been discussed during today’s class is:
• How do you think you will use what we learned today in your everyday life?