2
$\begingroup$

Is there a way to find all roots of a polynomial equation?

Lets say $x^5+ax^4+bx^3+cx^2+dx+e=0$

how to find its all roots?

  • 0
    possible duplicate of [Is there$a$general formula for solving 4th degree equations?](http://math.stackexchange.com/questions/785/is-there-a-general-formula-for-solving-4th-degree-equations)2012-04-19

2 Answers 2

8

A theorem by Abel and Ruffini (see e.g. http://en.wikipedia.org/wiki/Abel-Ruffini_theorem) states that there is no general way of expressing (explicitly) the roots of a polynomial of order 5 or more or said differently, that there exists polynomials of order 5 or more for which it is impossible to do so. (However, and as was mentioned in other comments, there exists ways of approximating the roots with arbitrary precisions)

Now there exists methods to find the number of roots in a particular zone. See e.g. Sturm method, Budan-Fourier, Routh-Hurwitz (argument principle),

and also, exclusion/inclusion theorem (e.g. van der Sluis' theorem, Laguerre's theorem).

So the brief answer to your question is: no there is not. However there are a lot of methods to characterize the localization of the roots or to approximate the roots.

EDIT: precisions added following comments by Franklin.vp.

  • 1
    Put another way: yes, the roots of polynomials of degree higher than four can be expressed in closed form, but they involve the use of special functions, like hypergeometric, elliptic, or theta functions. This is completely analogous to the *casus irreducibilis* of the cubic equation, which requires trigonometric/hyperbolic functions for the solution...2012-04-19
1

I'm reading this paper of AMS http://www.ams.org/bookstore/pspdf/stml-35-prev.pdf really, an equation of degree 5, is not easy to solve, unless that you have some properties over the coefficients.