Numerical Computing with IEEE Floating Point Arithmetic: Including One Theorem, One Rule of Thumb, and One Hundred and One ExercisesSociety for Industrial and Applied Mathematics, 2001 - 104 lappuses This title provides an easily accessible yet detailed discussion of IEEE Std 754-1985, arguably the most important standard in the computer industry. The result of an unprecedented cooperation between academic computer scientists and the cutting edge of industry, it is supported by virtually every modern computer. Other topics include the floating point architecture of the Intel microprocessors and a discussion of programming language support for the standard. |
No grāmatas satura
1.–3. rezultāts no 40.
12. lappuse
... decimal expansion of the number - hence the name floating point . For representation on the computer , we prefer base 2 to base 10 , so we write a nonzero number x in the form x = ± S × 2E , where 1 S < 2 . Consequently , the binary ...
... decimal expansion of the number - hence the name floating point . For representation on the computer , we prefer base 2 to base 10 , so we write a nonzero number x in the form x = ± S × 2E , where 1 S < 2 . Consequently , the binary ...
14. lappuse
... number x does not have a finite binary expansion , we must terminate its expansion somewhere . For example , consider the number = 1/10 ( 0.0001100110011 ... ) 2 . If we truncate this to 23 bits after the binary point , we obtain ...
... number x does not have a finite binary expansion , we must terminate its expansion somewhere . For example , consider the number = 1/10 ( 0.0001100110011 ... ) 2 . If we truncate this to 23 bits after the binary point , we obtain ...
37. lappuse
... number of nonzero bits to the left of the binary point of ( the binary representation for ) U ? What does this tell you about how many bits it may be necessary to shift the binary point of U left or right to normalize the result ? 2 ...
... number of nonzero bits to the left of the binary point of ( the binary representation for ) U ? What does this tell you about how many bits it may be necessary to shift the binary point of U left or right to normalize the result ? 2 ...
Saturs
Computer Representation of Numbers | 9 |
Rounding | 25 |
Exceptions | 41 |
Autortiesības | |
3 citas sadaļas nav parādītas.
Citi izdevumi - Skatīt visu
Numerical Computing with IEEE Floating Point Arithmetic Michael L. Overton Ierobežota priekšskatīšana - 2001 |
Numerical computing with IEEE floating point arithmetic Michael L. Overton Ierobežota priekšskatīšana - 2001 |
Numerical computing with IEEE floating point arithmetic Michael L. Overton Ierobežota priekšskatīšana - 2001 |
Bieži izmantoti vārdi un frāzes
2's complement absolute rounding error accurate algorithm answer approximately binary point binary representation bitstring bytes cancellation Chapter compiler condition number conversion decimal digits destination format difference quotient division by zero double format double precision evaluating exact result example Exercise exp(x exponent exponential extended format finite floating point arithmetic floating point number floating point system format code format floating point Fortran gradual underflow guard bit hardware hidden bit IEEE arithmetic IEEE floating point IEEE single format IEEE standard implement integer overflow Intel Kahan library functions loop machine epsilon math library MATLAB microprocessors newsum Nmax Nmin normalized range numerical computing output overflow physical register precision mode printf Program 9 R₁ rational numbers real number represented requires round to nearest round(x rounding mode significand significant digits single format floating single format number single precision standard response status flags stored subnormal numbers Table term