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

# Solving Cubic equations or polynomials of greater order

Extracts from this document...

Introduction

Solving Cubic equations or polynomials of greater order

I firstly solved our quadratic equations using factorising, this worked well until I found equations that have factors that are not whole. I used the formula for these equations, although the formula is very hard to remember and if it’s written incorrectly the answer will be wrong, so I tried using graphs this was ok although the graphs are not very accurate, they are only around 1 decimal place.

Factorise

X² - 6x + 5

(x – 5) (x – 1) = 0

x = 5 or x = 1

Solve using formula

• b +/- √ b² - 4ac 2a

+ 6 +/- √ 36 – 4 x 1 x -5 2 x 1

+ 6 + √ 56        or         + 6 - √ 56  2                               2

Cubic

Here I first tried solving the equations by factorising, as with the quadratic equations this worked well until I came across equations with factors including decimal places. For these I tried as before to use the formula but I firstly need to find one of the factors, and if all factors include decimal places this can be difficult. So I lastly

Middle

x + 1 √ x³ - 4x² + x + 6

- x³ + x²

- 5x² + x - - 5x² - 5x

6x + 6 -  6x + 6 (x + 1) (x² - 5x + 6)

(x + 1) (x – 3) (x – 2)

Change of Sign

There are three types:-

1. Interval Estimation which includes
1. Decimal Search
2. Interval Bisection
1. Linear Interpolation

I have decided to use decimal search.

In order to use this method I must find an approximate root. I have already drawn the graph and so I can see that there is a root that lies between 1 and 2.

From my graph I know the root is 2.8 correct to one decimal place. With decimal search to find a more accurate value for the root I must look for a change of sign to locate the root. With decimal search after each iteration I divide the interval into 10 equal parts.

• Step 1 – Once a root is found, you use increments of firstly 0.1 working out the value for the function. You do this until a change of sign is found.
• Step 2 – There is a change of sign, therefore there is a root. Having narrowed down the interval, you continue with increments of 0.001. looking for a change of sign.
• Step 3 – This process is continued to find a more accurate root, which is usually a value correct to 5 decimal places.

Whilst using the change of sign method to locate accurate values for roots I came across some equations where there is a root but the change of sign method does not show the root, this is because there is no change of sign. I feel this method is not reliable enough as it does not find all roots. I am now going to research other methods of finding roots.

Fixed point iteration

In fixed point iteration you find a single value as your estimate for the x value. This involves an interactive process a method of generating a sequence of numbers by continued repetition of the same procedure. If the numbers obtained in this manner approach some limiting value, they are said to converge to this value.

• Step 1 – With the chosen equation, you must rearrange it in the form x = g ’ (x). This provides the basis for the iterative formula.
• Step 2 – Choose a start value for x.
• Step 3 – Find the corresponding value of g ‘ (x).

Conclusion

x values oscillate about the root.

If the equation is arranged in some ways the equation will not converge as x = g ‘ (x)will only converge to a root if    -1 < g ‘ (x) < 1     for values of x close to the root.      Newton Raphson

Another fixed point estimation method, and as with the previous method it is necessary to use an estimate of the root as a starting point.

• Step 1 - You start with an estimate, x1, for a root of f ’ (x) = 0.
• Step 2 – You then draw a tangent to the curve Y = f ‘ (x) at the point (x1, f ‘ (x)).
• Step 3 – The point at which the tangent cuts the x axis then gives the next approximation for the root.
• Step 4 – This process is then repeated until the values converge.   I have come across a few problems with this method also as if a poor starting value is chosen, the iteration may diverge. Or the tangent may meet the axis at a point outside the domain of the function. If this happens you will not locate the root, even if it is there.

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)

From my graph, I can see that my X0 will be -2. To work out X1 I will use the formula above to work out X1 in steps and will repeat it to find a root to 5d.p and summarise in a table: Here are the results from the Iterations:

2.  5 star(s)

is fairly apparent - with the same n value, only the "a" values change when investigated. I have, again, noticed that this follows a same general pattern as the previous table full of x� values. The general pattern here is that 3(nxn-1)

1. ## Numerical solutions of equations

the point of intersection between y = x and y = g(x) = (-4x2+2)1/5 is between x = 0 and x = 1. Like before, I will take my starting value of x (x1) to be 0.5. The same process of substituting values of x into the iterative formula, as in the last Rearrangement is carried out here.

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

Speed of Convergence To calculate the root to 3 decimal places using decimal search it requires 4 tables of values to calculate the root whereas with x=g(x) iteration and also Newton Raphson only 1 table of values is required. We can thereby conclude that the Decimal search method is the slowest.

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

= 0 into the form x = g(x), as both of them are more likely to take more steps to achieve finding a root in a given level of accuracy. Ease of use with available hardware and software It is obvious that the Newton-Raphson method is the fastest to find the root in this case.

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

3rd 18 From the table above, it shows there are 36 calculations for change of signs, 5 calculations for Newton Raphson and 18 calculations for x=g(x). To conclude, Newton Raphson method is the quickest in find the root, followed by x=g(x) method and the slowest is change of signs method.

1. ## Fractals. In order to create a fractal, you will need to be acquainted ...

or generate attracted sequences. However, it is way too tedious to require performing all of the iterations of the possible values of c, therefore we use The Escape Criterion, which states that if |c| is less than or equal to 2 and if the absolute value of zn under z2

2. ## Evaluating Three Methods of Solving Equations.

The reason this method works is represented by this graph: After taking an x-value you find g(x) of that value. You then use this g(x)-value again as the new x and continue along in this manner whilst converging upon the root. • Over 160,000 pieces
of student written work
• Annotated by
experienced teachers
• Ideas and feedback to 