Related papers: Optimal Newton-Secant like methods without memory …
We introduce a new class of optimal iterative methods without memory for approximating a simple root of a given nonlinear equation. The proposed class uses four function evaluations and one first derivative evaluation per iteration and it…
In this paper, we present a three-point without memory iterative method based on Kung and Traub's method for solving non-linear equations in one variable. The proposed method has eighth-order convergence and costs only four function…
We present a three-point iterative method without memory for solving nonlinear equations in one variable. The proposed method provides convergence order eight with four function evaluations per iteration. Hence, it possesses a very high…
In this paper, we present an iterative three-point method with memory based on the family of King's methods to solve nonlinear equations. This proposed method has eighth order convergence and costs only four function evaluations per…
The prime objective of this paper is to design a new family of eighth-order iterative methods by accelerating the order of convergence and efficiency index of well existing seventh-order iterative method of \cite{Soleymani1} without using…
We established a new eighth-order iterative method, consisting of three steps, for solving nonlinear equations. Per iteration the method requires four evaluations (three function evaluations and one evaluation of the first derivative).…
In this note, we present an eighth-order derivative-free family of iterative methods for nonlinear equations. The proposed family shows optimal eight-order of convergence in the sense of the Kung and Traub conjecture \cite{5} and is based…
In this paper we established a class of optimal fourth-order methods which is obtained by existing third-order method for solving nonlinear equations for simple roots by using weight functions. Some physical examples are given to illustrate…
This article concerned with the issue of solving a nonlinear equation with the help of iterative method where no any derivative evaluation is required per iteration. Therefore, this work contributes to a new class of optimal eighth-order…
The object of the present paper is to extend the third-order iterative method for solving nonlinear equations into systems of nonlinear equations. Since our motive is to develop the method which improve the order of convergence of Newton's…
The object of the present work is to present the new classes of third-order and fourth-order iterative methods for solving nonlinear equations. Our third-order method includes methods of Weerakoon \cite{Weerakoon}, Homeier \cite{Homeier2},…
We present a simple yet powerful and applicable quadrature based scheme for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve…
The secant method, as an important approach for solving nonlinear equations, is introduced in nearly all numerical analysis textbooks. However, most textbooks only briefly address the Q-order of convergence of this method, with few…
A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…
The iterative problem of solving nonlinear equations is studied. A new Newton like iterative method with adjustable parameters is designed based on the dynamic system theory. In order to avoid the derivative function in the iterative…
A zero-finding technique for solving nonlinear equations more efficiently than they usually are with traditional iterative methods in which the order of convergence is improved is presented. The key idea in deriving this procedure is to…
We present a derivative-based algorithm for nonlinearly constrained optimization problems that is tolerant of inaccuracies in the data. The algorithm solves a semi-smooth set of nonlinear equations that are equivalent to the first-order…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…
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…
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…