Rump, Siegfried M.Siegfried M.Rump2020-01-092020-01-092019-06Symposium on Computer Arithmetic (2019-June): 8877451 (2019-06)http://hdl.handle.net/11420/4326This 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.enhttp://rightsstatements.org/vocab/InC/1.0/Conference Paper10.15480/882.256110.1109/ARITH.2019.0001110.15480/882.2561Conference Paper