Abstract
In this work we show that if iterates of a nonexpansive self-mapping of a complete metric with a graph converge uniformly on a subset of the space, then this convergence is stable under the presence of small computational errors.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
