inria-00000025, version 2
New Results on the Distance Between a Segment and Z². Application to the Exact Rounding
17th IEEE Symposium on Computer Arithmetic - Arith'17 (2005) 68-75
Résumé : This paper presents extensions to Lefèvre's algorithm that computes a lower bound on the distance between a segment and a regular grid Z². This algorithm and, in particular, the extensions are useful in the search for worst cases for the exact rounding of unary elementary functions or base-conversion functions. The proof that is presented here is simpler and less technical than the original proof. This paper also gives benchmark results with various optimization parameters, explanations of these results, and an application to base conversion.
- 1 : SPACES (INRIA Lorraine - LORIA)
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine
- Domaine : Informatique/Algorithme et structure de données
- Mots-clés : computer arithmetic – correct rounding – exact rounding – table maker's dilemma – base conversion
- inria-00000025, version 2
- http://hal.inria.fr/inria-00000025
- oai:hal.inria.fr:inria-00000025
- Contributeur : Vincent Lefèvre
- Soumis le : Mercredi 6 Juillet 2005, 17:33:04
- Dernière modification le : Mercredi 3 Septembre 2008, 13:20:24
Documents associés
Exporter