Related papers: Backtracking New Q-Newton's method, Schr\"oder's t…

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

We present an approach (the biroot method) for nth root approximation that yields closed-form rational functions with coefficients derived from binomial structures, Gaussian functions, or qualifying DAG structures. The method emerges from…

Newton's method is an ubiquitous tool to solve equations, both in the archimedean and non-archimedean settings -- for which it does not really differ. Broyden was the instigator of what is called "quasi-Newton methods". These methods use an…

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…

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 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…

We conjecture that the roots of a degree-n univariate complex polynomial are located in a union of n-1 annuli, each of which is centered at a root of the derivative and whose radii depend on higher derivatives. We prove the conjecture for…

We propose a new class of method for solving nonlinear systems of equations, which, among other things,has four nice features: (i) it is inspired by the mathematical property of damped oscillators, (ii) it can be regarded as a simple…

This work is a continuation of "Fast and backward stable computation of roots of polynomials" by J.L. Aurentz, T. Mach, R. Vandebril, and D.S. Watkins, SIAM Journal on Matrix Analysis and Applications, 36(3): 942--973, 2015. In that paper…

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…

The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In…

Newton's root finding method applied to a (transcendental) entire function f:C->C is the iteration of a meromorphic function N. It is well known that if for some starting value z, Newton's method converges to a point x in C, then f has a…

We investigate two well known dynamical systems that are designed to find roots of univariate polynomials by iteration: the methods known by Newton and by Ehrlich-Aberth. Both are known to have found all roots of high degree polynomials…

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…

It is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a…

Newton method is one of the most powerful methods for finding solutions of nonlinear equations and for proving their existence. In its "pure" form it has fast convergence near the solution, but small convergence domain. On the other hand…

Let $f(z,w)=(p(z),q(z,w))$ be a polynomial skew product such that the degrees of $p$ and $q$ are grater than or equal to $2$. Under one or two conditions, we prove that $f$ is conjugate to a monomial map on an invariant region near…

We describe in this note a new invariant of rooted trees. We argue that the invariant is interesting on it own, and that it has connections to knot theory and homological algebra. However, the real reason that we propose this invariant to…

We present a modification of Newton's method to restore quadratic convergence for isolated singular solutions of polynomial systems. Our method is symbolic-numeric: we produce a new polynomial system which has the original multiple solution…

The study of Newton's method in complex-valued neural networks faces many difficulties. In this paper, we derive Newton's method backpropagation algorithms for complex-valued holomorphic multilayer perceptrons, and investigate the…