Extension of the SLZ algorithm to bivariate functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2022

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.
Fichier principal
Vignette du fichier
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)

Dates and versions

hal-03740209 , version 1 (29-07-2022)
hal-03740209 , version 2 (29-07-2022)

Identifiers

  • HAL Id : hal-03740209 , version 2

Cite

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

Share

Gmail Facebook Twitter LinkedIn More