On K nig's root-finding algorithms*
From MaRDI portal
Publication:4430687
DOI10.1088/0951-7715/16/3/312zbMath1030.37030OpenAlexW1979001819MaRDI QIDQ4430687
Christian Henriksen, Xavier Buff
Publication date: 12 October 2003
Published in: Nonlinearity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0951-7715/16/3/312
Small divisors, rotation domains and linearization in holomorphic dynamics (37F50) Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets (37F10)
Related Items (34)
A construction of attracting periodic orbits for some classical third-order iterative methods ⋮ On general convergence in extracting radicals via a fundamental family of iteration functions ⋮ The Weierstrass–Durand–Kerner root finder is not generally convergent ⋮ Dynamic study of Schröder's families of first and second kind ⋮ Unnamed Item ⋮ On Schröder's families of root-finding methods ⋮ Quadratic and cubic Newton maps of rational functions ⋮ Geometric limits of mixed families ⋮ Dynamics and limiting behavior of Julia sets of König's method for multiple roots ⋮ The Julia sets of Chebyshev's method with small degrees ⋮ Regions of convergence and dynamics of Schröder-like iteration formulae as applied to complex polynomial equations with multiple roots ⋮ Prescribed cycles of König's method for polynomials ⋮ Dynamical aspects of some convex acceleration methods as purely iterative algorithm for Newton's maps ⋮ The link on extraneous non-repelling cycles of Schröder's methods of the first and second kind ⋮ Dynamics of a higher-order family of iterative methods ⋮ Iteration functions for \(p\)th roots of complex numbers ⋮ The Padé iterations for the matrix sign function and their reciprocals are optimal ⋮ A generalization of Müller's iteration method based on standard information ⋮ Symmetries of the Julia sets of König's methods for polynomials ⋮ On iterative algorithms for the polar decomposition of a matrix and the matrix sign function ⋮ Dynamics of a fifth-order iterative method ⋮ A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity ⋮ Traub's accelerating generator of iterative root-finding methods ⋮ Note on a cubically convergent Newton-type method under weak conditions ⋮ Symmetric functions and root-finding algorithms ⋮ On the dynamics of a family of third-order iterative functions ⋮ Accelerating generators of iterative methods for finding multiple roots of nonlinear equations ⋮ Mean value conjectures for rational maps ⋮ Dynamics of the Newton maps of rational functions ⋮ On the dynamics of some Newton's type iterative functions ⋮ Estimating convergence regions of Schröder's iteration formula: how the Julia set shrinks to the Voronoi boundary ⋮ On the Julia set of König’s root–finding algorithms ⋮ An iteration method with maximal order based on standard information ⋮ Disconnected Julia set of Halley's method for exponential maps
This page was built for publication: On K nig's root-finding algorithms*
