Approximating roots by quadratic iteration
Abstract We apply a coctel of elementary methods to the problem of finding the roots of an arbitrary polynomial. Specifically, we combine properties of the iteration z → z2 + c with rudimentary Galois theory in order to justify an algorithm to find the roots of a complex polynomial.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Universidad Católica del Norte, Departamento de Matemáticas
2023
|
| Online Access: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172023000200407 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
