International audienceExact rounding is provided for elementary floating-point arithmetic operations (e.g. in the IEEE standard). Many authors have felt that it should be provided for other operations, in particular for geometric constructions. We show how one may round modular representation of numbers to the closest f.p. representable number, and demonstrate how it can be applied to a variety of geometric constructions. Our methods use only single precision; they produce compact, efficient, and highly parallelizable code. We suggest that they can be applied in other settings when exact computations interact closely with rounded representations
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 i...
International audienceWe present a fast algorithm together with its low-level implementation of corr...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
In this paper we propose a new approach for the robust computation of the nearest integer lattice po...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
International audienceWe introduce an algorithm for multiplying a floating-point number $x$ by a con...
AbstractRobustness problems due to the substitution of the exact computation on real numbers by the ...
This text briefly presents the current state of our work on correctly rounded transcendentals, and e...
23 pagesWe introduce several algorithms for accurately evaluating powers to a positive integer in fl...
Robustness problems due to the substitution of the exact computation on real numbers by the rounded ...
International audienceWhen a floating-point computation is done, it is most of the time incorrect. T...
International audienceWe explicit the link between the computer arithmetic problem of providing corr...
AbstractExact computation is assumed in most algorithms in computational geometry. In practice, impl...
Robustness problems resulting from the substitution of floating-point arithmetic for exact arithmetic...
Une arithmétique sûre et efficace est un élément clé pour exécuter des calculs rapides et sûrs. Le c...
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 i...
International audienceWe present a fast algorithm together with its low-level implementation of corr...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...
In this paper we propose a new approach for the robust computation of the nearest integer lattice po...
International audienceRounding to odd is a non-standard rounding on floating-point numbers. By using...
International audienceWe introduce an algorithm for multiplying a floating-point number $x$ by a con...
AbstractRobustness problems due to the substitution of the exact computation on real numbers by the ...
This text briefly presents the current state of our work on correctly rounded transcendentals, and e...
23 pagesWe introduce several algorithms for accurately evaluating powers to a positive integer in fl...
Robustness problems due to the substitution of the exact computation on real numbers by the rounded ...
International audienceWhen a floating-point computation is done, it is most of the time incorrect. T...
International audienceWe explicit the link between the computer arithmetic problem of providing corr...
AbstractExact computation is assumed in most algorithms in computational geometry. In practice, impl...
Robustness problems resulting from the substitution of floating-point arithmetic for exact arithmetic...
Une arithmétique sûre et efficace est un élément clé pour exécuter des calculs rapides et sûrs. Le c...
In this contribution we deal with the rounding of real numbers to ftoatingpoint numbers. Section 1 i...
International audienceWe present a fast algorithm together with its low-level implementation of corr...
Floating-point arithmetic is an approximation of real arithmetic in which each operation may introdu...