STABILITY RESULTS FOR FIXED POINT ITERATION PROCEDURES

Authors

  • 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.

Downloads

Published

2017-05-11

Issue

Vol. 5 No. 5 (2016): Yearbook 2016/17

Section

Articles

Most read articles by the same author(s)