000			03258nam a22002057a 4500
008			240606b |||||||| |||| 00| 0 eng d
020			_a9780201896848
082			_a005.1 KNU
100			_aKnuth, Donald Ervin _911069
245			_aThe art of computer programming: seminumerical algorithms, volume 2
250			_a3rd ed.
260			_aBoston _bAddison-Wesley _c1998
300			_axiii, 764p. _bhb.
500			_ahttps://www.pearson.com/en-us/subject-catalog/p/art-of-computer-programming-volume-2-seminumerical-algorithms/P200000000379/9780321635761
520			_aThe bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. –Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. –Charles Long If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. –Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. –Jonathan Laventhol The second volume offers a complete introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. The book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis. Particularly noteworthy in this third edition is Knuth's new treatment of random number generators, and his discussion of calculations with formal power series. 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.
650			_aComputer science
650			_aComputer Programming
650			_aComputer Algorithms
942			_cBK
999			_c10250 _d10250