Home | History | Annotate | Download | only in builtins

Lines Matching refs:reciprocal

80     // [1, 2.0) and get a Q32 approximate reciprocal using a small minimax
81 // polynomial approximation: reciprocal = 3/4 + 1/sqrt(2) - b/2. This
86 // Now refine the reciprocal estimate using a Newton-Raphson iteration:
110 uint64_t correction, reciprocal;
114 reciprocal = (uint64_t)recip32*cHi + ((uint64_t)recip32*cLo >> 32);
117 // 64-bit reciprocal estimate downward to ensure that it is strictly smaller
118 // than the infinitely precise exact reciprocal. Because the computation
121 reciprocal -= 2;
123 // The numerical reciprocal is accurate to within 2^-56, lies in the
124 // interval [0.5, 1.0), and is strictly smaller than the true reciprocal
125 // of b. Multiplying a by this reciprocal thus gives a numerical q = a/b
136 wideMultiply(aSignificand << 2, reciprocal, &quotient, &quotientLo);