相关论文: Relaxed Newton's Method as a Family of Root-findin…

We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…

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…

Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…

In this paper we study the dynamics of damped Traub's methods $T_\delta$ when applied to polynomials. The family of damped Traub's methods consists of root finding algorithms which contain both Newton's ($\delta=0$) and Traub's method…

In this paper, we revisit the chaotic number of iterations needed by Newton's method to converge to a root. Here, we consider a simple modified Newton method depending on a parameter. It is demonstrated using polynomiography that even in…

The dynamical classification of rational maps is a central concern of holomorphic dynamics. Much progress has been made, especially on the classification of polynomials and some approachable one-parameter families of rational maps; the goal…

When exploring the literature, it can be observed that the operator obtained when applying \textit{Newton-like} root finding algorithms to the quadratic polynomials $z^2-c$ has the same form regardless of which algorithm has been used. In…

We investigate i.i.d. random complex dynamical systems generated by probability measures on finite unions of the loci of holomorphic families of rational maps on the Riemann sphere. We show that under certain conditions on the families, for…

We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…

We propose a relax-and-round approach combined with a greedy search strategy for performing complex lattice basis reduction. Taking an optimization perspective, we introduce a relaxed version of the problem that, while still nonconvex, has…

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…

A new variant of Newton's method - named Backtracking New Q-Newton's method (BNQN) - which has strong theoretical guarantee, is easy to implement, and has good experimental performance, was recently introduced by the third author.…

We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…

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…

An intriguing and unexpected result for students learning numerical analysis is that Newton's method, applied to the simple polynomial z^3 - 1 = 0 in the complex plane, leads to intricately interwoven basins of attraction of the roots. As…

Newton's method is used to approximate roots of complex valued functions f by creating a sequence of points that converges to a root of f in the usual topology. For any field K equipped with a set of pairwise inequivalent absolute values…

We present an iterative root finding method for harmonic mappings in the complex plane, which is a generalization of Newton's method for analytic functions. The complex formulation of the method allows an analysis in a complex variables…

We study the dynamics of four families of methods obtained with a weight function from a convex combination of Newton's method and a Newton-Halley type method on polynomials with two roots. We find the analytical expressions for the fixed…

Special exotic class of dynamical systems~ -- the implicit maps~ -- is considered. Such maps, particularly, can appear as a result of using of implicit and semi-implicit iterative numerical methods. In the present work we propose the…

A new variant of Newton's method - named Backtracking New Q-Newton's method (BNQN) - which has strong theoretical guarantee, is easy to implement, and has good experimental performance, was recently introduced by the third author.…