Extension of the SLZ algorithm to bivariate functions
Résumé
I propose an extension of the SLZ algorithm to find worst cases for the correct rounding of mathematical functions of two variables. First, I recall the principle of the algorithm for univariate functions. Then, I detail the extension to the bivariate functions and I prove that the algorithm is correct. Finally, I test the algorithm with the power function in single and double precision, I calculate its computation time and I expose some improvements to make the algorithm faster.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)