Uniform asymptotic regularity for Mann iterates
By Ulrich Kohlenbach. 2002
59 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Geometry and Topology, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/421cd6d3d1db8e8d6ca56533cff691835152e1e7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Laurentiu Leustean
- Genaro López-Acedo
- David Ariza-Ruiz
- Ulrich Kohlenbach
- Paulo Oliva
- Philipp Gerhardy
- Miroslav Bacák
- Jeremy Avigad
In Geometry and Topology
- Laurentiu Leustean
- Genaro López-Acedo
- David Ariza-Ruiz
- Paulo Oliva
- Ulrich Kohlenbach
- Jeremy Avigad
- Philipp Gerhardy
- Miroslav Bacák
In Numerical Analysis
Citations in the corpus
- Firmly nonexpansive mappings in classes of geodesic spaces (2012, methodology): “MR2445721 (2009k:03003) [26] U. Kohlenbach and L. Leuştean, Asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces, J. Eur.”
- Mann iterates of directionally nonexpansive mappings in hyperbolic spaces (2002, methodology): “This paper continues the approach of applying methods from Mathematical Logic to proofs in metric fixed point theory started by the first author in [12],[13],[14].”
- A quadratic rate of asymptotic regularity for CAT(0)-spaces (2005, methodology): “By a logical analysis of the proof of a theorem due to Borwein/Reich/Shafrir [2] (which generalizes Ishikawa’s result to unbounded C), Kohlenbach [17] obtained for the first time explicit bounds on the asymptotic regularity when general sequences (λn) satisfying (3), (4) are considered.”
- Some logical metatheorems with applications in functional analysis (2003, background): “15 and similar rates with even stronger uniformity features: it suffices to assume that there exists a point x∗ ∈ X whose iteration sequence is bounded rather than to assume that the whole space X is bounded (see [36],[37]).”
- Proof Mining: A Systematic Way of Analysing Proofs in Mathematics (2002, background): “In this section we report on the results of a recent case study of proof mining carried out by the first author (see [56, 57, 59] and – together with Laurenţiu Leuştean – [60]).”