• Join over 1.2 million students every month
• Accelerate your learning by 29%
• Unlimited access from just £6.99 per month

# Find methods of solving equations, which can't be solved algebraically.

Extracts from this document...

Introduction

Frayer Walker

SF2

Pure 2 Coursework

The purpose of this investigation is to find methods of solving equations, which can’t be solved algebraically. There are three methods, which can be used to do this: decimal search, Newton-Raphson and rearranging f(x)=0 in the form x=g(x). Then evaluate the usefulness of each method by analysing disadvantages and advantages of each. Finally the best method will be identified.

## Decimal Search

This method uses the fact that as the curve passes through the x-axis there is a change of sign, to identify roots of a chosen function. The fact that there is a change of sign means that the root can be identified to a chosen degree of accuracy in this case four decimal places. This is done by taking increments in x of size 0.1 within an interval containing a root and working out the value of the function for each one. When there is a change of sign this can be repeated between the two value at which it occurs using increments of 0.01 etc. this method is to be used to find the roots for the function x3-3x2+1. The roots, which are to be, identified lie within the intervals [0,1], [-1,0] and [2,3] as shown on the below graph. Middle

2.875

2.876

2.877

2.878

-0.0708

-0.0633

-0.05579

-0.04827

-0.04074

-0.0332

-0.02565

-0.01809

-0.01051

2.879

2.88

-0.00293

0.004672

2.879

2.8791

2.8792

2.8793

2.8794

2.8795

2.8796

2.8797

2.8798

-0.00293

-0.00217

-0.00141

-0.00065

0.000112

0.000872

0.001632

0.002392

0.003152

Therefore it is clear that the error bounds for this root are [2.8793, 2.8794] as such the solution is 2.87935 and the maximum error is +0.00005 or –0.00005.

However in a number of cases the change of sign method will not work as shown below. This method also does not work when there are several roots, which are extremely close together. In this case it will often only pick up one of the roots. There are also problems when there is a discontinuity in f(x). For example the function 1/x +2.6 has no root which is made clear in the below graph. Instead they converge to the false root highlighted by the dotted line. Newton-Raphson

This method works on the theory that “the tangent to a curve can be used to obtain improved approximations to a root of an equation f(x)=0.” (A-level & As level mathematics, Longman revise guides.) This is a fixed-point estimation method as it is necessary to use an estimate of the root as a starting point. An estimate of x1 for a root or f(x)=0 is made and then the tangent to the curve y=f(x) at the point (x1,f(x1)) is drawn. The point at which the tangent crosses the x-axis gives the next approximation for the root and the process can then be repeated until the required degree of accuracy has been reached (shown on enlarged graph.) Therefore this method can be used to find the roots for the function x3-4x2+2x+2 as is shown below.  The general formula for Newton-Raphson is   xn+1 = xn –f(x)

F’(x)

This formula will be used to find the roots for this function as shown below. Once this method has been used decimal search can be used to find the interval which the root lies in.

[-1,0]         x1 = 0

x2 = -1 this is the root for this interval as the curve passes directly through –1.

[1,2]        x1 = 1

x2 = 1.3

x3 = 1.31

x4 = 1.311 this is the root for this interval to three decimal places.

 1.31 1.311 1.312 0.003691 0.000359 -0.00297

This shows that the error bounds for this root are [1.311, 1.312] making the solution 1.3115and therefore the maximum error is +0.0005 or –0.0005

[3,4]        x1 = 4

x2 = 3.4

x3 = 3.22

x4 = 3.171 this is the root for this interval to three decimal places.

 3.17 3.171 3.172 -0.00059 0.006205 0.013008

Conclusion

Newton-Raphson

The major advantage of this method is that it usually gives a rapid rate of convergence, even when the first approximation is poor. Therefore there is much less work involved than there is when using decimal search.

The disadvantages of this method are that if a poor starting point is chosen for example one when there will not be a tangent a root will not be converged on. Also when the estimate made is close to a turning point the root which is converged on may not be the correct one. Finally if the function is discontinuous then this method can’t be used to find the roots.

Rearranging the formula

The advantages of this method are that it gives a rapid rate of convergence and that it is not time consuming.

The disadvantages are that it does not work when the root that is being found lies on a gradient steeper than 1 or –1. It is also unsuccessful if successive iterations do not converge and if they do not converge on the root which is being found.

This student written piece of work is one of many that can be found in our AS and A Level Core & Pure Mathematics section.

## Found what you're looking for?

• Start learning 29% faster today
• 150,000+ documents available
• Just £6.99 a month

Not the one? Search for your essay title...
• Join over 1.2 million students every month
• Accelerate your learning by 29%
• Unlimited access from just £6.99 per month

# Related AS and A Level Core & Pure Mathematics essays

1.  ## C3 Coursework - different methods of solving equations.

5 star(s)

graph is wrong. The iterations are also wrong as they diverge away from the point as well. If you differentiate the y = g(x) function and substitute x for the approximation of the root. If that g'(x) < -1 or g'(x)

2.  5 star(s)

80 3 81 405 4 256 1280 Points Gradient 1,1 5 2,32 80 3,243 405 4,(1024) 1280 The general pattern here between the two values of x and the gradient, the value of the gradient function here is 5x4, as seen when comparing the two smaller tables above.

1. ## Mathematical equations can be solved in many ways; however some equations cannot be solved ...

Therefore, at the root, 0<g'(x) <1 and so the method is successful. From the table we can see that two values match to 5 significant figures. U7 and U8 agree to 5 significant figures giving a value of -3.4115.

2. ## Solving Equations. Three numerical methods are discussed in this investigation. There are advantages and ...

from this fix point and eventually it will converge to the roots. This method requires us to start with a point which is close to the target root and we call it. Then we will find the gradient - at Cartesian co-ordinate and we can find the better estimation -

1. ## Numerical solution of equations, Interval bisection---change of sign methods, Fixed point iteration ---the Newton-Raphson ...

r Xr f(Xr) f'(Xr) f(Xr)/f'(Xr) 1 2 29 47 0.617021277 2 1.382978723 7.671007388 23.2775011 0.329546 3 1.053432723 1.678766068 13.4149463 0.125141468 4 0.928291256 0.205236732 10.1818519 0.020157112 5 0.908134144 0.004995226 9.68744176 0.000515639 6 0.907618504 3.23625E-06 9.67489018 3.345E-07 7 0.90761817 1.36247E-12 9.67488204 1.40825E-13 Spreadsheet 2.3 From spreadsheet 2.3 above, rounding up the solution to 5 decimal places, I get the solution of 0.90762.

2. This method is much more accurate than the 'triangle method'. Here is an example of how to use the Increment Method: The first thing you need to do is to draw the tangent across the point you want to calculate.

1. ## C3 COURSEWORK - comparing methods of solving functions

Therefore, I can state that the error bounds are -3.52695 and -3.52685 I can also write the solution bounds as the error bounds-3.5269±0.00005 I can see that all values in the range (-3.52685, -3.52695) round to -3.5269. Therefore, I can say that the root is -3.5269to 5 sig.figs.

2. ## Evaluating Three Methods of Solving Equations.

I found the derivative of the function and got f'(x) = 3x2 +16x-13 which helped me to derive the equation of the tangent. By similar calculation of the value of 'c' we derive the following formula for this tangent and the point x. • Over 160,000 pieces
of student written work
• Annotated by
experienced teachers
• Ideas and feedback to 