The purpose of this paper is first to introduce the concept of total quasi-φ-asymptotically nonexpansive mapping which contains many kinds of mappings as its special cases and then to use a hybrid algorithm to introduce a new iterative scheme for finding a common element of the set of solutions for a system of generalized mixed equilibrium problems and the set of common fixed points for a count...

In this paper, we introduce a one-step iterative scheme for finding a common fixed point of a finite family of multivalued quasi-nonexpansive mappings in a real uniformly convex Banach space. We establish weak and strong convergence theorems of the proposed iterative scheme under some appropriate conditions.

In this paper, we consider a new random iteration process to approximate a common random fixed point of a finite family of uniformly quasi-Lipschitzian random mappings in generalized convex metric spaces. Our results presented in this paper extend and improve several recent results. c ©2016 All rights reserved.

In this paper, we introduce a one-step iterative scheme for finding a common fixed point of a finite family of multivalued quasi-nonexpansive mappings in a real uniformly convex Banach space. We establish weak and strong convergence theorems of the proposed iterative scheme under some appropriate conditions.

The purpose of this paper is to introduce a new hybrid projection method based on modified Mann iterative scheme by the generalized f-projection operator for a countable family of relatively quasi-nonexpansive mappings and the solutions of the system of generalized mixed equilibrium problems. Furthermore, we prove the strong convergence theorem for a countable family of relatively quasi-nonexpa...

A convergence theorem of Rhoades [18] regarding the approximation of fixed points of some quasi contractive operators in uniformly convex Banach spaces using the Ishikawa iterative procedure, is extended to arbitrary Banach spaces. The conditions on the parameters {αn} that define the Ishikawa iteration are also weakened.

Article history: Received 2 April 2014 Available online 2 July 2014 Submitted by P. Nevai

We show that for almost all choices of parameters, the elliptic subset sum pseudorandom number generator produces a sequence of uniformly distributed pseudorandom numbers. The result is useful for both cryptographic and Quasi Monte Carlo applications and relies on bounds of exponential sums.