Related papers: Annealing approach to root-finding
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.…
Some fractional Newton methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper we introduce a fractional Newton method with order $\alpha+1$ and compare with another fractional…
The aim of this paper is to introduce a new Newton-type iterative method and then to show that this process converges to the unique solution of the scalar nonlinear equation f(x)=0 under weaker conditions involving only f and f' by fixed…
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…
An algorithm based on the Ehrlich-Aberth root-finding method is presented for the computation of the eigenvalues of a T-palindromic matrix polynomial. A structured linearization of the polynomial represented in the Dickson basis is…
Root-finding method is an iterative process that constructs a sequence converging to a solution of an equation. Householder's method is a higher-order method that requires higher order derivatives of the reciprocal of a function and has…
We consider the problem of numerically identifying roots of a target function - under the constraint that we can only measure the derivatives of the function at a given point, not the function itself. We describe and characterize two…
The initialization of equation-based differential-algebraic system models, and more in general the solution of many engineering and scientific problems, require the solution of systems of nonlinear equations. Newton-Raphson's method is…
This article generalizes a recently introduced procedure to solve nonlinear systems of equations, radically departing from the conventional Newton-Raphson scheme. The original nonlinear system is first unfolded into three simpler…
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…
In this work we present and discuss a possible globalization concept for Newton-type methods. We consider nonlinear problems $f(x)=0$ in $\mathbb{R}^{n}$ using the concepts from ordinary differential equations as a basis for the proposed…
We propose an approach to constructing iterative methods for finding polynomial roots simultaneously. One feature of this approach is using the fundamental theorem of symmetric polynomials. Within this framework, we reconstruct many of the…
This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…
In this article, we present an iterative method to find simple roots of nonlinear equations, that is, to solving an equation of the form $f(x) = 0$. Different from Newton's method, the method we purpose do not require evaluation of…
In this work, we propose an optimization algorithm which we call norm-adapted gradient descent. This algorithm is similar to other gradient-based optimization algorithms like Adam or Adagrad in that it adapts the learning rate of stochastic…
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…
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…
An implementation and an application of the combination of the genetic algorithm and Newton's method for solving a system of nonlinear equations is presented. The method first uses the advantage of the robustness of the genetic algorithm…
In this paper we numerically explore the convergence properties of the pseudo-Newtonian circular restricted problem of three and four primary bodies. The classical Newton-Raphson iterative scheme is used for revealing the basins of…
An iterative formula based on Newton Method alone is presented for the iterative solutions of equations that ensures convergence in cases where the traditional Newton Method may fail to converge to the desired root. In addition, the method…