On the basins of attraction of root-finding algorithms

Authors

  • David Rosado Rodríguez Universitat de Barcelona

Keywords:

dynamical systems, root-finding algorithms, Newton’s method, Traub’s method

Abstract

Root-finding algorithms have historically been used to numerically solve nonlinear equations of the form f (x)=0. This paper studies the dynamics of the parameterized Traub family Tp,δ applied to polynomials, ranging from Newton’s method (δ = 0) to Traub’s method (δ = 1). We focus on topological properties of the immediate basins of attraction of the finite fixed points, especially simple connectivity and unboundedness, which are key to identifying a universal set of initial conditions ensuring convergence to all roots of p.

Downloads

Download data is not yet available.

Downloads

Published

2025-12-04

How to Cite

Rosado Rodríguez, D. (2025). On the basins of attraction of root-finding algorithms. Reports@SCM, 10(1), 13–21. Retrieved from https://revistes.iec.cat/index.php/reports/article/view/154822

Issue

Section

Articles

Most read articles by the same author(s)