1. Faculty of Mathematics and Computer Science, University of Bucharest, Academiei 14, 010014 Bucharest, Romania;2. Simion Stoilow Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 014700 Bucharest, Romania
Abstract:
We use proof mining techniques to obtain a uniform rate of asymptotic regularity for the instance of the parallel algorithm used by López-Acedo and Xu to find common fixed points of finite families of k-strict pseudocontractive self-mappings of convex subsets of Hilbert spaces. We show that these results are guaranteed by a number of logical metatheorems for classical and semi-intuitionistic systems.