Skip to main content

Module tables

Module tables 

Source
Expand description

The literal tables of Chapter 11.11 (private). Every double-double entry is the pair (RN(c), RN(c โˆ’ RN(c))) of the value c named in the comment of its table, as the bits (hi, lo); every f64 is the value named, rounded to nearest. They were generated with dashu-float at 2 400 bits and are checked entry by entry, bit for bit, by the unit test tables_are_the_nearest_double_doubles of the parent module against two independent oracles.

Constantsยง

ATAN_C ๐Ÿ”’
atan(c) for c = 2^e (1 + (2i + 1)/32), e = โˆ’6, โ€ฆ, 2, i = 0, โ€ฆ, 15 (index 16(e + 6) + i; Algorithm T).
EXP2_64 ๐Ÿ”’
2^(j/64), j = 0, โ€ฆ, 63 (Algorithm E).
EXP2_64_M1 ๐Ÿ”’
2^(j/64) โˆ’ 1, j = 0, โ€ฆ, 63 (Algorithm M, large arguments).
EXPM1_64 ๐Ÿ”’
e^(N/64) โˆ’ 1, N = โˆ’31, โ€ฆ, 31 (index N + 31; Algorithm M, small arguments).
FRAC_3PI_4 ๐Ÿ”’
3ฯ€/4 (the special case atan2(ยฑโˆž, โˆ’โˆž)).
INV_FACT ๐Ÿ”’
1/n!, n = 0, โ€ฆ, 33.
INV_INT ๐Ÿ”’
1/n, n = 1, โ€ฆ, 41 (entry 0 unused).
INV_LN2_64 ๐Ÿ”’
RN(64 / ln 2): only chooses the index N of Algorithm E (any nearby value works).
LN2_64 ๐Ÿ”’
ln 2 / 64 in three parts of 53 bits: RN(c), RN(c โˆ’ pโ‚), RN(c โˆ’ pโ‚ โˆ’ pโ‚‚) (Algorithm E).
LN2_SPLIT ๐Ÿ”’
ln 2 in three parts: A rounded to 42 bits (so that eยทA is exact for |e| < 2ยนยน), then RN(ln 2 โˆ’ A), RN(ln 2 โˆ’ A โˆ’ B) (Algorithm L, step L6).
LN_2C ๐Ÿ”’
ln(2(1 + j/64)), j = โˆ’18, โ€ฆ, 0 (index j + 18; Algorithm L, e = 1, y < 1).
LN_C ๐Ÿ”’
ln(1 + j/64), j = โˆ’18, โ€ฆ, 26 (index j + 18; Algorithm L).
LN_C_2 ๐Ÿ”’
ln((1 + j/64)/2), j = 0, โ€ฆ, 26 (Algorithm L, e = โˆ’1, y โ‰ฅ 1).
PI_OVER_4 ๐Ÿ”’
โŒŠ2^320 ยท ฯ€/4โŒ‹, big-endian 64-bit words (Algorithm R).
TWO_OVER_PI ๐Ÿ”’
โŒŠ2^1408 ยท 2/ฯ€โŒ‹, big-endian 64-bit words: bit i of 2/ฯ€ (weight 2^โˆ’i) is bit 1408 โˆ’ i of the integer (Algorithm R).