Approximating roots of polynomials
Abstract
This work consists of applying methods of dynamical systems in complex variables to an applied
problem: nding the roots of an arbitrary polynomial.
Speci cally, we use the iteration z 7! z2 + c to nd the roots of a complex polynomial p(z).
By applying that iteration we can use concepts of complex analysis and linear algebra, such as the
Mandelbrot set and the Vandermonde matrix to tackle our problem.
We see how these ideas have applications in other contexts, such as number theory. We add
the discussion of pseudo code and code written in Python 3, for the sake of doing experiments
that illustrate the di erent sections of this thesis. This discussion let us analyse the computational
complexity of the algorithm on top of the mathematical discussion.
Temas
Polinomios
Algoritmos
Sistemas dinámicos diferenciales
Algoritmos
Sistemas dinámicos diferenciales
Para optar el título de
Licenciado en Matemáticas