in this work, a new iterative method is proposed for obtaining the approximate solution of a class of hammerstein type integral equations system. the main structure of this method is based on the richardson iterative method for solving an algebraic linear system of equations. some conditions for existence and unique solution of this type equations are imposed. convergence analysis and error bou...

the purpose of this paper is to study the strong convergence of an implicit iteration process with errors to a common fixed point for a finite family of asymptotically pseudocontractive mappings and nonexpansive mappings in normed linear spaces. the results in this paper improve and extend the corresponding results of xu and ori, zhou and chang, sun, yang and yu in some aspects.

in this paper, we present a fourth order method for computing simple roots of nonlinear equations by using suitable taylor and weight function approximation. the method is based on weerakoon-fernando method [s. weerakoon, g.i. fernando, a variant of newton's method with third-order convergence, appl. math. lett. 17 (2000) 87-93]. the method is optimal, as it needs three evaluations per ite...

In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...

we prove a strong convergence result for a sequence generated by halpern's type iteration for approximating a common fixed point of a countable family of quasi-lipschitzian mappings in a real hilbert space. consequently, we apply our results to the problem of finding a common fixed point of asymptotically nonexpansive mappings, an equilibrium problem, and a variational inequality problem for co...

The variational iteration method(VIM) was extended to find approximate solutions of fractional chemical engineering equations. The Lagrange multipliers of the VIM were not identified explicitly. In this paper we improve the VIM by using concept of fixed point iteration method. Then this method was implemented for solving system of the time fractional chemical engineering equations. The ob...

We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

In this paper, we consider double sequence iteration processes for strongly $rho$-contractive mapping in modular space. It is proved, these sequences, convergence strongly to a fixed point of the strongly $rho$-contractive mapping.