Downloads & Free Reading Options - Results

A theory of interval iteration, based on a few simple assumptions, is given for the fixed point problem for operators in partially ordered topological spaces. A comparison of interval with ordinary iteration is made which shows that their properties are converse in a certain sense with respect to existence or nonexistence of fixed points. The theory of interval iteration is shown to hold without modification if the computation is restricted to a finite set of points, as in actual practice. In this latter case interval iteration is show to converge or diverge in a finite number of steps, for which an upper bound is given. By the introduction of a suitable iteration operator, the method of interval iteration is extended to the problem of solution of equations in linear spaces. (Author)