Some notes on the possible under/overflow of the most common elementary functions
Résumé
The purpose of this short note is not to describe when underflow or overflow must be signalled (it is quite clear that the rules are the same as for the basic arithmetic operations). We just want to show that for some of the most common functions and floating-point formats, in many cases, we can know in advance that the results will always lie in the range of the numbers that are representable by normal floating-point numbers, so that in these cases there is no need to worry about underflow or overflow. Note that when it is not the case, an implementation is still possible using a run-time test.
Domaines
Autre [cs.OH]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...