Skip to Main content Skip to Navigation

Extension of the SLZ algorithm to bivariate functions

Lauriane Turelier 1 
1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
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.
Document type :
Complete list of metadata
Contributor : Lauriane Turelier Connect in order to contact the contributor
Submitted on : Friday, July 29, 2022 - 8:53:03 PM
Last modification on : Thursday, August 4, 2022 - 3:25:15 AM


  • HAL Id : hal-03740209, version 2



Lauriane Turelier. Extension of the SLZ algorithm to bivariate functions. [Research Report] INRIA Nancy. 2022. ⟨hal-03740209v2⟩



Record views


Files downloads