Numerical reproducibility in HPC: issues in interval arithmetic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Numerical reproducibility in HPC: issues in interval arithmetic

Abstract

The problem of numerical reproducibility is the problem of getting the same result when a numerical computation is run several times, whether on the same machine or on different machines. The accuracy of the result is a different issue. As far as interval arithmetic is concerned, the relevant issue is the inclusion property, that is, the guarantee that the exact result belongs to the computed resulting interval.
Fichier principal
Vignette du fichier
Revol-Theveny-SWIM13.pdf (36.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00922114 , version 1 (23-12-2013)

Identifiers

  • HAL Id : hal-00922114 , version 1

Cite

Nathalie Revol, Philippe Théveny. Numerical reproducibility in HPC: issues in interval arithmetic. SWIM'2013: Small Workshop on Interval Methods, Jun 2013, Brest, France. ⟨hal-00922114⟩
119 View
205 Download

Share

Gmail Facebook X LinkedIn More