Consequences of a properly implemented computer arithmetic for periodicities of iterative methods

In ordered sets it is possible to show under certain assumptions two basic theorems concerning the cycle length of sequences of iterates generated by monotone operators. These results are applied to different iterative methods, where the conclusions are valid for the sequences of iterates produced by the numerical computations only, if the used computer arithmetic is properly implemented.