FFT Multiplication (GNU MP 6.3.0) - gmplib.org
The threshold determinations currently measure at the mid-points of size steps, but this is sub-optimal since at the start of a new step it can happen that it’s better to go back to the previous k for a while. …
Karatsuba Multiplication (GNU MP 6.3.0) - gmplib.org
The factor 3/4 for a means per-crossproduct speedups in the basecase code will increase the threshold since they benefit M (N) more than K (N). And conversely the 3/2 for b means linear style speedups …
Toom 3-Way Multiplication (GNU MP 6.3.0) - gmplib.org
MUL_TOOM33_THRESHOLD is a somewhat arbitrary point in that range and successive runs of the tune program can give different values due to small variations in measuring. A graph of time versus …
MUL_TOOM22_THRESHOLD - gmplib.org
MUL_TOOM22_THRESHOLD
MUL_TOOM44_THRESHOLD - gmplib.org
MUL_TOOM44_THRESHOLD
MUL_TOOM33_THRESHOLD - gmplib.org
MUL_TOOM33_THRESHOLD
MUL_TOOM6H_THRESHOLD - gmplib.org
Jun 15, 2025 · Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved.
Unbalanced Multiplication (GNU MP 6.2.1) - gmplib.org
Multiplication of operands with different sizes, both below MUL_TOOM22_THRESHOLD are done with plain schoolbook multiplication (see Basecase Multiplication). For really large operands, we invoke …
Divide and Conquer Division (GNU MP 6.3.0) - gmplib.org
15.2.3 Divide and Conquer Division For divisors larger than DC_DIV_QR_THRESHOLD, division is done by dividing. Or to be precise by a recursive divide and conquer algorithm based on work by …
GET_STR_DC_THRESHOLD - gmplib.org
Verbatim copying and distribution of this entire article is permitted in any medium, provided this notice is preserved.