Extension of the SLZ algorithm to bivariate functions
Abstract
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.
Domains
Computer Science [cs]
Fichier principal
Rapport de recherche (1).pdf (229.36 Ko)
Télécharger le fichier
all.zip (2.2 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)