Boundedness and simple connectivity of the basins of attraction for some numerical methods

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Canela, Jordi, Garijo, Antonio, Jarque, Xavier
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911083821793280
author Canela, Jordi
Garijo, Antonio
Jarque, Xavier
author_facet Canela, Jordi
Garijo, Antonio
Jarque, Xavier
contents In this paper we study the dynamics of Halley's and Traub's root-finding algorithms applied to a symmetric family of polynomials of degree $d+1\geq 3$. We discuss the (un)boundedness and simple connectivity of the immediate basins of attraction of the fixed points associated to the roots of the polynomials. In particular, we show the existence of polynomials for which the immediate basin of attraction of a root is bounded under Halley's method
format Preprint
id arxiv_https___arxiv_org_abs_2507_22704
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Boundedness and simple connectivity of the basins of attraction for some numerical methods
Canela, Jordi
Garijo, Antonio
Jarque, Xavier
Dynamical Systems
37F10
In this paper we study the dynamics of Halley's and Traub's root-finding algorithms applied to a symmetric family of polynomials of degree $d+1\geq 3$. We discuss the (un)boundedness and simple connectivity of the immediate basins of attraction of the fixed points associated to the roots of the polynomials. In particular, we show the existence of polynomials for which the immediate basin of attraction of a root is bounded under Halley's method
title Boundedness and simple connectivity of the basins of attraction for some numerical methods
topic Dynamical Systems
37F10
url https://arxiv.org/abs/2507.22704