DocumentCode
3378239
Title
Consequences of a properly implemented computer arithmetic for periodicities of iterative methods
Author
Klatte, R. ; Ullrich, Ch.
fYear
1975
fDate
19-20 Nov. 1975
Firstpage
24
Lastpage
32
Abstract
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.
Keywords
Computers; Digital arithmetic; Finite element methods; Indexes; Iterative methods; Vectors; Zirconium; Rounding invariant structures; cycle; floating-point arithmetic; weakly cyclic vector function;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Arithmetic (ARITH), 1975 IEEE 3rd Symposium on
Conference_Location
Dallas, TX, USA
Type
conf
DOI
10.1109/ARITH.1975.6156992
Filename
6156992
Link To Document