
doi: 10.1007/bf02253545
The paper is intended to show that floating-point arithmetic can be implemented in a way which leads to reasonable mathematical structures as described in chapters 5 and 6. It turns out for instance that all the rules of the minus-operator of the real numbers can be saved and that with respect to ≦ and ≧ inequalities can be manipulated as if they were real inequalities. These structures also occur in other fields of mathematics. They allow among others many theoretical considerations with floating-point arithmetics. Theorem 5.1 is the main result for the implementation. It reduces the structures to special properties of the rounding function. In chapter 3 these properties are derived as necessary conditions for an algebraic and order homomorphism between the real numbers and a floating-point system.
Roundoff error, Formal languages and automata, Algorithms in computer science
Roundoff error, Formal languages and automata, Algorithms in computer science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 7 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
