SearcharxivSearch

arXiv subjects

Soumen Pal

Publications and source records attributed to Soumen Pal.

9 recordsLinked to original sources

Relaxed Newton's Method as a Family of Root-finding Methods: Dynamics and Convergence

Relaxed Newton's method is a one-parameter family of root-finding methods that generalizes the classical Newton's method. When viewed as a rational map on the Riemann sphere, this family exhibits rich and subtle global dynamics that depend both on the underlying polynomial and on the relaxation parameter. In this paper, we investigate the complex dynamical behavior of relaxed Newton maps associated with complex polynomials. We first characterize rational maps that arise as relaxed Newton maps in terms of the multipliers of their fixed points. Our main results identify several explicit classes of polynomials for which relaxed Newton's method is \textit{convergent} for all parameters $h$, in the sense that the Fatou set consists precisely of the basins of attraction of the roots. We further show that this favorable behavior does not hold in general: for any fixed relaxation parameter $h\in \{z:|z-1|<1\}$, there exists a generic cubic polynomial for which the relaxed Newton map fails to be convergent. Additional results include a complete characterization of when the Julia set is a straight line, an analysis of symmetry groups arising from rotational invariance, and sufficient conditions ensuring that all immediate basins of attraction are unbounded.

math.DS

On the dynamics of Halley's method

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 topological features of the corresponding Fatou and Julia sets are studied for various classes of polynomials, including unicritical, cubic, and quartic polynomials with non-trivial symmetry groups. In particular, we prove that the Halley's method $H_p$ is convergent, its Julia set is connected, the immediate basins are unbounded and the symmetry group of it coincides with that of the polynomial whenever $p$ belongs to one of the above classes. We further extend our results to a broader class of polynomials. It is shown that the immediate basin of the Halley's method $H_p$ corresponding to a root of $p$ can be bounded. We also make some remarks on the dynamics of the Halley's method applied to a cubic polynomial in general.

math.DS

Newton's method applied to rational functions: Fixed points and Julia sets

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 exceptional point. Further, if all the repelling fixed points of any such Newton map are with multiplier $2$, or the multiplier of the non-exceptional attracting fixed point is at most $\frac{4}{5}$, then its Julia set is shown to be connected. If a polynomial $p$ has exactly two roots, is unicritical but not a monomial, or $p(z)=z(z^n+a)$ for some $a \in \mathbb{C}$ and $n \geq 1$, then we have proved that the Julia set of $N_{\frac{1}{p}}$ is totally disconnected. For the McMullen map $f_{\lambda}(z)=z^m - \frac{\lambda}{z^n}$, $\lambda \in \mathbb{C}\setminus \{0\}$ and $m,n \geq 1$, we have proved that the Julia set of $N_{f_\lambda}$ is connected and is invariant under rotations about the origin of order $m+n$. All the connected Julia sets mentioned above are found to be locally connected.

math.DS

Chebyshev's method for exponential maps

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 are discussed in this article. It is seen that $\infty$ is a parabolic fixed point with multiplicity one bigger than the degree of $q$. Considering $q(z)=p(z)^n+c$, where $p$ is a linear polynomial, $n \in \mathbb{N}$ and $c$ is a non-zero constant, we show that the Chebyshev's method applied to $ pe^q$ is affine conjugate to that applied to $z e^{z^n}$. We denote this by $C_n$. All the finite extraneous fixed points of $C_n$ are shown to be repelling. The Julia set $\mathcal{J}(C_n)$ of $C_n$ is found to be preserved under rotations of order $n$ about the origin. For each $n$, the immediate basin of $0$ is proved to be simply connected. For all $n \leq 16$, we prove that $\mathcal{J}(C_n)$ is connected. For $n$ even, the non-existence of Herman ring and Siegel disk of $C_n$ is proved. Under some additional hypothesis, the same is also proved for odd $n$. The Newton's method applied to $ze^{z^n}$ is found to be conjugate to a polynomial, and its dynamics is also completely determined.

math.DS

Julia sets of rational maps with rotational symmetries

By a symmetry of the Julia set of a polynomial, also referred as polynomial Julia set, we mean an Euclidean isometry preserving the Julia set. Each such symmetry is in fact a rotation about the centroid of the polynomial. In this article, a survey of the symmetries of polynomial Julia sets is made. Then the Euclidean isometries preserving the Julia set of rational maps are considered. A rotation preserving the Julia set of a rational map is called a rotational symmetry of its Julia set. A sufficient condition is provided for a rational map to have rotational symmetries whenever the rational map has an exceptional point. Two classes of rational maps are provided whose Julia sets have rotational symmetries of finite orders. Using this, it is proved that $ z\mapsto μz$ where $μ^{m+n}=1$ is a rotational symmetry of the McMullen map $ z^m+\fracλ{z^n}$ for all $m,n$ with $m\geq 2$ and $λ\in \mathbb{C}\setminus \{0\}$. Assuming that a normalized polynomial has a simple root at the origin, it is shown that the groups of the rotational symmetries of the polynmial coincide with that of its Newton's method and Chebyshev's method.

math.DS

On dynamics of the Chebyshev's method for quartic polynomials

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 the Julia set of its Chebyshev's method $C_p$ is connected and symmetry groups of $p$ and $C_p$ coincide~[Nayak, T., and Pal, S., Symmetry and dynamics of Chebyshev's method, \cite{Sym-and-dyn}]. Every other quartic polynomial is shown to be of the form $p_a (z)=(z^2 -1)(z^2-a)$ where $a \in \mathbb{C}\setminus \{-1,0,1\}$. Some dynamical aspects of the Chebyshev's method $C_a$ of $p_a$ are investigated in this article for all real $a$. It is proved that all the extraneous fixed points of $C _a$ are repelling which gives that there is no invariant Siegel disk for $C_a$. It is also shown that there is no Herman ring in the Fatou set of $C_a$. For positive $a$, it is proved that at least two immediate basins of $C_a$ corresponding to the roots of $p_a$ are unbounded and simply connected. For negative $a$, it is however proved that all the four immediate basins of $C_a$ corresponding to the roots of $p_a$ are unbounded and those corresponding to $\pm i\sqrt{|a|}$ are simply connected.

math.DS

Symmetry and dynamics of Chebyshev's method

The set of all holomorphic Euclidean isometries preserving the Julia set of a rational map $R$ is denoted by $ΣR$. It is shown in this article that if a root-finding method $F$ satisfies the Scaling theorem, i.e., for a polynomial $p$, $F_p$ is affine conjugate to $F_{λp \circ T}$ for every nonzero complex number $λ$ and every affine map $T$, then for a centered polynomial $p$ of order at least two (which is not a monomial), $Σp\subseteq ΣF_p$. As the Chebyshev's method satisfies the Scaling theorem, we have $Σp \subseteq Σ{C_p}$, where $p$ is a centered polynomial. The rest part of this article is devoted to explore the situations where the equality holds and in the process, the dynamics of $C_p$ is found. We show that the Julia set $\mathcal{J}(C_p)$ of $ C_p$ can never be a line. If a centered polynomial $p$ is (a) unicritical, (b) having exactly two roots with the same multiplicity, (c) cubic and $Σp$ is non-trivial or (d) quartic, $0$ is a root of $p$ and $Σp $ is non-trivial then it is proved that $Σp = ΣC_p$. It is found in all these cases that the Fatou set $\mathcal{F}(C_p)$ is the union of all the attracting basins of $C_p$ corresponding to the roots of $p$ and $\mathcal{J}(C_p)$ is connected. It is observed that $\mathcal{J}(C_p)$ is locally connected in all these cases.

math.DS

The Julia sets of Chebyshev's method with small degrees

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 unicritical or non-generic then, it is proved that the Julia set of $C_p$ is connected. The family of all rational maps arising as the Chebyshev's method applied to a cubic polynomial which is non-unicritical and generic is parametrized by the multiplier of one of its extraneous fixed points. Denoting a member of this family with an extraneous fixed point with multiplier $λ$ by $C_λ$, we have shown that the Julia set of $C_λ$ is connected whenever $λ\in [-1,1]$.

math.DS

Quadratic and cubic Newton maps of rational functions

The dynamics of all quadratic Newton maps of rational functions are completely described. The Julia set of such a map is found to be either a Jordan curve or totally disconnected. It is proved that no Newton map with degree at least three of any rational function is conformally conjugate to a unicritical polynomial(i.e., with exactly one finite critical point). However, there are cubic Newton maps which are conformally conjugate to other polynomials. The Julia set of such a Newton map is shown to be a closed curve. It is a Jordan curve whenever the Newton map has two attracting fixed points.

math.CV