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:
“As we approached the log house,... the projecting ends of the logs lapping over each other irregularly several feet at the corners gave it a very rich and picturesque look, far removed from the meanness of weather-boards. It was a very spacious, low building, about eighty feet long, with many large apartments ... a style of architecture not described by Vitruvius, I suspect, though possibly hinted at in the biography of Orpheus.”
—Henry David Thoreau (1817–1862)
“The methods by which a trade union can alone act, are necessarily destructive; its organization is necessarily tyrannical.”
—Henry George (1839–1897)