begin{abstract} In this paper, we introduce an iterative method for amenable semigroup of non expansive mappings and infinite family of non expansive mappings in the frame work of Hilbert spaces. We prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. The results present...

In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.

this paper is concerned with a technique for solving volterra integral equations in the reproducing kernel hilbert space. in contrast with the conventional reproducing kernel method, the gram-schmidt process is omitted here and satisfactory results are obtained.the analytical solution is represented in the form of series.an iterative method is given to obtain the approximate solution.the conver...

‎in this paper‎, ‎we propose two preconditioned aor iterative methods to solve systems of linear equations whose coefficient matrices are z-matrix‎. ‎these methods can be considered as improvements of two previously presented ones in the literature‎. ‎finally some numerical experiments are given to show the effectiveness of the proposed preconditioners‎.‎

In this paper, seventh-order iterative methods for the solution ofnonlinear equations are presented. The new iterative methods are developed byusing weight function method and using an approximation for the last derivative,which reduces the required number of functional evaluations per step. Severalexamples are given to illustrate the eciency and the performance of the newiterative methods.

In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.

In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.

‎This paper develops iterative method described by [V‎. ‎Daftardar-Gejji‎, ‎H‎. ‎Jafari‎, ‎An iterative method for solving nonlinear functional equations‎, ‎J‎. ‎Math‎. ‎Anal‎. ‎Appl‎. ‎316 (2006) 753-763] to solve Ito stochastic differential equations‎. ‎The convergence of the method for Ito stochastic differential equations is assessed‎. ‎To verify efficiency of method‎, ‎some examples are ex...