| Identifiant de l'article : |
 |
ensl-00169409, version 2 |
|
|
| Domaine : |
|
Informatique/Arithmétique des ordinateurs
|
|
|
| Titre : |
|
An efficient rounding boundary test for pow(x,y) in double precision |
|
|
| Auteur(s) : |
|
Christoph Lauter1, Vincent Lefèvre1 |
|
|
| Laboratoire : |
|
| 1 : |
LIP - Laboratoire de l'Informatique du Parallélisme |
|
|
|
| Équipe de recherche : |
|
[ARENAIRE - Arithmétique des ordinateurs] |
| Résumé : |
|
The correct rounding of the function pow: (x,y) -> x^y is currently based on Ziv's iterative approximation process. In order to ensure its termination, cases when x^y falls on a rounding boundary must be filtered out. Such rounding boundaries are floating-point numbers and midpoints between two consecutive floating-point numbers. Detecting rounding boundaries for pow is a difficult problem. Previous approaches use repeated square root extraction followed by repeated square and multiply. This article presents a new rounding boundary test for pow in double precision which resumes to a few comparisons with pre-computed constants. These constants are deduced from worst cases for the Table Maker's Dilemma, searched over a small subset of the input domain. This is a novel use of such worst-case bounds. The resulting algorithm has been designed for a fast-on-average correctly rounded implementation of pow, considering the scarcity of rounding boundary cases. It does not stall average computations for rounding boundary detection. The article includes its correction proof and experimental results. |
|
|
|
Langue du texte
intégral : |
|
Anglais |
|
|
| Mots-clés : |
|
floating-point arithmetic – correct rounding – power function |
|
|
| Commentaire : |
|
18 pages |
|
|
| Classification : |
|
ACM B.2.4; G.1.0 |
|
|
|
Récupérer au format
