2000 character limit reached
Boundedness and simple connectivity of the basins of attraction for some numerical methods
Published 30 Jul 2025 in math.DS | (2507.22704v1)
Abstract: 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
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.