1993
DOI: 10.1016/0010-4485(93)90069-z
|View full text |Cite
|
Sign up to set email alerts
|

Floating-point numbers with error estimates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

1997
1997
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 18 publications
0
4
0
Order By: Relevance
“…Other real-time techniques attempt to mitigate error, but only do so by increasing the overhead. Some of these techniques have the goal of computing results within error bounds, such as interval arithmetic [30] and real-time statistical analysis [31], [32]. But these require two floating point operations and require the storage of two floating point values and, thereby, increase the needed time and memory.…”
Section: Other Mitigation Techniquesmentioning
confidence: 99%
“…Other real-time techniques attempt to mitigate error, but only do so by increasing the overhead. Some of these techniques have the goal of computing results within error bounds, such as interval arithmetic [30] and real-time statistical analysis [31], [32]. But these require two floating point operations and require the storage of two floating point values and, thereby, increase the needed time and memory.…”
Section: Other Mitigation Techniquesmentioning
confidence: 99%
“…As the addition of two floating-point numbers can be represented by a sum and an error, the multiplication between two floating-point numbers also has such a property, which means that the exact value of the product of two floating-point numbers can be represented by a sum of two floating-point numbers [12]. Priest [15] introduces a compound representation for floating-point numbers, called expansions, to reduce the rounding error and compute an accurate error.…”
Section: Outputmentioning
confidence: 99%
“…If b does not have representation error, then b = 0, whence p = 0 and q = 0. Since the exact value of the product of two floating-point numbers can be represented by a sum of two floating-point numbers[9,10], ab could be exactly computed by ab = c + d, where c and d are two floating-point numbers. The minimal intervals that contain the value of AB are:…”
mentioning
confidence: 99%