On novel classes of iterative methods for solving nonlinear equations

In this paper, we establish two new classes of derivative-involved methods for solving single valued nonlinear equations of the form f(x) = 0. The first contributed two-step class includes two evaluations of the function and one of its first derivative where its error analysis shows a fourth-order convergence. Next, we construct a three-step high-order class of methods including four evaluations per full cycle to achieve the seventh-order of convergence. Numerical examples are included to re-verify the theoretical results and moreover put on show the efficiency of the new methods from our classes.     

Alternating iterative methods for solving tensor equations with applications

Numerical Algorithms - Recently, the alternating direction method of multipliers (ADMM) and its variations have gained great popularity in large-scale optimization problems. This paper is concerned...     

On derivative free cubic convergence iterative methods for solving nonlinear equations

Finding the zeros of a nonlinear equation is a classical problem of numerical analysis which has various applications in many sciences and engineering. In this problem we seek methods that lead to approximate solutions. Sometimes the applications of the iterative methods depended on derivatives are restricted in Physics, chemistry and engineering. In this paper, we propose two iterative formulas without derivatives. These methods are based on the central-difference and forward-difference approximations to derivatives. The convergence analysis shows that the methods are cubically and quadratically convergent respectively. The best property of these schemes are that they are derivative free. Several numerical examples are given to illustrate the efficiency and performance of the proposed methods.     

On some families of multi-point iterative methods for solving nonlinear equations

Some semi-discrete analogous of well known one-point family of iterative methods for solving nonlinear scalar equations dependent on an arbitrary constant are proposed. The new families give multi-point iterative processes with the same or higher order of convergence. The convergence analysis and numerical examples are presented.     

New eighth-order iterative methods for solving nonlinear equations

In this paper, three new families of eighth-order iterative methods for solving simple roots of nonlinear equations are developed by using weight function methods. Per iteration these iterative methods require three evaluations of the function and one evaluation of the first derivative. This implies that the efficiency index of the developed methods is 1.682, which is optimal according to Kung and Traub’s conjecture [7] for four function evaluations per iteration. Notice that Bi et al.’s method in [2] and [3] are special cases of the developed families of methods. In this study, several new examples of eighth-order methods with efficiency index 1.682 are provided after the development of each family of methods. Numerical comparisons are made with several other existing methods to show the performance of the presented methods.     

Various Newton-type iterative methods for solving nonlinear equations

The aim of the present paper is to introduce and investigate new ninth and seventh order convergent Newton-type iterative methods for solving nonlinear equations. The ninth order convergent Newton-type iterative method is made derivative free to obtain seventh-order convergent Newton-type iterative method. These new with and without derivative methods have efficiency indices 1.5518 and 1.6266, respectively. The error equations are used to establish the order of convergence of these proposed iterative methods. Finally, various numerical comparisons are implemented by MATLAB to demonstrate the performance of the developed methods.     

Three-step iterative methods with eighth-order convergence for solving nonlinear equations

A family of eighth-order iterative methods for the solution of nonlinear equations is presented. The new family of eighth-order methods is based on King’s fourth-order methods and the family of sixth-order iteration methods developed by Chun et al. Per iteration the new methods require three evaluations of the function and one evaluation of its first derivative. Therefore this family of methods has the efficiency index which equals 1.682. Kung and Traub conjectured that a multipoint iteration without memory based on n$n$ evaluations could achieve optimal convergence order 2ⁿ⁻¹$2^{n-1}$. Thus we provide a new example which agrees with the conjecture of Kung–Traub for n=4$n=4$. Numerical comparisons are made to show the performance of the presented methods.     

On some efficient derivative-free iterative methods with memory for solving systems of nonlinear equations

We present derivative free methods with memory with increasing order of convergence for solving systems of nonlinear equations. These methods relied on the basic family of fourth order methods without memory proposed by Sharma et al. (Appl. Math. Comput. 235, 383–393, 2014). The order of convergence of new family is increased from 4 of the basic family to \(2+\sqrt {5} \approx 4.24\) by suitable variation of a free self-corrected parameter in each iterative step. In a particular case of the family even higher order of convergence \(2+\sqrt {6} \approx 4.45\) is achieved. It is shown that the new methods are more efficient in general. The presented numerical tests confirm the theoretical results.     

A class of iterative methods for solving nonlinear projection equations

A class of globally convergent iterative methods for solving nonlinear projection equations is provided under a continuity condition of the mappingF. WhenF is pseudomonotone, a necessary and sufficient condition on the nonemptiness of the solution set is obtained.The author would like to thank two referees for their useful comments on this paper and one of them, in particular, for bringing Ref. 15 to his attention. The author also thanks Professor He for sending him Ref. 23.     

Modified families of multi-point iterative methods for solving nonlinear equations

We further present some semi-discrete modifications to the cubically convergent iterative methods derived by Kanwar and Tomar (Modified families of Newton, Halley and Chebyshev methods, Appl. Math. Comput. http://dx.doi.org/10.1016/j.amc.2007.02.119) and derived a number of interesting new classes of third-order multi-point iterative methods free from second derivatives. Furthermore, several functions have been tested and all the methods considered are found to be effective and compared to the well-known existing third and fourth-order multi-point iterative methods.      

On an iterative method for solving absolute value equations

We suggest an iterative method for solving absolute value equation Ax ? |x| = b, where \({A\in R^{n\times n}}\) is symmetric matrix and \({b\in R^{n}}\), coupled with the minimization technique. We also discuss the convergence of the proposed method. Some examples are given to illustrate the implementation and efficiency of the method.     

A new family of eighth-order iterative methods for solving nonlinear equations

A family of eighth-order iterative methods with four evaluations for the solution of nonlinear equations is presented. Kung and Traub conjectured that an iteration method without memory based on n evaluations could achieve optimal convergence order 2^n-1. The new family of eighth-order methods agrees with the conjecture of Kung-Traub for the case n=4. Therefore this family of methods has efficiency index equal to 1.682. Numerical comparisons are made with several other existing methods to show the performance of the presented methods.     

On the computational efficiency index and some iterative methods for solving systems of nonlinear equations

In this paper two new iterative methods are built up and analyzed. A generalization of the efficiency index used in the scalar case to several variables in iterative methods for solving systems of nonlinear equations is revisited. Analytic proofs of the local order of convergence based on developments of multilineal functions and numerical concepts that will be used to illustrate the analytic results are given. An approximation of the computational order of convergence is computed independently of the knowledge of the root and the necessary time to get one correct decimal is studied in our examples.     

On the computational efficiency index and some iterative methods for solving systems of nonlinear equations

In this paper two new iterative methods are built up and analyzed. A generalization of the efficiency index used in the scalar case to several variables in iterative methods for solving systems of nonlinear equations is revisited. Analytic proofs of the local order of convergence based on developments of multilineal functions and numerical concepts that will be used to illustrate the analytic results are given. An approximation of the computational order of convergence is computed independently of the knowledge of the root and the necessary time to get one correct decimal is studied in our examples.     

On an iterative algorithm with superquadratic convergence for solving nonlinear operator equations

We study an iterative method with order for solving nonlinear operator equations in Banach spaces. Algorithms for specific operator equations are built up. We present the received new results of the local and semilocal convergence, in case when the first-order divided differences of a nonlinear operator are Hölder continuous. Moreover a quadratic nonlinear majorant for a nonlinear operator, according to the conditions laid upon it, is built. A priori and a posteriori estimations of the method’s error are received. The method needs almost the same number of computations as the classical Secant method, but has a higher order of convergence. We apply our results to the numerical solving of a nonlinear boundary value problem of second-order and to the systems of nonlinear equations of large dimension.