Related papers: Global dynamics of the real secant method
We investigate the plane dynamical system given by the secant map applied to a polynomial $p$ having at least one multiple root of multiplicity $d>1$. We prove that the local dynamics around the fixed points associated to the roots of $p$…
We study the discrete dynamical system defined on a subset of $R^2$ given by the iterates of the secant method applied to a real polynomial $p$. Each simple real root $\alpha$ of $p$ has associated its basin of attraction $\mathcal…
We consider the secant method $S_p$ applied to a real polynomial $p$ of degree $d+1$ as a discrete dynamical system on $\mathbb R^2$. If the polynomial $p$ has a local extremum at a point $\alpha$ then the discrete dynamical system…
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…
The secant method is a very effective numerical procedure used for solving nonlinear equations of the form $f(x)=0$. In a recent work [A. Sidi, Generalization of the secant method for nonlinear equations. {\em Appl. Math. E-Notes},…
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…
We present an algorithm for isolating the roots of an arbitrary complex polynomial $p$ that also works for polynomials with multiple roots provided that the number $k$ of distinct roots is given as part of the input. It outputs $k$ pairwise…
We present a construction of a B\"ottcher-type holomorphic map for the potential of the secant method dynamical system near a root-type fixed point. The modulus of the B\"ottcher-type map extends to be continuous on the entire basin of…
This study explores the complex dynamics of the rational function associated with the Modified Chebyshev's root-finding method. After introducing the basic preliminaries of discrete dynamical systems, we analyze the dynamical behavior of…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
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…
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We improve the local generic position method for isolating the real roots of a zero-dimensional bivariate polynomial system with two polynomials and extend the method to general zero-dimensional polynomial systems. The method mainly…
In this paper, based on the homotopy continuation method and the interval Newton method, an efficient algorithm is introduced to isolate the real roots of semi-algebraic system. Tests on some random examples and a variety of problems…
In this paper, we study the dynamics of Newton maps for arbitrary polynomials. Let $p$ be an arbitrary polynomial with at least three distinct roots, and $f$ be its Newton map. It is shown that the boundary $\partial B$ of any immediate…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
We study the dynamics in C^2 of superattracting fixed point germs and of polynomial maps near infinity. In both cases we show that the asymptotic attraction rate is a quadratic integer, and construct a plurisubharmonic function with the…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…