Lines Matching full:notes
45 | ALGORITHM and IMPLEMENTATION NOTES
53 | Notes: This will always generate one exception -- inexact.
64 | Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.
86 | Notes: The calculation in 2.2 is really performed by
106 | Notes: a) The way L1 and L2 are chosen ensures L1+L2 approximate
129 | Notes: a) In order to reduce memory access, the coefficients are
144 | Notes: 2^(J/64) is stored as T and t where T+t approximates
158 | Notes: If AdjFlag = 0, we have X = Mlog2 + Jlog2/64 + R,
176 | Notes: For non-zero X, the inexact exception will always be
194 | Notes: Refer to notes for 2.2 - 2.6.
202 | Notes: Exp(X) will surely overflow or underflow, depending on
215 | Notes: This will return X with the appropriate rounding
226 | Notes: The usual case should take the branches 1.1 -> 1.3 -> 2.
230 | see the notes on Step 1 of setox.
238 | Notes: See the notes on Step 2 of setox.
243 | Notes: Applying the analysis of Step 3 of setox in this case
249 | Notes: a) In order to reduce memory access, the coefficients are
264 | Notes: 2^(J/64) is stored as T and t where T+t approximates
282 | Notes: The various arrangements of the expressions give accurate
295 | Notes: The idea is to return "X - tiny" under the user
303 | Notes: a) In order to reduce memory access, the coefficients are
326 | Notes: 10.2 will always create an inexact and return -1 + tiny