Please use this identifier to cite or link to this item:
Fulltext available Open Access
Publisher DOI: 10.1109/ARITH.2019.00011
Title: Error Bounds for Computer Arithmetics
Language: English
Authors: Rump, Siegfried M. 
Issue Date: Jun-2019
Source: Symposium on Computer Arithmetic (2019-June): 8877451 (2019-06)
Abstract (english): 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.
Conference: Symposium on Computer Arithmetic (2019) 
DOI: 10.15480/882.2561
ISBN: 978-172813366-9
Institute: Zuverlässiges Rechnen E-19 
Type: InProceedings (Aufsatz / Paper einer Konferenz etc.)
Appears in Collections:Publications with fulltext

Files in This Item:
File Description SizeFormat
Ru19.pdf443,18 kBAdobe PDFThumbnail
Show full item record

Page view(s)

Last Week
Last month
checked on Jan 24, 2020


checked on Jan 24, 2020

Google ScholarTM



Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.