bits
♦
9 matching pages ♦
(0.000 seconds)
9 matching pages
1: 3.1 Arithmetics and Error Measures
…
►A nonzero normalized binary floating-point machine number
is represented as
…where is equal to or , each , , is either or , is the most significant bit, () is the number of significant bits
, is the least significant bit, is an integer called the exponent, is the significand, and is the fractional
part.
…
►
3.1.2
…
►
…
►For given values of , , and , the format width in bits
of a computer word is the total number of bits: the sign (one bit), the significant bits
(
bits), and the bits allocated to the exponent (the remaining
bits).
…
2: Bibliography Z
…
►
Fast evaluation of elementary mathematical functions with correctly rounded last bit.
ACM Trans. Math. Software 17 (3), pp. 410–423.
…
3: Bibliography K
…
►
Branch Cuts for Complex Elementary Functions or Much Ado About Nothing’s Sign Bit.
In The State of the Art in Numerical Analysis (Birmingham, 1986), A. Iserles and M. J. D. Powell (Eds.),
Inst. Math. Appl. Conf. Ser. New Ser., Vol. 9, pp. 165–211.
…
►
On Nielsen’s generalized polylogarithms and their numerical calculation.
Nordisk Tidskr. Informationsbehandling (BIT) 10, pp. 38–73.
…
4: Bibliography J
…
►
On the numerical calculation of polylogarithms.
Nordisk Tidskr. Informationsbehandling (BIT) 12 (4), pp. 581–585.
…
5: Bibliography G
…
►
How and how not to check Gaussian quadrature formulae.
BIT 23 (2), pp. 209–216.
…
►
Computation of Bessel and Airy functions and of related Gaussian quadrature formulae.
BIT 42 (1), pp. 110–118.
…
6: Bibliography P
…
►
Modified Clenshaw-Curtis method for the computation of Bessel function integrals.
BIT 23 (3), pp. 370–381.
…
7: Bibliography W
…
►
Fast construction of the Fejér and Clenshaw-Curtis quadrature rules.
BIT 46 (1), pp. 195–202.
…
8: Bibliography L
…
►
Highly accurate tables for elementary functions.
BIT 35 (3), pp. 352–360.
…
9: Bibliography M
…
►
Contribution no. 14. The Riemann zeta function.
BIT 5, pp. 138–141.
…