STABILITY RESULTS FOR FIXED POINT ITERATION PROCEDURES
While solving inclusions numerically by an iterative procedure, usually we follow some theoretical model and deal with an approximate numerical sequence. If the numerical sequence converges to a point anticipated by the theoretical sequence, then we say that the iterative procedure is stable. This kind of study plays a vital role in computational analysis, game theory and computer programming. The purpose of this paper is to discuss stability of the Picard iterative procedure for pseudo-Lipschitz multivalued operators in metric spaces.