 Multiplication algorithm

A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.
Grid method
Main article: Grid method multiplicationThe grid method (or box method) is an introductory method for multipledigit multiplication that is often taught to pupils at primary school or elementary school level. It has been a standard part of the national primaryschool mathematics curriculum in England and Wales since the late 1990s.^{[1]}
Both factors are broken up ("partitioned") into their hundreds, tens and units parts, and the products of the parts are then calculated explicitly in a relatively simple multiplicationonly stage, before these contributions are then totalled to give the final answer in a separate addition stage.
Thus for example the calculation 34 × 13 could be computed using the grid
300 40 90 + 12  442

30 4 10 300 40 3 90 12
followed by addition to obtain 442, either in a single sum (see right), or through forming the rowbyrow totals (300 + 40) + (90 + 12) = 340 + 102 = 442.
This calculation approach (though not necessarily with the explicit grid arrangement) is also known as the partial products algorithm. Its essence is the calculation of the simple multiplications separately, with all addition being left to the final gatheringup stage.
The grid method can in principle be applied to factors of any size, although the number of subproducts becomes cumbersome as the number of digits increases. Nevertheless it is seen as a usefully explicit method to introduce the idea of multipledigit multiplications; and, in an age when most multiplication calculations are done using a calculator or a spreadsheet, it may in practice be the only multiplication algorithm that some students will ever need.
Long multiplication
If a positional numeral system is used, a natural way of multiplying numbers is taught in schools as long multiplication, sometimes called gradeschool multiplication: multiply the multiplicand by each digit of the multiplier and then add up all the properly shifted results. It requires memorization of the multiplication table for single digits.
This is the usual algorithm for multiplying larger numbers by hand in base 10. Computers normally use a very similar shift and add algorithm in base 2. A person doing long multiplication on paper will write down all the products and then add them together; an abacususer will sum the products as soon as each one is computed.
Example
This example uses long multiplication to multiply 23,958,233 (multiplicand) by 5,830 (multiplier) and arrives at 139,676,498,390 for the result (product).
23958233 5830 ×  00000000 ( = 23,958,233 × 0) 71874699 ( = 23,958,233 × 30) 191665864 ( = 23,958,233 × 800) 119791165 ( = 23,958,233 × 5,000)  139676498390 ( = 139,676,498,390 )
Space complexity
Let n be the total number of bits in the two input numbers. Long multiplication has the advantage that it can easily be formulated as a log space algorithm; that is, an algorithm that only needs working space proportional to the logarithm of the number of digits in the input (Θ(log n)). This is the double logarithm of the numbers being multiplied themselves (log log N). We don't include the input or output bits in this measurement, since that would trivially make the space requirement linear; instead we make the input bits readonly and the output bits writeonly. (This just means that input and output bits are not counted as we count only read AND writable bits.)
The method is simple: we add the columns righttoleft, keeping track of the carry as we go. We don't have to store the columns to do this. To show this, let the ith bit from the right of the first and second operands be denoted a_{i} and b_{i} respectively, both starting at i = 0, and let r_{i} be the ith bit from the right of the result. Then
r_{i} = c + ∑ a_{j}b_{k}, j + k = i where c is the carry from the previous column. Provided neither c nor the total sum exceed log space, we can implement this formula in log space, since the indexes j and k each have O(log n) bits.
A simple inductive argument shows that the carry can never exceed n and the total sum for r_{i} can never exceed 2n: the carry into the first column is zero, and for all other columns, there are at most n bits in the column, and a carry of at most n coming in from the previous column (by the induction hypothesis). Their sum is at most 2n, and the carry to the next column is at most half of this, or n. Thus both these values can be stored in O(log n) bits.
In pseudocode, the logspace algorithm is:
multiply(a[0..n−1], b[0..n−1]) // Arrays representing the binary representations x ← 0 for i from 0 to 2n−1 for j from max(0,i+1−n) to min(i,n−1)column multiplication k ← i − j x ← x + (a[j] × b[k]) result[i] ← x mod 2 x ← floor(x/2)
Electronic usage
Some chips implement this algorithm for various integer and floatingpoint sizes in hardware or in microcode. In arbitraryprecision arithmetic, it's common to use long multiplication with the base set to 2^{w}, where w is the number of bits in a word, for multiplying relatively small numbers.
To multiply two numbers with n digits using this method, one needs about n^{2} operations. More formally: using a natural size metric of number of digits, the time complexity of multiplying two ndigit numbers using long multiplication is Θ(n^{2}).
When implemented in software, long multiplication algorithms have to deal with overflow during additions, which can be expensive. For this reason, a typical approach is to represent the number in a small base b such that, for example, 8b^{2} is a representable machine integer (for example Richard Brent used this approach in his Fortran package MP^{[2]}); we can then perform several additions before having to deal with overflow. When the number becomes too large, we add part of it to the result or carry and map the remaining part back to a number less than b; this process is called normalization.
Sunzi multiplication algorithm
Sunzi Mathematical Classic of 400AD detailed step by step multiplication algorithm with Rod calculus Sunzi mulitplication algorithm was first introduced to Arab countries by Al Khwarizmi in his book about Indian arithmetics; later also appeared in 1011th century Kushyar ibn Labban's book Principle of Hindu Reckoning.^{[3]}
Lattice multiplication
Main article: Lattice multiplicationLattice, or sieve, multiplication is algorithmically equivalent to long multiplication. It requires the preparation of a lattice (a grid drawn on paper) which guides the calculation and separates all the multiplications from the additions. It was introduced to Europe in 1202 in Fibonacci's Liber Abaci. Leonardo described the operation as mental, using his right and left hands to carry the intermediate calculations. Matrakçı Nasuh presented 6 different variants of this method in this 16th century book, Umdetul Hisab. It was widely used in Enderun schools across the Ottoman Empire.^{[4]} Napier's bones, or Napier's rods also used this method, as published by Napier in 1617, the year of his death.
As shown in the example, the multiplicand and multiplier are written above and to the right of a lattice, or a sieve. It is found in Muhammad ibn Musa alKhwarizmi's "Arithmetic", one of Leonardo's sources mentioned by Sigler, author of "Fibonacci's Liber Abaci", 2002.
 During the multiplication phase, the lattice is filled in with twodigit products of the corresponding digits labeling each row and column: the tens digit goes in the topleft corner.
 During the addition phase, the lattice is summed on the diagonals.
 Finally, if a carry phase is necessary, the answer as shown along the left and bottom sides of the lattice is converted to normal form by carrying ten's digits as in long addition or multiplication.
Example
The pictures on the right show how to calculate 345 × 12 using lattice multiplication. As a more complicated example, consider the picture below displaying the computation of 23,958,233 multiplied by 5,830 (multiplier); the result is 139,676,498,390. Notice 23,958,233 is along the top of the lattice and 5,830 is along the right side. The products fill the lattice and the sum of those products (on the diagonal) are along the left and bottom sides. Then those sums are totaled as shown.
2 3 9 5 8 2 3 3 +++++++++ 1 /1 /4 /2 /4 /1 /1 /1 /  /  /  /  /  /  /  /  /  5 01/ 0/ 5/ 5/ 5/ 0/ 0/ 5/ 5 +++++++++ 1 /2 /7 /4 /6 /1 /2 /2 /  /  /  /  /  /  /  /  /  8 02/ 6/ 4/ 2/ 0/ 4/ 6/ 4/ 4 +++++++++ 0 /0 /2 /1 /2 /0 /0 /0 /  /  /  /  /  /  /  /  /  3 17/ 6/ 9/ 7/ 5/ 4/ 6/ 9/ 9 +++++++++ 0 /0 /0 /0 /0 /0 /0 /0 /  /  /  /  /  /  /  /  /  0 24/ 0/ 0/ 0/ 0/ 0/ 0/ 0/ 0 +++++++++ 26 15 13 18 17 13 09 00
01 002 0017 00024 000026 0000015 00000013 000000018 0000000017 00000000013 000000000009 0000000000000 ============= 139676498390
= 139,676,498,390
Peasant or binary multiplication
Main article: Peasant multiplicationIn base 2, long multiplication reduces to a nearly trivial operation. For each '1' bit in the multiplier, shift the multiplicand an appropriate amount and then sum the shifted values. Depending on computer processor architecture and choice of multiplier, it may be faster to code this algorithm using hardware bit shifts and adds rather than depend on multiplication instructions, when the multiplier is fixed and the number of adds required is small.
This algorithm is also known as Peasant multiplication, because it has been widely used among those who are unschooled and thus have not memorized the multiplication tables required by long multiplication. The algorithm was also in use in ancient Egypt.
On paper, write down in one column the numbers you get when you repeatedly halve the multiplier, ignoring the remainder; in a column beside it repeatedly double the multiplicand. Cross out each row in which the last digit of the first number is even, and add the remaining numbers in the second column to obtain the product.
The main advantages of this method are that it can be taught quickly, no memorization is required, and it can be performed using tokens such as poker chips if paper and pencil are not available. It does however take more steps than long multiplication so it can be unwieldy when large numbers are involved.
Examples
This example uses peasant multiplication to multiply 11 by 3 to arrive at a result of 33.
Decimal: Binary: 11 3 1011 11 5 6 101 110 2
121011001 24 1 11000   33 100001Describing the steps explicitly:
 11 and 3 are written at the top
 11 is halved (5.5) and 3 is doubled (6). The fractional portion is discarded (5.5 becomes 5).
 5 is halved (2.5) and 6 is doubled (12). The fractional portion is discarded (2.5 becomes 2). The figure in the left column (2) is even, so the figure in the right column (12) is discarded.
 2 is halved (1) and 12 is doubled (24).
 All notscratchedout values are summed: 3 + 6 + 24 = 33.
The method works because multiplication is distributive, so:
A more complicated example, using the figures from the earlier examples (23,958,233 and 5,830):
Decimal: Binary: 5830
23958233101101100011010110110110010010110110012915 47916466 101101100011 10110110110010010110110010 1457 95832932 10110110001 101101101100100101101100100 72819166586410110110001011011011001001011011001000364383331728101101100101101101100100101101100100001827666634561011011010110110110010010110110010000091 1533326912 1011011 1011011011001001011011001000000 45 3066653824 101101 10110110110010010110110010000000 2261333076481011010110110110010010110110010000000011 12266615296 1011 1011011011001001011011001000000000 5 24533230592 101 10110110110010010110110010000000000 249066461184101011011011001001011011001000000000001 98132922368 1 1011011011001001011011001000000000000  1022143253354344244353353243222210110 (before carry) 139676498390 10000010000101010111100011100111010110Shift and add
Most computers use a "shift and add" algorithm for multiplying small integers. Both base 2 long multiplication and base 2 peasant multiplication reduce to this same algorithm.
In base 2, multiplying by the single digit of the multiplier reduces to a simple series of logical AND operations. Each partial product is added to a running sum as soon as each partial product is computed. Most currently available microprocessors implement this or other similar algorithms (such as Booth encoding) for various integer and floatingpoint sizes in hardware multipliers or in microcode.
On currently available processors, a bitwise shift instruction is faster than a multiply instruction and can be used to multiply (shift left) and divide (shift right) by powers of two. Multiplication by a constant and division by a constant can be implemented using a sequence of shifts and adds or subtracts. For example, there are several ways to multiply by 10 using only bitshift and addition.
((x << 2) + x) << 1 (x << 3) + (x << 1)
In some cases such sequences of shifts and adds or subtracts will outperform hardware multipliers and especially dividers. A division by a number of the form 2^{n} or often can be converted to such a short sequence.
These types of sequences have to always be used for computers that do not have a "multiply" instruction,^{[5]} and can also be used by extension to floating point numbers if one replaces the shifts with computation of 2*x as x+x, as these are logically equivalent.
Quarter square multiplication
Two quantities can be multiplied using quarter squares by employing the following identity attributed to Babylonian mathematics (2000–1600 BC)
If x+y is odd then xy will also be odd, this means any fraction will cancel out so no accuracy is lost by discarding the remainders. Below is a lookup table of quarter squares with the remainder discarded for the digits 0 through 18,, this allows for the multiplication of numbers up to 9×9.
n 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 ⌊n^{2}/4⌋ 0 0 1 2 4 6 9 12 16 20 25 30 36 42 49 56 64 72 81 If, for example, you wanted to multiply 9 by 3, you observe that the sum and difference are 12 and 6 respectively. Looking both those values up on the table yields 36 and 9, the difference of which is 27, which is the product of 9 and 3.
Antoine Voisin published a table of quarter squares from 1 to 1000 in 1817 as an aid in multiplication. A larger table of quarter squares from 1 to 100000 was published by Samuel Laundy in 1856,^{[6]} and a table from 1 to 200000 by Joseph Blater in 1888.^{[7]}
Quarter square multipliers were used in analog computers to form an analog signal that was the product of two analog input signals. In this application, the sum and difference of two input voltages are formed using operational amplifiers. The square of each of these is approximated using piecewise linear circuits. Finally the difference of the two squares is formed and scaled by a factor of one fourth using yet another operational amplifier.
In 1980, Everett L. Johnson proposed using the quarter square method in a digital multiplier.^{[8]} To form the product of two 8bit integers, for example, the digital device forms the sum and difference, looks both quantities up in a table of squares, takes the difference of the results, and divides by four by shifting two bits to the right. For 8bit integers the table of quarter squares will have 2^{9} entries of 16 bits each.
The Quarter square multiplier technique has also benefitted 8 bit systems that do not have any support for a hardware multiplier. Steven Judd implemented this for the 6502.^{[9]}
Fast multiplication algorithms for large inputs
Unsolved problems in computer science What is the fastest algorithm for multiplication of two ndigit numbers? Gauss's complex multiplication algorithm
Complex multiplication normally involves four multiplications. By 1805 Gauss had discovered a way of reducing the number of multiplications to three.^{[10]}
The product (a + bi) · (c + di) can be calculated in the following way.
 k_{1} = c · (a + b)
 k_{2} = a · (d − c)
 k_{3} = b · (c + d)
 Real part = k_{1} − k_{3}
 Imaginary part = k_{1} + k_{2}.
This algorithm uses only three multiplications, rather than four, and five additions or subtractions rather than two. If a multiply is more expensive than three adds or subtracts, as when calculating by hand, then there is a gain in speed. On modern computers a multiply and an add can take about the same time so there may be no speed gain. There is a tradeoff in that there may be some loss of precision when using floating point.
For fast Fourier transforms the complex multiplies involve constant 'twiddle' factors and two of the adds can be precomputed. Only three multiplies and three adds are required, and modern hardware can often overlap multiplies and adds.
Karatsuba multiplication
Main article: Karatsuba algorithmFor systems that need to multiply numbers in the range of several thousand digits, such as computer algebra systems and bignum libraries, long multiplication is too slow. These systems may employ Karatsuba multiplication, which was discovered in 1960 (published in 1962). The heart of Karatsuba's method lies in the observation that twodigit multiplication can be done with only three rather than the four multiplications classically required. Suppose we want to multiply two 2digit numbers: x_{1}x_{2}· y_{1}y_{2}:
 compute x_{1} · y_{1}, call the result A
 compute x_{2} · y_{2}, call the result B
 compute (x_{1} + x_{2}) · (y_{1} + y_{2}), call the result C
 compute C − A − B, call the result K; this number is equal to x_{1} · y_{2} + x_{2} · y_{1}
 compute A · 100 + K · 10 + B.
Bigger numbers x_{1}x_{2} can be split into two parts x_{1} and x_{2}. Then the method works analogously. To compute these three products of mdigit numbers, we can employ the same trick again, effectively using recursion. Once the numbers are computed, we need to add them together (step 5.), which takes about n operations.
Karatsuba multiplication has a time complexity of O(n^{log23}). The number log_{2}3 is approximately 1.585, so this method is significantly faster than long multiplication. Because of the overhead of recursion, Karatsuba's multiplication is slower than long multiplication for small values of n; typical implementations therefore switch to long multiplication if n is below some threshold.
Later the Karatsuba method was called ‘divide and conquer’, the other names of this method, used at the present, are ‘binary splitting’ and ‘dichotomy principle’.
The appearance of the method ‘divide and conquer’ was the starting point of the theory of fast multiplications. A number of authors (among them Toom, Cook and Schönhage) continued to look for an algorithm of multiplication with the complexity close to the optimal one, and 1971 saw the construction of the Schönhage–Strassen algorithm, which maintained the best known (until 2007) upper bound for M(n).
The Karatsuba ‘divide and conquer’ is the most fundamental and general fast method. Hundreds of different algorithms are constructed on its basis. Among these algorithms the most well known are the algorithms based on Fast Fourier Transform (FFT) and Fast Matrix Multiplication.
Toom–Cook
Main article: Toom–Cook multiplicationAnother method of multiplication is called Toom–Cook or Toom3. The Toom–Cook method splits each number to be multiplied into multiple parts. The Toom–Cook method is one of the generalizations of the Karatsuba method. A threeway Toom–Cook can do a sizeN^{3} multiplication for the cost of five sizeN multiplications, improvement by a factor of 9/5 compared to the Karatsuba method's improvement by a factor of 4/3.
Although using more and more parts can reduce the time spent on recursive multiplications further, the overhead from additions and digit management also grows. For this reason, the method of Fourier transforms is typically faster for numbers with several thousand digits, and asymptotically faster for even larger numbers.
Fourier transform methods
The idea, due to Strassen (1968), is the following: We choose the largest integer w that will not cause overflow during the process outlined below. Then we split the two numbers into m groups of w bits
We can then say that
by setting b_{j} = 0 and a_{i} = 0 for j, i > m, k = i + j and {c_{k}} as the convolution of {a_{i}} and {b_{j}}. Using the convolution theorem ab can be computed by
 Computing the fast Fourier transforms of {a_{i}} and {b_{j}},
 Multiplying the two results entry by entry,
 Computing the inverse Fourier transform and
 Adding the part of c_{k} that is greater than 2^{w} to c_{k+1}.
The Schönhage–Strassen algorithm, described in 1971 by Schönhage and Strassen, has a time complexity of Θ(n log(n) log(log(n))) and is used in practice for numbers with more than 10,000 to 40,000 decimal digits. In 2007 this was improved by Martin Fürer (Fürer's algorithm) to give a time complexity of n log(n) 2^{Θ(log*(n))} using Fourier transforms over complex numbers. Anindya De, Chandan Saha, Piyush Kurur and Ramprasad Saptharishi^{[11]} gave a similar algorithm using modular arithmetic in 2008 achieving the same running time. However, these latter algorithms are only faster than Schönhage–Strassen for impractically large inputs.
Using numbertheoretic transforms instead of discrete Fourier transforms avoids rounding error problems by using modular arithmetic instead of floatingpoint arithmetic.
FFTbased algorithms multiply polynomials, not numbers. But it is trivial to convert a number to the corresponding polynomial and then restore resulting number from the polynomial.
Linear time multiplication
Knuth^{[12]} describes computational models in which two nbit numbers can be multiplied in linear time. The most realistic of these requires that any memory location can be accessed in constant time (the socalled RAM model). The approach is to use the FFT based method described above, packing log n bits into each coefficient of the polynomials and doing all computations with 6 log n bits of accuracy. The time complexity is now O( nM ) where M is the time needed to multiply two log n  bit numbers. By precomputing a linear size multiplication lookup table of all pairs of numbers of (log n)/2 bits, M is simply the time needed to perform a constant number of table lookups. If one assumes this takes constant time per table lookup as is true in the unitcost word RAM model, then the overall algorithm is linear time.
Lower bounds
There is a trivial lower bound of Ω(n) for multiplying two nbit numbers on a single processor; no matching algorithm (on conventional Turing machines) nor any better lower bound is known. Multiplication lies outside of AC^{0}[p] for any prime p, meaning there is no family of constantdepth, polynomial (or even subexponential) size circuits using AND, OR, NOT, and MOD_{p} gates that can compute a product. This follows from a constantdepth reduction of MOD_{q} to multiplication.^{[13]} Lower bounds for multiplication are also known for some classes of branching programs.^{[14]}
Polynomial multiplication
All the above multiplication algorithms can also be expanded to multiply polynomials. For instance the Strassen algorithm may be used for polynomial multiplication^{[15]}
See also
 Binary multiplier
 Division (digital)
 Logarithm
 Mental calculation
 Prosthaphaeresis
 Slide rule
 Trachtenberg system
 Horner scheme for evaluation of a polynomial
References
 ^ Gary Eason, Back to school for parents, BBC News, 13 February 2000
Rob Eastaway, Why parents can't do maths today, BBC News, 10 September 2010  ^ Richard P. Brent. A Fortran MultiplePrecision Arithmetic Package. Australian National University. March 1978.
 ^ Lam Lay Yong, Ang Tian Se, Fleeting Footsteps,P141, Evidence of Chinese origin, World Scientific ISBN 9810236964
 ^ Corlu, M. S., Burlbaw, L. M., Capraro, R. M., Corlu, M. A.,& Han, S. (2010). The Ottoman Palace School Enderun and The Man with Multiple Talents, Matrakçı Nasuh. Journal of the Korea Society of Mathematical Education Series D: Research in Mathematical Education. 14(1), pp. 19–31.
 ^ "Novel Methods of Integer Multiplication and Division" by G. ReichbornKjennerud
 ^ "Reviews". The Civil Engineer and Architect's journal: 54–55. 1857. http://books.google.com/books?id=gcNAAAAAcAAJ&pg=PA54#v=onepage&f=false.
 ^ Holmes, Neville (2003). "Multiplying with quarter squares". The Mathematical Gazette 87 (509): 296–299. JSTOR 3621048.
 ^ Everett L., Johnson (March, 1980), "A Digital Quarter Square Multiplier", IEEE Transactions on Computers (Washington, DC, USA: IEEE Computer Society) C29 (3): 258–261, doi:10.1109/TC.1980.1675558, ISSN 00189340, http://www2.computer.org/portal/web/csdl/doi/10.1109/TC.1980.1675558, retrieved 20090326
 ^ Judd, Steven (Jan, 1995), C=Hacking (9), http://www.ffd2.com/fridge/chacking/c=hacking9.txt
 ^ Knuth, Donald E. (1988), The Art of Computer Programming volume 2: Seminumerical algorithms, AddisonWesley, pp. 519, 706
 ^ Anindya De, Piyush P Kurur, Chandan Saha, Ramprasad Saptharishi. Fast Integer Multiplication Using Modular Arithmetic. Symposium on Theory of Computation (STOC) 2008.
 ^ Knuth, Donald E. (1997), The Art of Computer Programming volume 2: Seminumerical algorithms, AddisonWesley, pp. 311
 ^ Sanjeev Arora and Boaz Barak, Computational Complexity: A Modern Approach, Cambridge University Press, 2009.
 ^ Farid Ablayev and Marek Karpinski, A lower bound for integer multiplication on randomized ordered readonce branching programs, Information and Computation 186 (2003), 78–89.
 ^ "Strassen algorithm for polynomial multiplication". Everything2. http://everything2.com/title/Strassen+algorithm+for+polynomial+multiplication.
External links
Basic arithmetic
 The Many Ways of Arithmetic in UCSMP Everyday Mathematics
 A Powerpoint presentation about ancient mathematics
 Lattice Multiplication Flash Video
Advanced algorithms
Primality tests AKS · APR · Baillie–PSW · ECPP · Elliptic curve · Pocklington · Fermat · Lucas · Lucas–Lehmer · Lucas–Lehmer–Riesel · Proth's theorem · Pépin's · Solovay–Strassen · Miller–Rabin · Trial divisionSieving algorithms Integer factorization algorithms CFRAC · Dixon's · ECM · Euler's · Pollard's rho · p − 1 · p + 1 · QS · GNFS · SNFS · rational sieve · Fermat's · Shanks' square forms · Trial division · Shor'sMultiplication algorithms Ancient Egyptian multiplication · Karatsuba algorithm · Toom–Cook multiplication · Schönhage–Strassen algorithm · Fürer's algorithmDiscrete logarithm algorithms Babystep giantstep · Pollard rho · Pollard kangaroo · Pohlig–Hellman · Index calculus · Function field sieveGCD algorithms Modular square root algorithms Cipolla · Pocklington's · Tonelli–ShanksOther algorithms Italics indicate that algorithm is for numbers of special forms; bold indicates deterministic algorithm for primality tests (current article is always in bold).Categories: Arbitrary precision algorithms
 Multiplication

Wikimedia Foundation. 2010.
Look at other dictionaries:
Booth's multiplication algorithm — is a multiplication algorithm that multiplies two signed binary numbers in two s complement notation.ProcedureBooth s algorithm involves repeatedly adding one of two predetermined values A and S to a product P , then performing a rightward… … Wikipedia
Multiplication — Multiply redirects here. For other uses, see Multiplication (disambiguation). For methods of computing products, including those of very large numbers, see Multiplication algorithm. Four bags of three marbles gives twelve marbles. There are also… … Wikipedia
Multiplication ALU — In digital design, a multiplier or multiplication ALU is a hardware circuit dedicated to multiplying two binary values. A variety of techniques can be used to implement a digital multiplier. Most techniques involve computing a set of partial… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
SchönhageStrassen algorithm — The Schönhage Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. [A. Schönhage and V. Strassen, Schnelle Multiplikation großer Zahlen ,… … Wikipedia
Kochanski multiplication — [M.J. Kochanski, Developing an RSA Chip , in Advances in Cryptology: Proceedings of CRYPTO 85 , Springer Verlag, Berlin (1985), 3 540 16463 4.] is an algorithm that allows modular arithmetic (multiplication or operations based on it, such as… … Wikipedia
Strassen algorithm — In the mathematical discipline of linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm used for matrix multiplication. It is asymptotically faster than the standard matrix multiplication algorithm, but slower than… … Wikipedia
Karatsuba algorithm — The Karatsuba multiplication algorithm, a technique for quickly multiplying large numbers, was discovered by Anatolii Alexeevich Karatsuba in 1960 and published in the joint paper with Yu. Ofman in 1962. It reduces the multiplication of two n… … Wikipedia
Toom–Cook multiplication — Toom–Cook, sometimes known as Toom 3, named after Andrei Toom and Stephen Cook, is a multiplication algorithm, a method of multiplying two large integers.Given two large integers, a and b , Toom–Cook splits up a and b into k smaller parts each of … Wikipedia
Fürer's algorithm — is an integer multiplication algorithm for very large numbers possessing a very low asymptotic complexity. It was created in 2007 by Martin Fürer of Pennsylvania State UniversityFuhrer, M. (2007). Faster Integer Multiplication in Proceedings of… … Wikipedia