Approximation of coincidence points and common fixed points of a collection of mappings of metric spaces (Q736209)

Let \(X\) be a complete metric space. The author considers the problem of constructing an algorithm of successive approximations from any point in space to a given closed subset \(A\) of \(X.\) An estimate of the distance from an arbitrary initial point to the corresponding limit points is given by considering the following three versions of the subset \(A:\) {\parindent8mm \begin{itemize}\item[(i)] \(A\) is the complete preimage of a closed subspace \(H\) under a mapping from \(X\) into the metric space; \item[(ii)] \(A\) is the set of coincidence points of \(n\) mappings \((n>1)\) from \(X\) into \(Y;\) \item[(iii)] \(A\) is the set of common fixed points of \(n\) mappings from \(X\) into itself. \end{itemize}} The problems under consideration are stated in terms of a generalized discrete dynamical system with phase space \(X,\) translation semigroup equal to the additive semigroup of nonnegative integers and the limit set \(A.\) The results obtained are generalizations of several previous results. Indeed, Arutyunov's theorem and Banach's fixed point theorem are special cases of the results contained in the present paper.