bits

SearchAdvancedHelp

(0.001 seconds)

9 matching pages

1: 3.1 Arithmetics and Error Measures

… ►A nonzero normalized binary floating-point machine number $x$ is represented as …where $s$ is equal to $1$ or $0$, each $b_j$, $j\ge 1$, is either $0$ or $1$, $b_1$ is the most significant bit, $p$ ($\in \mathbb{N}$) is the number of significant bits $b_j$, $b_{p-1}$ is the least significant bit, $E$ is an integer called the exponent, $b_0.b_1{b}_2\mathrm{\dots }{b}_{p-1}$ is the significand, and $f=\mathrm{.}{b}_1{b}_2\mathrm{\dots }{b}_{p-1}$ is the fractional part. … ►

3.1.2 $${(-1)}^s{2}^E\sum _{j=0}^{p-1}{b}_j{2}^{-j},$$

ⓘ

Symbols:

$b_p$: bit, $s$: sign, $p$: number of significant bits and $E$: exponent

Permalink:

http://dlmf.nist.gov/3.1.E2

Encodings:

pMML, png, TeX

See also:

Annotations for §3.1(i), §3.1 and Ch.3

… ► … ►For given values of $E_{\min }$, $E_{\max }$, and $p$, the format width in bits $N$ of a computer word is the total number of bits: the sign (one bit), the significant bits $b_1,b_2,\mathrm{\dots },b_{p-1}$ ($p-1$ bits), and the bits allocated to the exponent (the remaining $N-p$ bits). …

2: Bibliography Z

… ►

Fast evaluation of elementary mathematical functions with correctly rounded last bit. ACM Trans. Math. Software 17 (3), pp. 410–423.

ⓘ

External Links:

ISSN 0098-3500, Document, ZentralBlatt

Referenced by:

§4.45(i).

Encodings:

BibTeX

…

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.

ⓘ

External Links:

MathReview, ZentralBlatt

Referenced by:

§4.23(iv), §4.37(iv).

Encodings:

BibTeX

… ►

On Nielsen’s generalized polylogarithms and their numerical calculation. Nordisk Tidskr. Informationsbehandling (BIT) 10, pp. 38–73.

ⓘ

External Links:

Document, MathReview (M. Nassif), ZentralBlatt

Referenced by:

§25.12(i).

Encodings:

BibTeX

…

4: Bibliography J

… ►

On the numerical calculation of polylogarithms. Nordisk Tidskr. Informationsbehandling (BIT) 12 (4), pp. 581–585.

ⓘ

External Links:

Document, MathReview, ZentralBlatt

Referenced by:

§25.18(i).

Encodings:

BibTeX

…

5: Bibliography G

… ►

How and how not to check Gaussian quadrature formulae. BIT 23 (2), pp. 209–216.

ⓘ

External Links:

ISSN 0006-3835, Document, MathReview (G. A. Evans), ZentralBlatt

Referenced by:

§18.40(ii), §3.5(v), §9.17(iii).

Encodings:

BibTeX

… ►

Computation of Bessel and Airy functions and of related Gaussian quadrature formulae. BIT 42 (1), pp. 110–118.

ⓘ

External Links:

ISSN 0006-3835, Document, MathReview (Khélifa Trimèche), ZentralBlatt

Referenced by:

§10.74(iii), §9.17(iii).

Encodings:

BibTeX

…

6: Bibliography P

… ►

Modified Clenshaw-Curtis method for the computation of Bessel function integrals. BIT 23 (3), pp. 370–381.

ⓘ

External Links:

ISSN 0006-3835, Document, MathReview (H. E. Fettis), ZentralBlatt

Referenced by:

§10.74(vii).

Encodings:

BibTeX

…

7: Bibliography W

… ►

Fast construction of the Fejér and Clenshaw-Curtis quadrature rules. BIT 46 (1), pp. 195–202.

ⓘ

External Links:

ISSN 0006-3835, Document, MathReview Entry, ZentralBlatt

Referenced by:

§3.5(iv).

Encodings:

BibTeX

…

8: Bibliography L

… ►

Highly accurate tables for elementary functions. BIT 35 (3), pp. 352–360.

ⓘ

External Links:

ISSN 0006-3835, Document, MathReview, ZentralBlatt

Referenced by:

§4.45(i), §4.46.

Encodings:

BibTeX

…

9: Bibliography M

… ►

Contribution no. 14. The Riemann zeta function. BIT 5, pp. 138–141.

ⓘ

Referenced by:

§25.21(ii).

Encodings:

BibTeX

…