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

# C3 Numerical Solutions to Equations

Extracts from this document...

Introduction

Numerical Solutions to Equations Coursework

Change of sign method

The change of sign method involves finding the interval in which a root of an equation lies by taking two values of x and showing that the root lies between them as the value of f(x) for each case has a different sign. A change of sign will always indicate a root if the function is continuous.

This method will be used to find a root of the equation f(x)=x⁵+x⁴−2x³+5x²−7x−2=0. As the function f(x) is continuous, a change of sign will always indicate a root. The method will be used to find the root which lies between -2 and -3 As the root lies in the interval [-2.7211575,-2.7211574], x=-2.72115745 ± 0.000000005 Here it is shown that f(x) changes from negative to positive between -2.7211575 and-2.7211574 and the root to f(x)=0 is between these x values.

This method can fail to find roots in some cases. For example if the equation has a repeated root as shown below for the equation x³−0.96x²−5.

Middle

Therefore x=-1.53407020 ± 0.000000005

To confirm this root there must be a change of sign. f(-1.5340703) = 1.16*10^-6.

f(-1.5340701) = -1.08*10^-6. Therefore there is a root as the function is continuous.  These two diagrams show the convergence of the iterations at different magnifications. It is shown that the root lies between -1.53407035 and -1.53407025.

Taking 1 as the first guess gives the following results Therefore x=0.48269595 ± 0.000000005

f( 0.48269594) = -1.08*10^-7. f(0.48269596) = 0.0113

Therefore there is a root as the function is continuous.

Taking 4 as the first guess gives

Therefore x=4.05137424 ± 0.000000005 f(4.05137423) = 2.34*10^-7  f(4.05137425) = -1.65*10^-7

Therefore there is a root as the function is continuous.

This method can fail for some starting points such as ones where the gradient of the curve is very small which can lead to the iterations converging on the wrong root. For the equation ¼x³−½x²−2x+3=0, an initial guess of 2.35 to find the root between 0 and 3 makes the iteration converge on the root between -4 and -2 as shown below. Rearranging f(x)=0 in the form x=g(x)

In this method the equation f(x)

Conclusion

The change of sign method was fairly easy to use as it requires little extra hardware or software and can be carried out manually if necessary using only a calculator. This makes it particularly useful if computer software is not available. However the need for much manual computation can make the process quite laborious and time consuming. The Newton-Raphson and x=g(x) methods are relatively similar in terms of ease of use with hardware and software. Both make good use of Autograph software visually interpret equations before using an Excel spreadsheet to carry out the calculations to find each root. Compared to the change of sign method both are generally more easy to use as once the initial formula has been entered it is very quick and simple to do the iterations many times.

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)

The chance of this happening is quite high. As for the speed of convergence, it would be slower that Newton Raphson because of the extra time needed to re-arrange the equation but it is faster than Decimal search. With the use of Excel, it is very easy to enter the x = g(x)

2.  5 star(s)

(xn-2)(h) + ... + hn-1 h 2! Since h limits to 0, all values containing an h term are therefore all worth 0, so therefore the gradient function for xn = nxn-1 However, in this section, this is perhaps only true for positive integers for the value of n.

1. ## MEI numerical Methods

The secant method does not require two approximations of the root to be used which are of opposite signs, unlike method of bisection and method of false position; as a result secant method may not always converge. However to carry on this way is impractical and doesn't relate to my

2. ## Numerical solutions of equations

The error bound is: 0.0000000005 However, the Newton-Raphson method would not work with the graph below: If I start from the turning point of the curve, I do not think it will converge (see Figure 4). The equation for this function is 0 = x4+2x3+3x-4 f'(x)

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

2.474378 2.476790 15 -1.169712 -1.170331 16 2.476790 2.478350 16 -1.170331 -1.169927 17 2.478350 2.479357 17 -1.169927 -1.170191 18 2.479357 2.480008 18 -1.170191 -1.170019 This proves furthermore both starting value do not converges to the target root and in this case it cannot be use to find the target root therefore

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

16 0.635070801 0.00021312 0.6351013 -0.0001467 0.63508606 3.322E-05 1.52588E-05 17 0.63508606 3.3219E-05 0.6351013 -0.0001467 0.635093689 -5.67E-05 7.62939E-06 18 0.63508606 3.3219E-05 0.6350937 -5.673E-05 0.635089874 -1.18E-05 3.8147E-06 Spreadsheet 4.2 The bisection method turns out to achieve the root 0.63509 with error bounds of Again, by applying these into the spreadsheet 4.3, the Newton-Raphson method gives us the following result: r Xr f(Xr)

1. ## OCR MEI C3 Coursework - Numerical Methods

-0.00339 2.64527 x6 -1.76245 -0.00001 2.62496 x7 -1.76244 0.00000 2.62488 x8 -1.76244 0.00000 2.62488 x=2.62488 (5d.p.) Failure of the Newton-Raphson method The method fails for the same function if x1=0 xn f(xn) f'(xn) x1 0 0.60317 -0.14172 x2 4.25600 1.05148 -0.02495 x3 46.40573 1.00046 -0.00002 x4 Value could not be

2. ## Numerical integration can be described as set of algorithms for calculating the numerical value ...

The use of polynomials: The mid-point rule is a second order polynomial which overestimates convex curves. The function I am integrating also follows a convex curve. As a result I expect the consecutive values of the mid-point to decrease as this polynomial overestimates. • Over 160,000 pieces
of student written work
• Annotated by
experienced teachers
• Ideas and feedback to 