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

# decimal search

Extracts from this document...

Introduction

Introduction

In maths equations can be solved using various methods. A very common and efficient method in solving equations is algebraically. But not all equations can be solved algebraically; these equations must be solved using numeric methods.

I will study three specific numeric methods on different equations.

~ Change of sign, decimal search process.

~ Newton-Raphson method.

~ Re-arrangement method.

I will be testing the numeric methods with separate equations which cannot be solved algebraically. I will also apply all of the methods to one of the equations and check if all the methods give me the same value for the root I want to find.

Change of Sign, Decimal Search

To find the root of the equation f(x) = 0 means finding values of x for the graph          y = f(x). The change of sign method works on the bases that the y = f(x) graph changes signs when it crosses the x-axis. e.g. y = f(x) The sketch above shows that there is a root between the interval [b , c] and the curve of y = f(x) crosses the x-axis and changes its sign from negative ( - ) to positive ( + ), and at the interval [a , b] f(x) curve crosses the x-axis changing its sign from positive  ( + ) to negative ( - ).

Middle 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.

A chosen equation and an estimate root value are used with the iterative           Newton-Raphson formula to eventually converge to the actual root.

Failure of Newton-Raphson Method

The Newton-Raphson method will fail if the starting point is carelessly selected. If the initial value of x is not close to the root needed to be found, the Newton-Raphson formula may not converge to the root. Also if the initial value is selected close to a turning point then it will also cause the formula to either diverge or converge to another root.  eg The selected initial value lies to close to the turning point of the f(x) curve, this creates the tangent from the initial value to diverge outside the area of the f(x) curve. This subsequently renders the method to fail as no further estimates of the root can be obtained.

When trying to find the root between the interval [0 , 1] and using the initial value as 0.88.  The tangent is forced to diverge from the f(x) curve, this illustrates the failure of the Newton-Raphson method.

Newton-Raphson Method in Practise

The equation to be used in finding a root using the Newton-Raphson method is,

y = xµ - 3x + 1

Sketch of       y = xµ - 3x + 1

 Sketch of y = xµ - 3x + 1 with tangent line markings.Initial value = 2 (x  )

Conclusion

The Newton-Raphson method only required two iterations before converging to the required root.

The change of sign method had to go through six cycles before producing the required root correct to six decimal places.

The re-arrangement method went through four iterations to produce the root value.

Although the re-arrangement method only marginally lost in time efficiency when compared to the Newton-Raphson method; the re-arrangement method proves to be the most demanding. As the re-arrangement method relies on producing a re-arrangement to the form of y = g(x) and satisfies the fact y = g` (x) < y = x`.

The change of sign, decimal search method is a very straight forward method which can be applied easier then the other methods, but lacks in its rate of convergence.

So in an overall comparison I can state that the Newton-Raphson method has the fastest rate of convergence, and thus has an efficient process of finding the desired root of an equation that must be solved numerically.

The use of software packages and hardware devices make understanding the methods and application of the methods faster and more accurate.

Using Excel spreadsheet in displaying the calculations for the change of sign method proved to be efficient as it enabled repetitions of calculations to be performed much faster than by manual process.

Also using graphical displaying software such as Autograph allowed easier demonstration of the process of the different methods, and a more accurate interpretation of the methods.

This student written piece of work is one of many that can be found in our AS and A Level Decision 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 Decision Mathematics essays

1.  5 star(s)

Therefore the gradient function of x5 = 5x4, which corresponds to my results earlier in the tables, proving my predictions of the gradient function was correct. After investigating the gradient function where a is a constant 1, and n is always a whole number, I have concluded this section with

2. ## Pure 2 coursework - Decimal Search Method

This is done using the following equations. The gradient of y=f(x) at a certain point P on the graph whose x-coordinate is x1 is equal to both f1(x1) and also f(x1)-0 x1-x2 Therefore, f1(x1)=f(x1) x1-x2 and x2= x1-f(x1) f1(x1) So, in order to calculate the next estimate of x, called

1. ## Change of Sign Method.

x -2 -1 0 1 f(x) 3.42 0.42 -4.58 -5.58 The above table illustrates that a sensible first approximation of the value of the root, x0, would be -1. A tangent to the curve at this point is drawn. Where this tangent cuts the x-axis, will be my next approximation of the root.

2. ## 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.

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

This is explained with a diagram with of Rearrangement A and its iterative formula below. This failure is shown graphically below: From the graph above, I can see that there is no convergence to that particular root I am looking for, but I want to test it again by substitution

2. the 'x' axis, they will be dividing by each other, so therefore the answer will equal to 1, therefore the gradient will be 1. 'y=2x' solved by the 'Triangle Method' x -4 -3 -2 -1 0 1 2 3 4 2x -8 -6 -4 -2 0 2 4 6 8

1. ## maths pure

For this particular rearrangement, g(x)= 3?(3x+5): g?(x) = (3x+5)-2/3 = 1/(3x+5)-2/3 With x0 = 2 g?(2) =0.202 and because? ?g?(2) ?< 1, the sequence converges. Situation where Iteration Fails to Converge to required root. The equation x3-3x-5=0 can be rearranged so that x = (x3-5)/3.

2. ## MEI numerical Methods

False position method: Evaluating this formula, lets assume f(a) = -2 and f (b) = 10, lets assume C = 3, however the f(c) = -5, this means for the new equation would involve b and a would be replaced by c. • Over 160,000 pieces
of student written work
• Annotated by
experienced teachers
• Ideas and feedback to 