ABSTRACT -Numerical methods for approximating the roots of a polynomial-

In this paper I tried to review the popular notions concerning the rings of polynomials, focusing on their roots. In the first chapter I present the theoretical aspects of the roots of a polynomial and introduced the important results in mathematics, such as The Fundamental Theorem of Algebra and AbelRuffini Theorem. In the second chapter I put forward some examples of numerical methods for approximating the roots of a polynomial, such as: Newton's method, chord method, Bairstow's method and in the last chapter I introduce an implementation of these methods in Matlab. This work is the result of my own activity. I have neither given nor received unauthorized assistance on this work.