Boundedness and simple connectivity of the basins of attraction for some numerical methods
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≥ 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
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.