Document Type
Article
Department
Mathematics (HMC)
Publication Date
2005
Abstract
Sweeney--Robertson--Tocher (SRT) division, as it was discovered in the late 1950s, represented an important improvement in the speed of division algorithms for computers at the time. A variant of SRT division is still commonly implemented in computers today. Although some bounds on the performance of the original SRT division method were obtained, a great many questions remained unanswered. In this paper, the original version of SRT division is described as a dynamical system. This enables us to bring modern dynamical systems theory, a relatively new development in mathematics, to bear on an older problem. In doing so, we are able to show that SRT division is ergodic, and is even Bernoulli, for all real divisors and dividends. With the Bernoulli property, we are able to use entropy to prove that the natural extensions of SRT division are isomorphic by way of the Kolmogorov--Ornstein theorem. We demonstrate how our methods and results can be applied to a much larger class of division algorithms.
Rights Information
© 2005 Society for Industrial and Applied Mathematics
DOI
10.1137/S009753970444106X
Recommended Citation
McCann M., and Pippenger N. “SRT Division Algorithms as Dynamical Systems”, SIAM Journal of Computing, 34, 1279 (2005).
