Interval arithmetic is a fundamental and reliable mathematical machinery for scientific computing and for addressing uncertainty in general. In order to apply interval mathematics to real life uncertainty problems, one needs a computerized (machine) version thereof, and so, this article is devoted to some mathematical notions concerning the algebraic system of machine interval arithmetic. After formalizing some purely mathematical ingredients of particular importance for the purpose at hand, we give formal characterizations of the algebras of real intervals and machine intervals along with describing the need for interval computations to cope with uncertainty problems. Thereupon, we prove some algebraic and order-theoretic results concerning the structure of machine intervals.
On Some Algebraic and Order-Theoretic Aspects of Machine Interval Arithmetic
2019-04-01
oai:zenodo.org:2656089
Online Mathematics Journal 01(02) 1–13
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Interval mathematics , Machine interval arithmetic , Outward rounding , Floating-point arithmetic , Machine monotonicity , Dense orders , Orderability of intervals , Singletonicity , Subdistributive semiring , S-semiring , Error analysis and interval analysis , Mathematical problems of computer architecture , Order , lattices , ordered algebraic structures , Set theory , Algebraic structures
DDC: | 629 |
Determination of Inspection Order by Interval Arithmetic Neural Networks
British Library Online Contents | 1995
|Recent Topic on Circuit Analysis Application of Interval Arithmetic
British Library Online Contents | 1996
|