CR-LIBM A library of correctly rounded elementary functions in double-precision

• For the DE version of the second step, it has been proven that double- double-extended intermediate computations are always enough to ensure correct rounding, even when worst

Corollary 2.. Proof: Follows from the second part of Lemma 4 by specializing the values

Our algorithm for all five functions follows the well-known strategy of argument reduction based on functional equations and lookup tables as de- scribed in section 3, followed

Lastly, for problems with a very large number of classes, like Chinese or Japanese ideogram recognition, we suspect that the unbalance of the number of the

Dans le cadre de la mise en œuvre des contractions hiérarchiques pour le cas stochastique, les premières opérations concernent les chemins, définis principalement par une séquence

Then, for each of the three main classes of elementary function algorithms (shift-and-add algorithms, polynomial or rational approximations, table-based methods) and for the

From the correspondence between the Virasoro description and the fermionic basis, and the possibility to compute the one point functions of the latter in the massive theory, one