 VIEW IN FULL SCREEN

OCR A-level Maths Iterative methods 1. Iterative formulas
2. Iterative Bisection
3. Linear Interpolation
4. Cobweb diagrams
5. Staircase diagrams
6. Iterative methods problems in context

Suppose we have an equation such as x² – 3x + 2 = 0. One approach of solving this is to rearrange the equation so that x is the subject of the formula, giving x = √(3x – 2). A value of x which satisfies this is also a solution of our original equation. We can find this value of x by considering this as an iterative formula xₙ₊₁ = √(3xₙ – 2). We then pick some starting value x₀ and put it in the right hand side of our equation to give some new x₁. We then iteratively put the x₁ in the right side again to get x₂, and so on. The values we get from the equation should converge on an approximate solution to our original equation, but this can depend on the function and what starting x₀ we use. Suppose we are trying to find the root of some equation f(x). We can use the change of signs method and find 2 points a and b so that f(a) < 0 and f(b) > 0, and therefore we know the root will lie somewhere in between. We then consider the midpoint m of these 2 points (dashed line on graph). If f(m) < 0, then we now know the root is between m and b, and otherwise it's between a and m. Iterative bisection just involves repeadedly doing this process, finding a new smaller intervals until it converges to an approximate solution. After a certain number of iterations one obviously needs to stop, and then we just give the interval's midpoint as the approximate root. It doesn't strictly need to find a root either, we could check for values f(a) < 1 and f(b) > 1 when trying to solve f(x) = 1. Consider this graph of f(x), where we know f(x) = 0 between some f(a) < 0 and f(b) > 0. Linear Interpolation is similar to iterative bisection, but instead of finding the midpoint of a and b to get our new interval, we consider the straight line from f(a) to f(b). The x–intercept (c) of this straight line can be easy calculated as c = ( a|f(b)| + b |f(a)| ) / ( |f(a)| + |f(b)| ), and this will be closer to the root of f(x) (note that the '| |' means the absolute, positive value). Then just as we did for iterative bisection, we identify the smaller interval which must contain the root and iteratively repeat the process, converging onto the root. Iterative methods can be used to find the roots of f(x) = 0 after rearranging it to the form x = g(x) and using the iterative formula x_(n + 1) = g(x_n). One method of doing this is with successive iterations which alternate between being below and above the root. If the iterations converge, a cobweb diagram is formed. The interval in which a root lies can be found by plugging values for x in the formula and seeing where the value of f(x) changes sign. One iterative method is one in which the iterations get progressively closer to the root from the same direction. When this process is plotted, a diagram called a staircase diagram is formed. Iterative methods can be used to model situations and find their solutions. 1

A ball is dropped from a vertical distance of 15 m. The motion of the ball is modelled by the function f(x) = −2x² + 15, x > 0, where x is the horizontal distance travelled by the ball. Show that the horiznotal distance is between 2 m and 3m. 2

Show that there is a root of f(x) = 2x + tan(x) + 1 at around x = –0.3 using iterative bisection between x = 0 and x = 0.5. 3

Find the root of f(x) = x³ + √(x) – 3/2, using linear interpolation (to 1 decimal place). 4

Find x² + 5x + 6, using linear interpolation and knowing a root exists in the interval between x = – 3.5 and x = –2.5. 5

Find a root of f(x) = sin(x) + x + 2 using linear interpolation, knowing the root is between x = –1 and x = –2. End of page