Related papers: Computing parameter planes of iterative root-findi…
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…
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…
In this paper the complex dynamical analysis of the parametric fourth-order Kim's iterative family is made on quadratic polynomials, showing the Matlab codes generated to draw the fractal images necessary to complete the study. The…
A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that…
We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…
We discuss a recursive family of iterative methods for the numerical approximation of roots of nonlinear functions in one variable. These methods are based on Newton-Cotes closed quadrature rules. We prove that when a quadrature rule with…
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…
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 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…
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…
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 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…
The multiplier $\lambda_n$ of a periodic orbit of period $n$ can be viewed as a (multiple-valued) algebraic function on the space of all complex quadratic polynomials $p_c(z)=z^2+c$. We provide a numerical algorithm for computing critical…
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…
In this article, we propose a Newton-based method for solving multiobjective interval optimization problems (MIOPs). We first provide a connection between weakly Pareto optimal points and Pareto critical points in the context of MIOPs.…
Many problems in applied mathematics require root finding algorithms. Unfortunately, root finding methods have limitations. Firstly, regarding the convergence, there is a trade-off between the size of it's domain and it's rate. Secondly the…
Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…
Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.
In this paper, we modify the Newton-Secant method with third order of convergence for finding multiple roots of nonlinear equations. Per iteration this method requires two evaluations of the function and one evaluation of its first…
We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…