Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4661556 | Annals of Pure and Applied Logic | 2017 | 17 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Andrei Sipoş,