Convergence conditions for a type of algorithm schema
Gerard L. Meyer · 1977
This paper is devoted to the study of convergence conditions for the monotone and autonomous iterative algorithm schema. Two convergence conditions are presented, and it is shown that (i) they are not comparable and (ii) they contain the known convergence conditions for the schema. The presentation of the results is facilitated by the introduction of the concept of extended characteristic set of an iterative procedure.