Computing hard-to-round cases of sin, cos, tan in double precision
Résumé
This paper describes an exhaustive search algorithm to find the hardest-to-round cases of trigonometric functions (sin, cos, tan) in double precision (binary64). This algorithm reuses a clever reduction from the literature, but instead of using a sublinear search, it uses a brute force linear search. This algorithm was implemented using multi-threading and SIMD, and a full set of hard-to-round cases for the binary64 trigonometric functions was computed. As a consequence, the Table Maker's Dilemma is now fully solved for the most common univariate binary64 functions.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |