The art of computer programming. Volume 2, Seminumerical algorithms

La couverture porte : "The classic work newly updated and revised."
Glossaire.
Includes index.

3. Random Numbers. Introduction. Generating Uniform Random Numbers. The Linear Congruential Method. Other Methods. Statistical Tests. General Test Procedures for Studying Random Data. Empirical Tests. Theoretical Tests. The Spectral Test. Other Types of Random Quantities. Numerical Distributions. Random Sampling and Shuffling. What Is a Random Sequence? Summary. 4. Arithmetic. Positional Number Systems. Floating Point Arithmetic. Single-Precision Calculations. Accuracy of Floating Point Arithmetic. Double-Precision Calculations. Distribution of Floating Point Numbers. Multiple Precision Arithmetic. The Classical Algorithms. Modular Arithmetic. How Fast Can We Multiply? Radix Conversion. Rational Arithmetic. Fractions. The Greatest Common Divisor. Analysis of Euclid's Algorithm. Factoring into Primes. Polynomial Arithmetic. Division of Polynomials. Factorization of Polynomials. Evaluation of Powers. Evaluation of Polynomials. Manipulation of Power Series. Answers to Exercises. Appendix A. Tables of Numerical Quantities. Fundamental Constants (decimal). Fundamental Constants (octal). Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B. Index to Notations. Index and Glossary. 0201896842T03062003

Offers an introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. This book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis, and a fresh treatment of random number generators.