Communication Dans Un Congrès Année : 2016

Exploiting structure in floating-point arithmetic

Résumé

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
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

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

Licence

Identifiants

Citer

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⟩
296 Consultations
504 Téléchargements

Altmetric

Partager

  • More