Using the iterative method
An iterative method can be used to find a value of when . To perform this iteration we first need to rearrange the function.
The basis of this is we need to rearrange to . Therefore we need to make the subject of . However, it does not matter if we have terms remaining on the other side.
This is because we can perform , meaning we take our value of and iterate it.
Let's look at two key worked examples below.
Worked examples of iteration calculation
1.
a) Prove that .
b) Using the iterative formula , and letting , find values for . SOLUTION: 1a) 1b)When iterating we use all the digits our calculator has given us to find our next value. You can do this easily by using the ANS button on your calculator
Let's look at a more difficult example.
2.
a) Prove that can be rearranged to form .
b) Using the iterative formula and letting
SOLUTION:
2a)
2 B)How do we see iterative methods on a graph?
Iterative methods are all about getting closer and closer to a root of an equation. We use them when we cannot directly solve Equations with any other methods.
The higher the value of in , the closer we are to the root of this equation as we are performing this process more and more times.
We can see this on a graph in two ways: a staircase diagram or a cobweb diagram.
Staircase diagrams
A staircase diagram works for a function that directly converges to a root meaning that from we are either directly increasing or decreasing towards our root with each iterative value.
Let's look at our initial example .
We will solely be focusing on the positive root (the one on the right).
A graph of
We know from rearranging that when . Therefore if we sketch the lines and , the intersection is the root of this equation.
An intersection between the lines and
Let's now plot our points for and .
Values marked.
Alt-text: Values marked on graph.
This is a more zoomed-in version and we can see that these points are slowly converging to the intersection. If we add a few lines, we can see our staircase.
A staircase diagram attaching all of the aforementioned points.
If we continue and use more values we will get closer and closer to that intersection. We will never actually reach it but we can get it in view of high accuracy.
Cobweb Diagrams
A cobweb diagram is when we are converging on a root in more than one direction, meaning our values become both too high and too low around the root.
Our second example demonstrates this. We will be focusing on the negative root, the one to the left.
Image Caption
A sketch of the graph
Once again, from rearranging we know that when . Therefore we can sketch the lines and , and their intersection is the solution to the equation .
Intersection between the lines and ,
Now let's plot our points for and .
Points marked.
We can clearly see these points are not in order. Therefore we do not have a staircase, we have a cobweb and are converging on the value from different directions. This is what it looks like.
A cobweb diagram attaching all marked points.
We can see this is like a cobweb, and is converging towards a value from values greater than and less than the intersection.
Iterative Methods - Key takeaways
- Iterative methods can be used to find solutions to Equations we cannot solve otherwise.
- They give us formulas to help us converge on particular roots of equations.
- We can use Graphs to help us visualise how the roots are getting more accurate (the closer to the intersection, the more accurate our answer is).
- A staircase diagram is one where we are moving in one direction towards the intersection.
- A cobweb diagram is where we are moving around the intersection in more than one direction.
How we ensure our content is accurate and trustworthy?
At StudySmarter, we have created a learning platform that serves millions of students. Meet
the people who work hard to deliver fact based content as well as making sure it is verified.
Content Creation Process:
Lily Hulatt is a Digital Content Specialist with over three years of experience in content strategy and curriculum design. She gained her PhD in English Literature from Durham University in 2022, taught in Durham University’s English Studies Department, and has contributed to a number of publications. Lily specialises in English Literature, English Language, History, and Philosophy.
Get to know Lily
Content Quality Monitored by:
Gabriel Freitas is an AI Engineer with a solid experience in software development, machine learning algorithms, and generative AI, including large language models’ (LLMs) applications. Graduated in Electrical Engineering at the University of São Paulo, he is currently pursuing an MSc in Computer Engineering at the University of Campinas, specializing in machine learning topics. Gabriel has a strong background in software engineering and has worked on projects involving computer vision, embedded AI, and LLM applications.
Get to know Gabriel