Abstract
AbstractThere are simple algorithms to compute the predecessor, successor, unit in the first place, unit in the last place etc. in binary arithmetic. In this note equally simple algorithms for computing the unit in the first place and the unit in the last place in precision-p base-$$\beta $$
β
arithmetic with $$p \geqslant 1$$
p
⩾
1
and with $$\beta \geqslant 2$$
β
⩾
2
are presented. The algorithms work in the underflow range, and numbers close to overflow are treated by scaling. The algorithms use only the basic operations with directed rounding. If the successor (or predecessor) of a floating-point number is available, an algorithm in rounding to nearest is presented as well.
Funder
Technische Universität Hamburg
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference21 articles.
1. Boldo, S., Joldes, M., Muller, J.-M., Popescu, V.: Formal verification of a floating-point expansion renormalization algorithm. In: 8th International Conference on Interactive Theorem Proving (ITP’2017), vol. 10499 of Lecture Notes in Computer Science, Brasilia, Brazil (2017)
2. Boldo, S., Lauter, C., Muller, J.-M.: Emulating round-to-nearest ties-to-zero “augmented’’ floating-point operations using round-to-nearest ties-to-even arithmetic. IEEE Trans. Comput. 70(7), 1046–1058 (2021)
3. Brent, R., Zimmermann, P.: Modern Computer Arithmetic. Cambridge University Press, New York (2010)
4. Daumas, M.: Multiplications of floating-point expansions. In: Koren and Kornerup, editors, Proceedings of the 14th IEEE Symposium on Computer Arithmetic (Adelaide, Australia), 250–257. IEEE Computer Society Press, Los Alamitos, CA (1999)
5. Dekker, T.J.: A floating-point technique for extending the available precision. Numer. Math. 18, 224–242 (1971)