Академический Документы
Профессиональный Документы
Культура Документы
x g( x )
Christine Crisp
Iteration
Module C3
"Certain images and/or photos on this presentation are the copyrighted property of JupiterImages and are being used with
permission under license. These images and/or photos may not be copied or downloaded without permission from JupiterImages"
Iteration
There are some equations that we cant solve.
e.g.
x 1 x3
Iteration
There are 2 stages to getting a solution:
Stage 1. Find a 1st estimate
Stage 2. Find a formula to improve the estimate.
Sometimes we can just spot an approximate solution
to an equation.
Can you spot the approximate value of the solution to
x3 2x 1 ?
Iteration
Bounds are numbers which lie on either side of the
solution.
If these are integers we call them integer bounds.
e.g. To find integer bounds for x 1 x 3 we
3
can sketch y x and y 1 x
y 1 x3
y
y 1 x
x 1 x
Iteration
Bounds are numbers which lie on either side of the
solution.
If these are integers we call them integer bounds.
e.g. To find integer bounds for x 1 x 3 we
3
can sketch y x and y 1 x
y 1 x3
y
The solution
lies between
0 and 1.
0 and 1 are
the integer
bounds.
Iteration
Bounds are numbers which lie on either side of the
solution.
If these are integers we call them integer bounds.
e.g. To find integer bounds for x 1 x 3 we
3
can sketch y x and y 1 x
y 1 x3
y
The solution
lies between
0 and 1.
0 and 1 are
the integer
bounds.
Iteration
If we can use Autograph or a graphical calculator,
sketching is a good method of finding the integer
bounds.
Even without a graph plotter you may have been
able to sketch these 2 graphs.
However, if we can spot likely bounds, or if we are
given values and want to show they are bounds, we
can use the algebraic method that follows and avoid
sketching.
Iteration
Rearrange the equation to get zero on one side.
e.g. For x 1 x 3 , get x 3 1 x 0
Call this
f ( x) 0
f ( x) 0
At ,
f ( x) 0
Iteration
Rearrange the equation to get zero on one side.
e.g. For x 1 x 3 , get x 3 1 x 0
Call this
f ( x) 0
f ( x ) has opposite
Iteration
The Algebraic Method:
If we want to show that 0 and 1 are integer
bounds, we show that f ( x ) has different signs
at 0 and 1.
Rearrange the equation to the form f ( x ) 0
x 1 x
e.g.
Define
Find
f ( x ):
f ( 0) :
Let
x3 1 x 0
f ( x) x 3 1 x
Iteration
The Algebraic Method:
If we want to show that 0 and 1 are integer
bounds, we show that f ( x ) has different signs
at 0 and 1.
Rearrange the equation to the form f ( x ) 0
x 1 x
e.g.
Define
Find
Find
f ( x ):
Let
x3 1 x 0
f ( x) x 3 1 x
f (0) : f (0 ) 0 3 1 0 1
f (1) : f (1) 1 3 1 1 1
Change of sign
Iteration
The Algebraic Method:
If we want to show that 0 and 1 are integer
bounds, we show that f ( x ) has different signs
at 0 and 1.
Rearrange the equation to the form f ( x ) 0
x 1 x
e.g.
Define
Find
Find
f ( x ):
Let
x3 1 x 0
f ( x) x 3 1 x
f (0) : f (0 ) 0 3 1 0 1
f (1) : f (1) 1 3 1 1 1
Change of sign
Iteration
It is possible to find bounds that are closer than
the nearest integers.
For example, to find bounds accurate to 1 decimal
place, we could use a decimal search.
So if we had 0 1 , a decimal search would
calculate
f (0 1), f (0 2), f (0 3) . . .
looking for a change of sign.
However, integer bounds are good enough for the
method of iteration we are studying.
Iteration
e.g. 1 (a) Using a graphical calculator, or
otherwise, sketch, on the same axes, the graphs of
y x 3 2 and y 5 x
(b) From the sketch, find integer bounds for the
3
solution, , of the equation x 2 5 x
(c) Use an algebraic method to confirm these are
correct and give a 1st approximate solution.
Solution:
y 5x
(a)
(b) is the x-value
at the point of
y x3 2
intersection, so 0
and 1 are integer
bounds.
Iteration
e.g. 1 (a) Using a graphical calculator, or
otherwise, sketch, on the same axes, the graphs of
y x 3 2 and y 5 x
(b) From the sketch, find integer bounds for the
3
solution, , of the equation x 2 5 x
(c) Use an algebraic method to confirm these are
correct and give a 1st approximate solution.
(c) ( Confirm bounds are 0 and 1 )
Rearrange equation to f ( x ) 0 : x 3 5 x 2 0
f ( x) x 3 5 x 2
f ( 0) 2 0
f (1) 1 5 2 2 0
change of sign 0 1
Define
:
So,
The
A 1st approximation is any number between 0 and 1.
f ( x)
Iteration
Not all functions f ( x ) that have a sign change
between 2 numbers have a solution to f ( x ) 0
between the numbers.
Look at this function:
f ( 0) 2 ,
f (1) 2
There is a change of
sign . . . but no
solution between 0
y f ( x)
and 1.
Do you notice
anything that
x 12
explains this?
Ans: The function has an asymptote between 0 and 1.
We couldnt draw the curve without lifting the pencil
off the paper. We say it is discontinuous.
Iteration
Not all functions f ( x ) that have a sign change
between 2 numbers have a solution to f ( x ) 0
between the numbers.
Look at this function:
f ( 0) 2 ,
y f ( x)
1
2
f (1) 2
There is a change of
sign . . . but no
solution between 0
and 1.
Do you notice
anything that
explains this?
Iteration
Exercise
1. Using a graphical calculator or otherwise, sketch
suitable graphs to find integer bounds for the
solution to
2
x 1 e
ln x 4 x
Iteration
1.
x 1 e
Solution:
Sketch
y x 1
and
ye
y x2 1
y ex
1 2
Iteration
2. Use the algebraic method to show that
ln x 4 x
f ( x) 0:
Define
ln x 4 x
ln x x 4 0
f ( x ) : f ( x ) ln x x 4
f ( 2) ln 2 2 4 1 3
f ( 3) ln 3 3 4 0 1
2 3
Iteration
The 1st approximate solution lies anywhere between
the bounds. The next stage is to improve this
estimate.
Rearrange the equation to the form x g ( x ) .
You may spot lots of ways of doing this. e.g.
e.g. For the equation
x 1 x3 :
Iteration
The 1st approximate solution lies anywhere between
the bounds. The next stage is to improve this
estimate.
Rearrange the equation to the form x g ( x ) .
You may spot lots of ways of doing this. e.g.
x 1 x3 :
3 2
3
(
1
x
)
x
x
(i) Square:
3
3
x
1 x
or (ii) Rearrange: x 1 x
x 1 x
Cube root:
or (iii) Rearrange: x 1 x
Divide by x 2:
x3 1 x
1 x
x
x2
1
3
Iteration
1
3
We
substitute
into the
of is
the
formula
and )
( Some
peoplex0start
withr.h.s.
x1 which
just
as good.
the result gives the new estimate x1.
We now have x1 1
x0
1
3
x n 1 1 x n
So,
x n 1 1 x n
Iteration
Starting with x 0 0 5
x1 1 x 0
1
3
1
3
we get
x1 1 0 5
1
3
x1 0 664105 ( 6 d.p. )
1
3
We get
Iteration
x0 0 5
x1 0 664105
x 2 0 569878
0 605423 ( to 6 d.p. )
Error Bounds
Iteration
SUMMARY
To find an approximation to a solution ( or root ) of
an equation:
Find a 1st approximation, often by finding integer
bounds for the solution. Let this be x0 .
Rearrange the equation into the form x g ( x )
Write the arrangement as an iterative formula:
x n 1 g ( x n )
Key x0 into a calculator and ENTER.
Key the r.h.s. of the formula into the calculator,
replacing x with ANS.
Press ENTER as many times as required to get
the solution to the specified accuracy.
Iteration
e.g. 1(a) Show that the equation 2 x x 3
root in the interval
1 3 1 4
has a
.
f (1 3) 21.3 1 3 3 0 27
f (1 4) 21.4 1 4 3 0 10
Change of sign 1 3 1 4
Iteration
e.g. 1(a) Show that the equation 2 x x 3 has a
root in the interval
.
1 2
(b) Using the arrangement x 3 2 x write down
an iterative formula and use it to find the
root correct to 4 decimal places.
Solution: (b)
x 2
gives
x n 1 2 x n
x 0 1 5 x1 3 2 x0 3 2 15
1 414
x 2 1 3865
x 3 1 3776
It takes about 7 iterations to reach 1 3735 (4 d.p.)
Let
Iteration
Exercise
3
25
x
(b) Use the iterative formula n 1
n
with x 0 2 5 to find the solution, giving
your answer correct to 4 d.p.
2. (a) Show that the equation ln x 2 x 3 has
a solution between 1 and 2.
(b) Use the iterative formula x n1 ln x n x n 3
with x 0 1 5 to find the solution, giving your
answer correct to 4 d.p.
Iteration
Solutions
3
2
x
x
25 has a
1. (a) Show that the equation
f ( 2) 2 3 2 2 25 13 0
f ( 3) 3 3 3 2 25 11 0
Change of sign 2 3
(b) Use the iterative formula x n1 3 25 x n
with x 0 2 5 to find the solution, giving
Iteration
Solutions
2. (a) Show that the equation ln x 2 x 3 has
a solution between 1 and 2.
Solution: Let f ( x ) ln x 2 x 3
f (1) ln 1 2 3 1 0
f ( 2) ln 2 4 3 0 3 0
Change of sign 1 2
Iteration
Some arrangements of an equation give formulae
which do not give a solution.
3
We earlier met 3 arrangements of x 1 x
3 2
(i) x (1 x )
(ii) x 1
1
3
(iii) x
1 x
x2
0 605423 ( to 6 d.p. )
Now try (i) with x 0 0 5
We get x1 0 77 , x 2 0 30 , x 3 0 94 , . . .
and after a while the sequence just oscillates between
1 and 0.
This iterative sequence does not converge.
Iteration
Now try the formula x n1
1 xn
We get x1 1 17 , x 2 0 06 ,
xn
with x 0 0 5 .
Iteration
Iteration
Iteration
There are some equations that we cant solve.
e.g.
x 1 x3
Iteration
There are 2 stages to getting a solution:
Stage 1. Find a 1st estimate
Stage 2. Find a formula to improve the estimate.
Sometimes we can just spot an approximate solution
to an equation.
The solution to
x3 2x 1
Iteration
We often start by finding numbers ( bounds ) that lie
on either side of the solution. If these are integers
we call them integer bounds.
e.g. To find integer bounds for x 1 x 3 we
3
can sketch y x and y 1 x
y 1 x3
y
The solution
lies between
0 and 1.
0 and 1 are
the integer
bounds.
Iteration
The Algebraic Method:
If we want to show that 0 and 1 are integer
bounds, we show that f ( x ) has different signs
at 0 and 1.
Rearrange the equation to the form f ( x ) 0
e.g.
Define
Find
x 1 x
f ( x ):
Let
x3 1 x 0
f ( x) x 3 1 x
f (0) : f (0 ) 0 3 1 0 1
Find f (1) : f (1) 1 3 1 1 1
The change of sign 0 1
Change of sign
Iteration
e.g. 1 (a) Using a graphical calculator, or
otherwise, sketch, on the same axes, the graphs of
y x 3 2 and y 5 x
(b) From the sketch, find integer bounds for the
3
solution, , of the equation x 2 5 x
(c) Use an algebraic method to confirm these are
correct and give a 1st approximate solution.
Solution: (c) ( Confirm bounds are 0 and 1 )
Rearrange equation to f ( x ) 0 : x 3 5 x 2 0
f ( x) x 3 5 x 2
f ( 0) 2 0
f (1) 1 5 2 2 0
change of sign 0 1
Define
:
So,
The
A 1st approximation is any number between 0 and 1.
f ( x)
Iteration
The 1st approximate solution lies anywhere between
the bounds. The next stage is to improve this
estimate.
Rearrange the equation to the form x g ( x ) .
You may spot lots of ways of doing this. e.g.
x 1 x3 :
3 2
3
(
1
x
)
x
x
(i) Square:
3
3
x
1 x
x 1 x
(ii) Rearrange:
Cube root:
(iii) Rearrange:
Divide by x 2:
x 1 x
x 1 x
x3 1 x
1 x
x
x2
1
3
Iteration
1
3
We now have x1 1
x0
1
3
x n 1 1 x n
Iteration
SUMMARY
To find an approximation to a solution ( or root ) of
an equation:
Find a 1st approximation, often by finding integer
bounds for the solution. Let this be x0 .
Rearrange the equation into the form x g ( x )
Write the arrangement as an iterative formula:
x n 1 g ( x n )
Key x0 into a calculator and ENTER.
Key the r.h.s. of the formula into the calculator,
replacing x with ANS.
Press ENTER as many times as required to get
the solution to the specified accuracy.
Iteration
e.g. 1(a) Show that the equation 2 x x 3
root in the interval
1 3 1 4
has a
.
f ( x) 2 x x 3 0
f (1 3) 21.3 1 3 3 0 27
f (1 4) 21.4 1 4 3 0 10
Change of sign 1 3 1 4
Iteration
Solution: (b)
x 3 2x
x n 1 3 2 x n
gives
x 0 1 5 x1 2 2 15
1 414
x 2 1 3865
x 3 1 3776
It takes about 7 iterations to reach 1 3735 (4 d.p.)
Let
x0
Iteration
Some arrangements of an equation give formulae
which do not give a solution.
We earlier met 3 arrangements of x 1 x 3
3 2
(i) x (1 x )
(ii) x 1
x 1 x
1
3
1 x
1 x
x
x2
(iii) x
0 605423 ( to 6 d.p. )
Trying (i) with x 0 0 5
gives x1 0 77 , x 2 0 30 , x 3 0 94 , . . .
Iteration
Trying the arrangement
1 x
x
with x 0 0 5
gives x1 1 17 , x 2 0 06 ,
The iteration then fails because we are trying to
square root a negative number.
Some arrangements of an equation give an iterative
sequence which converges to a solution; others do
not converge.