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:
“It is surprising on stepping ashore anywhere into this unbroken wilderness to see so often, at least within a few rods of the river, the marks of an axe, made by lumberers who have either camped here or driven logs past in previous springs. You will see perchance where, going on the same errand that you do, they have cut large chips from a tall white pine stump for their fire.”
—Henry David Thoreau (1817–1862)
“Cold and hunger seem more friendly to my nature than those methods which men have adopted and advise to ward them off.”
—Henry David Thoreau (1817–1862)