Rump, Siegfried M.Siegfried M.Rump2008-03-202008-03-201991Wissenschaftliche Zeitschrift, TU Leipzig, 15(6):427–432, 1991http://tubdok.tub.tuhh.de/handle/11420/299In the literature efficient algorithms have been described for calculating guaranteed inclusions for the solution of a number of standard numerical problems. The inclusions are given by means of a set containing the solution. In [11,12] this set is calculated using an affine iteration which stops after a nonempty and compact set has been mapped into itself. In this paper different types of auch sets are investigated, namely general sets, hyperrectangles and standard simlices. For affine iterations using those types of sets global convergence properties are given. Here, global convergence means that the iteration stops for every starting set with a set being mapped into itself.enhttp://doku.b.tu-harburg.de/doku/lic_ohne_pod.phpconvergenceiterationinclusion methodJournal Article2008-03-31urn:nbn:de:gbv:830-tubdok-369910.15480/882.297IterationKonvergenz11420/29910.15480/882.297930768455Other