Most of the nonlinear equation solvers do not converge always or they use the derivatives of the function to approximate the root of such equations. Here, we give a derivative-free algorithm that guarantees the convergence. The proposed two-step method, which is to some extent like the secant method, is accompanied with some numerical examples. The illustrative instances manifest that the rate ...

In this paper we consider the Newton–iterative method for solving weakly nonlinear finite difference systems of the form F (u) = Au + G(u) = 0, where the jacobian matrix G(u) satisfies an affine invariant Lipschitz condition. We also consider a modification of the method for which we can improve the likelihood of convergence from initial approximations that may be outside the attraction ball of...

In this paper, we develop new families of sixth-order methods for solving simple zeros of non-linear equations. These methods are constructed such that the convergence is of order six. Each member of the families requires two evaluations of the given function and two of its derivative per iteration. These methods have more advantages than Newton’s method and other methods with the same converge...

A new predictor-corrector iterative procedure, that combines Newton’s method as predictor scheme and a fifth-order iterative method as a corrector, is designed for solving nonlinear equations in Banach spaces. We analyze the local order of convergence and the regions of accessibility of the new method comparing it with Newton’s method, both theoretical and numerically.

We introduce a uniformly convergent iterative method for the systems arising from non-symmetric IIPG linear approximations of second order elliptic problems. The method can be viewed as a block Gauß–Seidel method in which the blocks correspond to restrictions of the IIPG method to suitably constructed subspaces. Numerical tests are included, showing the uniform convergence of the iterative meth...

A homotopy method is presented for the construction of frozen Jacobian iterative methods. The frozen Jacobian iterative methods are attractive because the inversion of the Jacobian is performed in terms of LUfactorization only once, for a single instance of the iterative method. We embedded parameters in the iterative methods with the help of the homotopy method: the values of the parameters ar...

The Cayley transform method is a Newton-like method for solving inverse eigenvalue problems. If the problem is large, one can solve the Jacobian equation by iterative methods. However, iterative methods usually oversolve the problem in the sense that they require far more (inner) iterations than is required for the convergence of the Newton (outer) iterations. In this paper, we develop an inexa...

In this paper. We introduce a general iterative method for the family of mappings and prove the strong convergence of the new iterative scheme in Banach space. The new iterative method includes the iterative scheme of Khan and Domlo and Fukhar-ud-din [Common fixed points Noor iteration for a finite family of asymptotically quasinonexpansive mappings in Banach spaces. J. Math. Anal. Appl. 341 (2...

This paper recalls the proximal point method. We study two iterative algorithms: the Blahut-Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with probability density estimates and the iterative decoding of the Bit Interleaved Coded Modulation (BICM-ID). For these iterative algorithms, we apply the proximal po...

In this paper, we introduce a new iterative scheme to approximate a common fixed point for a finite family of nonexpansive non-self mappings. Strong convergence theorems of the proposed iteration in Banach spaces.