Abstract
We adjoin a more precise companion to the classical mediant rounding algorithm for rational numbers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Khinchin AYa (1997) Continued fractions. Dover, New York
Kornerup P, Matula DW (1978) A feasibility analysis of fixed-slash rational arithmetic. In: Proceedings of the 4th IEEE symposium on computer arithmetic, pp 39–47
Kornerup P, Matula DW (1985) Finite precision lexicographic continued fraction number systems. In: Proceedings of the 7th IEEE symposium on computer arithmetic, pp 207–214
Kornerup P, Matula DW (1995) LCF: a lexicographic binary representation of the rationals. J Universal Comput Sci 1(7)
Matula DW, Kornerup P (1979) Approximate rational arithmetic systems: analysis of recovery of simple fractions during expression evaluation. Symbolic and Algebraic Computation. In: Ng EW (ed) Proceedings of EUROSAM, Lecture Notes in Computer Science, vol. 72. Springer, Berlin, pp 383–397
Matula DW, Kornerup P (1980) Foundations of finite precision rational arithmetic. Computing, Suppl., vol. 2. Springer, Heidelberg, pp 85–111
Matula DW, Kornerup P (1985) Finite precision rational arithmetic: slash number systems. IEEE Trans Comput, c-34, No. 1
Perron O (1954) Die Lehre von den Kettenbrüchen. Bd. I Elementare Kettenbrüche. (German) 3te Aufl. B. G. Teubner Verlagsgesellschaft, Stuttgart
Rockett AM, Szüsz P (1992) Continued fractions. World Scientific, Singapore
Author information
Authors and Affiliations
Corresponding author
Additional information
An erratum to this article can be found at http://dx.doi.org/10.1007/s00607-008-0013-8
Rights and permissions
About this article
Cite this article
Thill, M. A more precise rounding algorithm for rational numbers. Computing 82, 189–198 (2008). https://doi.org/10.1007/s00607-008-0006-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-008-0006-7