Exploiting structure in floating-point arithmetic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Exploiting structure in floating-point arithmetic


The analysis of algorithms in IEEE floating-point arithmetic is most often carried out via repeated applications of the so-called standard model, which bounds the relative error of each basic operation by a common epsilon depending only on the format. While this approach has been eminently useful for establishing many accuracy and stability results, it fails to capture most of the low-level features that make floating-point arithmetic so highly structured. In this paper, we survey some of those properties and how to exploit them in rounding error analysis. In particular, we review some recent improvements of several classical, Wilkinson-style error bounds from linear algebra and complex arithmetic that all rely on such structure properties.
Fichier principal
Vignette du fichier
jeannerod15.pdf (352.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01247059 , version 1 (21-12-2015)



Claude-Pierre Jeannerod. Exploiting structure in floating-point arithmetic. Mathematical Aspects of Computer and Information Sciences (MACIS), Nov 2015, Berlin, Germany. ⟨10.1007/978-3-319-32859-1_2⟩. ⟨hal-01247059⟩
179 View
249 Download



Gmail Facebook Twitter LinkedIn More