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

# 'Change of Sign Method'

Extracts from this document...

Introduction

Mathematics Coursework

Numerical Methods can be used to solve those equations which cannot be solved analytically.

One such method is the ‘Change of Sign Method’, focusing on Decimal Search.

Decimal search is based on the principal that f(x) changes sign as a curve passes through the x axis at a root. Above the x axis, f(x) is positive and below the x axis f(x) is negative.

Using this principal, values of f(x) are initially found and consecutive values are found in increments of 0.1 until a change in sign is found. If further accuracy is required, consecutives values could then be found in increments of 0.01 and 0.001, until a change of accuracy is found, therefore giving one root of the equation.

Evidence

Equation: y=0.6938x3 – 0.9157x2 – 1.421x + 1.671

Graph: Table of results

First Interval

 x f(x) 1 0.0281 1.1 -0.07665 1.2 -0.1539 1.3 -0.1996 1.4 -0.2094 1.5 -0.1792 1.6 -0.105 1.7 0.01757 1.8 0.1926 1.9 0.4242

The table shows that the sign changes within the interval 1.6 to 1.7. This tell us that the roots lie somewhere within this interval;

Therefore the root is 1.65 ± 0.05

Second Interval

 X f(x) 1.6 -0.105 1.61 -0.09497 1.62 -0.08447 1.63 -0.07348 1.64 -0.06199 1.65 -0.05001 1.66 -0.03752 1.67 -0.02452 1.68 -0.01101 1.69 0.003019

The table of values shows that the root lies in the interval [1.68, 1.69]. Therefore the root of the equation is 1.685 ± 0.05

Third Interval

 x f(x) 1.68 -0.01101 1.681 -0.009628 1.682 -0.008243 1.683 -0.006854 1.684 -0.005459 1.685 -0.004059 1.686 -0.002654 1.687 -0.001243 1.688 0.0001725 1.689 0.001593 1.69 0.003019

Middle

Using this method, a first approximation, x1 is made. The intercept of the tangent at (x1,y1) with the x axis is found as the next approximation, x2. This process is repeated until the desired accuracy is achieved. This method is also known as the ‘Tangent Sliding’ method.

This method can be demonstrated manually, using the equation: y= 20x3 + 15x2 – 15x – 12

F (x) = 20x3 + 15x2 – 15x – 12

F’(x) = 60x2 + 30x – 15

First estimate x1 will be 1

First iteration

F (1) = 20(13) + 15(12) -15(1) – 12 = 8

F’(1) = 60(12) + 30(1) – 15 = 75

X2 = 1 – 8/75

X2 = 0.8933

Second Iteration

F (0.8933) = 20(0.89333) + 15(0.89332) – 15(0.8933) – 12 = 0.82906074

F’(0.8933) = 60(0.89332) + 30(0.8933) – 15 = 59.68266667

X3 = 0.8933 – 0.829/59.68266667

X3 = 0.879442165

X3 = 0.8794

Third iteration

F (0.8794) = 20(0.87943) + 15(0.87942) -15(0.8794) – 12 = 0.01318348

F’(0.8794) = 60(0.87942) + 30(0.8794) – 15 =  57.78837624

X4 = 0.8794 – 0.013/57.79

X4 = 0.879214031

X4 = 0.8792

This can also be demonstrated graphically using the computer programme autograph:

y= 20x3 + 15x2 – 15x – 12 First iteration X = 0.8933

Second iteration X = 0.8794

Third Iteration X = 0.8792

The results have converged to 0.8792

To confirm that this is a root by looking for a change of sign

F (x) = 20x3 + 15x2 – 15x – 12

F (0.8791) = -6.5827 x 10-3 = negative

F (0.8792) = positive

Therefore the root is 0.87925 ±0.00005

Where the method cannot work

If the initial estimate is too far from the required root, the method can fail.

This can be shown using the equation y=20x3 + 15x2 – 8x – 19 Take the initial estimate as x1 = -1

First Iteration x = - 0.2727

Second Iteration x = -1.647

Third Iteration x=-1.13

Evidently, this method fails in this instance.

Conclusion

Whilst the Newton Raphson method allows quick convergence, and is easy to perform on autograph, the method could be criticised, as it requires calculus, unlike decimal search. It can also be subject to failure, for example, if the initial estimate is made too far from the required root. Furthermore, to find an error bound for increased accuracy, decimal search needs to be carried out, again adding to the amount of work required. This disadvantage can also be applied to the graphical convergence method. In this method, there is also a high failure rate, as it can diverge, oscillate or converge to the wrong root, as shown in the calculations. Also, you may not be able to rearrange f(x) =0, in which case this method could not be used.

Therefore, in conclusion, whilst each method can be used to find roots, a d=sketch of the graph should be drawn, before deciding upon which method will work the best, and the level of accuracy that is desired.

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.  5 star(s)

Using these data, I predict that the next table containing the gradient of will display 1500. 5 625 1875 1500 Binomial proof shall verify this for us, though realistically enough, the table provides enough evidence. 3 (x+h) 4 - 3x4 = 3(x4 + h4 +4hx� + 6x�h� + 4xh�)

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

f(Xr)/ f'(Xr) 1 -1 20 -10 -2 2 1 -4 -10 0.4 3 0.6 0.416 -11.92 -0.034899329 4 0.634899329 0.00223484 -11.79070853 -0.000189542 5 0.635088871 6.84356E-08 -11.78998638 -5.80456E-09 6 0.635088877 0 -11.78998635 0 7 0.635088877 0 -11.78998635 0 Spreadsheet 4.3 Newton-Raphson has found the root 0.63509 as well.

1. ## Different methods of solving equations compared. From the Excel tables of each method, we ...

and hence find the intersection points of y=x and g(x). The corresponding x values are the roots of f(x)=0. Equation 3: Rearrange the equation, let � � Use Autograph to draw the graphs of and. We can see from the graph that the method leads us to one root efficiently.

2. ## The method I am going to use to solve x&amp;amp;#8722;3x-1=0 is the Change ...

This is because the roots are so near, there are two roots in one interval, no matter where we set the starting value of x is, we will always miss the other root. Also, as the g'(x) there is diverging, the root found will usually the wrong root.

1. ## decimal search

This procedure is repeated until the x value converges to a fixed value, the root of f(x). eg The tangent produces a closer estimate of the root. This eventually leads to the actual root. From this procedure the Newton-Raphson iterative formula is produced.

2. ## Using Decimal search

as follows: X 0.5 0.38835 0.37527 0.37510 Xn+1 0.38835 0.37527 0.37510 0.37510 - Graph 5 - We can express this information as; the root can be taken as 0.37510 with maximum error of + 0.000005. Therefore 0.375095 < X < 0.375105.

1. ## Change of Sign Method

x = -1.77045 � 0.0005 Failure of the Change of Sign Method When an equation has more than one root between two integers not all or none of the roots may be identified using an integer search. For example the equation x3-19x+31=0 has two roots between x=2 and x=3 as shown in the graph of y= x3-19x+31.

2. ## Analyse the use of three methods which are called the: change of sign, Newton-Raphson ...

FOR F(X)= x5+4x4-6x x f(x) x f(x) x f(x) x f(x) x f(x) -4 24 1 -1 1 -1 1.05 -0.16169 1.058 -0.01045 -3 99 1.1 0.86691 1.01 -0.84657 1.051 -0.14306 1.0581 -0.00853 -2 44 1.2 3.58272 1.02 -0.68619 1.052 -0.12434 1.0582 -0.0066 -1 9 1.3 7.33733 1.03 -0.51869 1.053 • Over 160,000 pieces
of student written work
• Annotated by
experienced teachers
• Ideas and feedback to 