Options
Error Bounds for Computer Arithmetics
Citation Link: https://doi.org/10.15480/882.2561
Publikationstyp
Conference Paper
Date Issued
2019-06
Sprache
English
Author(s)
Institut
TORE-DOI
TORE-URI
Start Page
1
End Page
14
Article Number
8877451
Citation
26th IEEE Symposium on Computer Arithmetic, (ARITH-26) 2019
Contribution to Conference
Publisher DOI
Scopus ID
Publisher
IEEE
ISBN of container
978-1-7281-3366-9
978-1-7281-3367-6
This note summarizes recent progress in error bounds for compound operations performed in some computer arithmetic. Given a general set of real numbers together with some operations satisfying the first standard model, we identify three types A, B, and C of weak sufficient assumptions implying new results and sharper error estimates. Those include linearized error estimates in the number of operations, faithfully rounded and reproducible results. All types of assumptions are satisfied for an IEEE-754 p-digit base-f floating-point arithmetic.
DDC Class
600: Technology
Loading...
Name
Ru19.pdf
Size
443.18 KB
Format
Adobe PDF