%A Marinov, Rumen
%A Nedelcheva, Diana
%D 2017
%T STABILITY RESULTS FOR FIXED POINT ITERATION PROCEDURES
%K
%X 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.
%U http://js.ugd.edu.mk/index.php/YFCS/article/view/1780
%J Yearbook - Faculty of Computer Science
%0 Journal Article
%P 21-26
%V 5
%N 5
%@ 1857- 8691
%8 2017-05-11