Lines Matching defs:Multiplication
150 This will output a row of numbers that are increasing. Each column is a different test (such as addition, multiplication, etc)
975 \subsection{Multiplication by two}
1150 \chapter{Multiplication and Squaring}
1151 \section{Multiplication}
1152 A full signed integer multiplication can be performed with the following.
1158 specific multiplication routines optimized for given parameters. First there are the Toom-Cook multiplications which
1217 Since squaring can be performed faster than multiplication it is performed it's own function instead of just using
1225 Will square $a$ and store it in $b$. Like the case of multiplication there are four different squaring
1231 Both of the Toom-Cook and Karatsuba multiplication algorithms are faster than the traditional $O(n^2)$ approach that
1233 considerably less work. For example, a 10000-digit multiplication would take roughly 724,000 single precision
1271 good Karatsuba squaring and multiplication points. Then it proceeds to find Toom-Cook points. Note that the Toom-Cook
1408 Which calculates $a = R$ for the odd moduli $b$ without using multiplication or division.
