How to find the roots of a polynomial of n^(th)nth degree?

2 Answers
Dec 23, 2015

It gets more complicated fast as nn increases...

Explanation:

Linear

ax+b = 0ax+b=0

Solution x = -b/ax=ba

Quadratic

ax^2+bx+c = 0ax2+bx+c=0

Solutions x = (-b+-sqrt(b^2-4ac))/(2a)x=b±b24ac2a

Cubic

ax^3+bx^2+cx+d = 0ax3+bx2+cx+d=0

Substitute x = t-b/(3a)x=tb3a to get a cubic in the form:

at^3+b_1t+c_1 = 0at3+b1t+c1=0

If this has exactly one Real root, then I like to use Cardano's method, substituting t = u+vt=u+v to get:

au^3+av^3+(3auv+b_1)(u+v)+c_1 = 0au3+av3+(3auv+b1)(u+v)+c1=0
then adding the constraint v = -b_1/(3au)v=b13au to eliminate the (u+v)(u+v) term. Multiplying through by u^3u3 results in a quadratic in u^3u3, whose two roots r_1r1 and r_2r2 are u^3u3 and v^3v3.

Hence:

x_1 = -b/(3a)+root(3)(r_1)+root(3)(r_2)x1=b3a+3r1+3r2

is the Real root, and the Complex roots are given by:

x_2 = -b/(3a)+omega root(3)(r_1)+omega^2 root(3)(r_2)x2=b3a+ω3r1+ω23r2

x_3 = -b/(3a)+omega^2 root(3)(r_1) + omega root(3)(r_2)x3=b3a+ω23r1+ω3r2

where omega = -1/2+sqrt(3)/2 iω=12+32i is the primitive Complex root of 11.

There are other methods for solving cubics. If the cubic has 33 Real roots then there is a neat trigonometric solution in terms of coscos and arccosarccos that you can reach by shoehorning the cubic into a form in terms of cos(3 theta)cos(3θ) using

cos(3 theta) = 4cos^3(theta)-3cos(theta)cos(3θ)=4cos3(θ)3cos(θ).

Of course this is not quite as algebraically nice as expressions in terms of nnth roots.

Quartic

ax^4+bx^3+cx^2+dx+e = 0ax4+bx3+cx2+dx+e=0

Substitute x = t-b/(4a)x=tb4a and divide through by aa to convert to the form:

t^4+a_1t^2+b_1t+c_1 = 0t4+a1t2+b1t+c1=0

Next consider possible quadratic factors of this:

t^4+a_1t^2+b_1t+c_1 = (t^2+At+B)(t^2-At+C)t4+a1t2+b1t+c1=(t2+At+B)(t2At+C)

=t^4+(B+C-A^2)t^2+A(C-B)t+BC=t4+(B+CA2)t2+A(CB)t+BC

Hence:

B+C = a_1+A^2B+C=a1+A2

C-B = b_1/ACB=b1A

BC= c_1BC=c1

So:

(a_1+A^2)^2 = (B+C)^2 = (C-B)^2 + 4BC = b_1^2/(A^2) + 4c_1(a1+A2)2=(B+C)2=(CB)2+4BC=b21A2+4c1

Hence:

A^2(a_1+A^2)^2-4c_1A^2-b_1^2 = 0A2(a1+A2)24c1A2b21=0

If you multiply this out, you get a cubic in A^2A2, hence 33 possible ways to factor the quartic as two quadratics.

Quintic

ax^5+bx^4+cx^3+dx^2+ex+f = 0ax5+bx4+cx3+dx2+ex+f=0

In general this has no algebraic solution in terms of nnth roots.

For example, the roots of x^5+4x+2 = 0x5+4x+2=0 are not expressible in terms of nnth roots.

Dec 23, 2015

You can find approximations for the roots of nnth degree polynomials using Newton's method.

Explanation:

Let f(x)f(x) be a polynomial, or indeed any nicely behaved function, whose zeros we want to find.

Given a first approximation a_0a0, you can iteratively apply the formula:

a_(i+1) = a_i - f(a_i)/(f'(a_i))

to find successively better approximations.

This works with both Real and Complex zeros.

To find different roots, start with different initial approximations.

To find reasonable initial approximations, look at the behaviour of the function a little, perhaps evaluating f(x) for a few different values first.