STABILITY RESULTS FOR FIXED POINT ITERATION PROCEDURES

  • Rumen Marinov Technical University, Varna
  • Diana Nedelcheva Technical University, Varna

Abstract

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.

Published
May 11, 2017
How to Cite
MARINOV, Rumen; NEDELCHEVA, Diana. STABILITY RESULTS FOR FIXED POINT ITERATION PROCEDURES. Yearbook - Faculty of Computer Science, [S.l.], v. 5, n. 5, p. pp. 21-26, may 2017. ISSN 1857- 8691. Available at: <http://js.ugd.edu.mk/index.php/YFCS/article/view/1780>. Date accessed: 23 sep. 2017.