Computing predecessor and successor in rounding to nearest (Q2391021): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1973494351 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithm 722: Functions to support the IEEE standard for binary floating-point arithmetic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4790659 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Accurate Floating-Point Summation Part I: Faithful Rounding / rank | |||
Normal rank |
Latest revision as of 19:26, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing predecessor and successor in rounding to nearest |
scientific article |
Statements
Computing predecessor and successor in rounding to nearest (English)
0 references
24 July 2009
0 references
The authors present a substantial improvement for interval operations giving an estimation of the predecessor and successor of a floating-point number using only a floating-point operations in rounding to nearest. The rounding to nearest is defined according to the IEEE 754 standard and also to the IEEE 754-2008 revised standard. The essential contribution of this paper is a simple and efficient algorithm for any radix to compute the bounds of an interval containing the floating arithmetical operations.
0 references
floating-point arithmetic
0 references
rounding to nearest
0 references
directed rounding
0 references
algorithm
0 references