This paper presents upper bounds on the number of zeros and ones after the rounding bit for algebraic functions. These functions include reciprocal, division, square root, and inverse square root, which have been considered in previous work. We here propose simpler proofs for the previously given bounds given and generalize to all algebraic functions. We also determine cases for which the bound is achieved for square root. As is mentioned in the previous work, these bounds are useful for determining the precision required in the computation of approximations in order to be able to perform correct rounding.Nous donnons des majorations du nombre de zéros ou de uns consécutifs après le bit d’arrondi pour l’image d’un nombre virgule flottante p...
The Floating-Point (FP) implementation of a real-valued function is performed with correct rounding ...
Quotients, reciprocals, square roots and square root reciprocals all have the property that infinite...
AbstractThe reciprocal square root calculation α=1/x is very common in scientific computations. Havi...
This paper presents upper bounds on the number of zeros and ones after the rounding bit for algebrai...
(eng) This paper presents upper bounds on the number of zeros and ones after the rounding bit for al...
International audienceWe explicit the link between the computer arithmetic problem of providing corr...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
International audienceRounding error analyses of numerical algorithms are most often carried out via...
International audienceThe 2008 revision of the IEEE-754 standard, which governs floating-point arith...
International audienceWe analyze two fast and accurate algorithms recently presented by Borges for c...
Une arithmétique sûre et efficace est un élément clé pour exécuter des calculs rapides et sûrs. Le c...
7 pagesIn this note, we present a variant of an algorithm by Schönhage for counting the number of ze...
Abstract. Rounding error analyses of numerical algorithms are most often carried out via repeated ap...
Abstract. We explicit the link between the computer arithmetic problem of providing correctly rounde...
The Floating-Point (FP) implementation of a real-valued function is performed with correct rounding ...
Quotients, reciprocals, square roots and square root reciprocals all have the property that infinite...
AbstractThe reciprocal square root calculation α=1/x is very common in scientific computations. Havi...
This paper presents upper bounds on the number of zeros and ones after the rounding bit for algebrai...
(eng) This paper presents upper bounds on the number of zeros and ones after the rounding bit for al...
International audienceWe explicit the link between the computer arithmetic problem of providing corr...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
International audienceRounding error analyses of numerical algorithms are most often carried out via...
International audienceThe 2008 revision of the IEEE-754 standard, which governs floating-point arith...
International audienceWe analyze two fast and accurate algorithms recently presented by Borges for c...
Une arithmétique sûre et efficace est un élément clé pour exécuter des calculs rapides et sûrs. Le c...
7 pagesIn this note, we present a variant of an algorithm by Schönhage for counting the number of ze...
Abstract. Rounding error analyses of numerical algorithms are most often carried out via repeated ap...
Abstract. We explicit the link between the computer arithmetic problem of providing correctly rounde...
The Floating-Point (FP) implementation of a real-valued function is performed with correct rounding ...
Quotients, reciprocals, square roots and square root reciprocals all have the property that infinite...
AbstractThe reciprocal square root calculation α=1/x is very common in scientific computations. Havi...