Large Integer Methods
Methods designed for hardware implementation generally do not scale to integers with thousands or millions of decimal digits; these frequently occur, for example, in modular reductions in cryptography. For these large integers, more efficient division algorithms transform the problem to use a small number of multiplications, which can then be done using an asymptotically efficient multiplication algorithm such as the Karatsuba algorithm, Toom–Cook multiplication or the Schönhage–Strassen algorithm. It results that the computational complexity of the division is of the same order (up a multiplicative constant) as that of the multiplication. Examples include reduction to multiplication by Newton's method as described above as well as the slightly faster Barrett reduction algorithm. Newton's method's is particularly efficient in scenarios where one must divide by the same divisor many times, since after the initial Newton inversion only one (truncated) multiplication is needed for each division.
Read more about this topic: Division Algorithm
Famous quotes containing the words large and/or methods:
“So immense are the claims on a mother, physical claims on her bodily and brain vigor, and moral claims on her heart and thoughts, that she cannot ... meet them all and find any large margin beyond for other cares and work. She serves the community in the very best and highest way it is possible to do, by giving birth to healthy children, whose physical strength has not been defrauded, and to whose moral and mental nature she can give the whole of her thoughts.”
—Frances Power Cobbe (1822–1904)
“If men got pregnant, there would be safe, reliable methods of birth control. They’d be inexpensive, too.”
—Anna Quindlen (b. 1952)