Related papers: Chebyshev's method applied to polynomials with two…
We study the Chebyshev-Halley family of root finding algorithms from the point of view of holomorphic dynamics. Numerical experiments show that the speed of convergence to the roots may be slower when the basins of attraction are not simply…
Given a polynomial $p$, the degree of its Chebyshev's method $C_p$ is determined. If $p$ is cubic then the degree of $C_p$ is found to be $4,6$ or $7$ and we investigate the dynamics of $C_p$ in these cases. If a cubic polynomial $p$ is…
We study the Cebyshev-Halley methods applied to the family of polynomials $f_{n,c}(z)=z^n+c$, for $n\ge 2$ and $c\in \mathbb{C}^{*}$. We prove the existence of parameters such that the immediate basins of attraction corresponding to the…
Let $p$ be a normalized (monic and centered) quartic polynomial with non-trivial symmetry groups. It is already known that if $p$ is unicritical, with only two distinct roots with the same multiplicity or having a root at the origin then…
In this article, we study the global dynamics of Halley's method applied to complex polynomials. Specifically, we analyze the structure and connectivity of the Julia set of this method. The convergence behavior, symmetry properties, and…
It is proved that the Chebyshev's method applied to an entire function $f$ is a rational map if and only if $f(z) = p(z) e^{q(z)}$, for some polynomials $p$ and $q$. These are referred to as rational Chebyshev maps, and their fixed points…
Iterative methods for the simultaneous determination of all roots of an equation are dis-cussed. The multiplicities of the roots are assumed to be known in advance. The methods are proved to have a cubical rate of convergence. Numerical…
Let $f:z\mapsto z^2+c$ be a quadratic polynomial whose Julia set $J$ is locally-connected of the set of biaccessible points in $J$ is zero except when $f(z)=z^2-2$ is the Chebyshev quadratic polynomial for which the corresponding measure is…
The set of all holomorphic Euclidean isometries preserving the Julia set of a rational map $R$ is denoted by $\Sigma R$. It is shown in this article that if a root-finding method $F$ satisfies the Scaling theorem, i.e., for a polynomial…
Let $(f_n)_{n=1}^\infty$ be a sequence of nonlinear polynomials satisfying some mild conditions. Furthermore, let $F_m(z)=(f_m\circ f_{m-1}\ldots \circ f_1)(z)$ and $\rho_m$ be the leading coefficient for $F_m$. It is shown that on the…
In this paper we give a unified proof of the fact that the Julia set of Newton's method applied to a holomorphic function of the complex plane (a polynomial of degree large than $1$ or an entire transcendental function) is connected. The…
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…
There is presented an approach to find an approximation polynomial of a function with two variables based on the two dimensional discrete Fourier transform. The approximation polynomial is expressed through Chebyshev polynomials. There is…
New modifications of the methods for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system are elaborated. A cubic convergence of iterations is proved. The method presented is a generalisation of the…
The discriminants of certain polynomials related to Chebyshev polynomials factor into the product of two polynomials, one of which has coefficients that are much larger than the other's. Remarkably, these polynomials of dissimilar size have…
For a rational function $R$, let $N_R(z)=z-\frac{R(z)}{R'(z)}.$ Any such $N_R$ is referred to as a Newton map. We determine all the rational functions $R$ for which $N_R$ has exactly two attracting fixed points, one of which is an…
The Householder's method is a root-find algorithm which is a natural extension of the methods of Newton and Halley. The current paper mostly focuses on approximating the square root of a positive real number based on these methods. The…
Any Jordan curve in the complex plane can be approximated arbitrarily well in the Hausdorff topology by Julia sets of polynomials. Finite collections of disjoint Jordan domains can be approximated by the basins of attraction of rational…
The dynamical structure of Chebyshev polynomials on $\mathbb{Z}_2$, the ring of $2$-adic integers, is fully described by showing all its minimal subsystems and their attracting basins.
The Chebyshev polynomials are utilized in this study to define the subclass of the bi-univalent function. Also, Chebyshev polynomial bounds and Fekete-Szego inequalities for functions defined in the classes are established.