Go to  Advanced Search

S-R-T division algorithms as dynamical systems

Show full item record

Files in this item

Files Size Format Description   View
ubc_2002-0175.pdf 1.827Mb Adobe Portable Document Format   View/Open
Title: S-R-T division algorithms as dynamical systems
Author: McCann, Mark A.
Degree Master of Science - MSc
Program Computer Science
Copyright Date: 2002
Abstract: S-R-T division, as it was discovered in the late 1950s [4, 19, 23], represented an important improvement in the speed of division algorithms for computers at the time. A variant of S-R-T division is still commonly implemented in computers today. Although some bounds on the performance of the original S-R-T division method were obtained, a great many questions remained unanswered. In this thesis, S-R-T 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 S-R-T division is ergodic, and is even Bernoulli, for all real divisors and dividends.
URI: http://hdl.handle.net/2429/12179
Series/Report no. UBC Retrospective Theses Digitization Project [http://www.library.ubc.ca/archives/retro_theses/]

This item appears in the following Collection(s)

Show full item record

All items in cIRcle are protected by copyright, with all rights reserved.

UBC Library
1961 East Mall
Vancouver, B.C.
Canada V6T 1Z1
Tel: 604-822-6375
Fax: 604-822-3893