On the basins of attraction of a one-dimensional family of root finding algorithms: from Newton to Traub

DOI10.1007/S00209-023-03215-8MaRDI QIDQ2683809zbMATH OpenOpenAlexFDO

Authors Jordi Canela, V. Evdoridou, Antonio Garijo, Xavier Jarque

Publication date 15 February 2023

Published in Mathematische Zeitschrift (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00209-023-03215-8

zbMATH Keywords

basins of attractionholomorphic dynamicsJulia and Fatou setsroot finding algorithms

Mathematics Subject Classification ID

Functional equations in the complex plane, iteration and composition of analytic functions of one complex variable (30D05) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10)

Recommendations

• Higher-order root-finding algorithms and their basins of attraction
• Basins of attraction for family of Popovski’s methods and their extension to multiple roots
• Basins of attraction for several methods to find simple roots of nonlinear equations
• Influence of the multiplicity of the roots on the basins of attraction of Newton's method
• Dynamics of Newton-like root finding methods
• Contrasts in the basins of attraction of structurally identical iterative root finding methods
• Basin attractors for various methods for multiple roots
• Optimal methods for finding simple and multiple roots of nonlinear equations and their basins of attraction
• Basin attractors for derivative-free methods to find simple roots of nonlinear equations

Cites work

• Complex dynamics
• Connectivity of the Julia set for the Chebyshev-Halley family on degree n polynomials
• Damped Traub's method: convergence and stability
• Dynamical analysis on cubic polynomials of damped Traub's method for approximating multiple roots
• Dynamics in One Complex Variable. (AM-160)
• Dynamics of a family of Chebyshev-Halley type methods
• Families of rational maps and iterative root-finding algorithms
• How to find all roots of complex polynomials by Newton's method.
• scientific article; zbMATH DE number 4153532 (Why is no real title available?)
• scientific article; zbMATH DE number 51680 (Why is no real title available?)
• scientific article; zbMATH DE number 739001 (Why is no real title available?)
• scientific article; zbMATH DE number 1139518 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• On local connectivity for the Julia set of rational maps: Newton's famous example
• On the connectivity of the Julia sets of meromorphic functions
• On the efficiency of algorithms of analysis
• Quasiconformal homeomorphisms and dynamics. I: Solution of the Fatou- Julia problem on wandering domains
• Singular perturbations of Blaschke products and connectivity of Fatou components
• The connectivity of the Julia set and fixed points
• The escape trichotomy for singularly perturbed rational maps

Cited in

(5)

• Dynamical analysis on cubic polynomials of damped Traub's method for approximating multiple roots
• Damped Traub's method: convergence and stability
• Influence of the multiplicity of the roots on the basins of attraction of Newton's method
• Dynamics of Newton-like root finding methods
• Computing parameter planes of iterative root-finding methods with several free critical points

This page was built for publication: On the basins of attraction of a one-dimensional family of root finding algorithms: from Newton to Traub

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2683809)