The Art of Computer Programming, Volume 2: Seminumerical Algorithms
by Donald E. Knuth
The Art of Computer Programming (2)
On This Page
Description
The 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 show more 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. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http://msp.org show lessTags
Recommendations
Member Reviews
Difficult, instructive, intelligent, amusing and brain-numbing - all rolled-in-to-one in this classic of CS. Buy it, read a page at a sitting and savor it - this is a book read over 5 years.
I used this volume less than Fundamental Algorithms, and Sorting and Searching, but it still saved me hours and hours of work, more than once.
Indeholder "Preface", "Preface to the Second Edition", "Notes on the Exercises", "Chapter 3. Random Numbers", " 3.1. Introduction", " 3.2. Generating Uniform Random Numbers", " 3.2.1. The Linear Congruential Method", " 3.2.1.1. Choice of modulus", " 3.2.1.2. Choice of multiplier", " 3.2.1.3. Potency", " 3.2.2. Other Methods", " 3.3. Statistical Tests", " 3.3.1. General Test Procedures for Studying Random Data", " 3.3.2. Empirical Tests", " 3.3.3* Theoretical Tests", " 3.3.4. The Spectral Test", " 3.4. Other Types of Random Quantities", " 3.4.1. Numerical Distributions", " 3.4.2. Random Sampling and Shuffling", " 3.5* What Is a Random Sequence?", " 3.6. Summary", "Chapter 4. Arithmetic", " 4.1. Positional Number Systems", " 4.2. Floating show more Point Arithmetic", " 4.2.1. Single-Precision Calculations", " 4.2.2. Accuracy of Floating Point Arithmetic", " 4.2.3* Double-Precision Calculations", " 4.2.4. Distribution of Floating Point Numbers", " 4.3. Multiple Precision Arithmetic", " 4.3.1. The Classical Algorithms", " 4.3.2* Modular Arithmetic", " 4.3.3* How Fast Can We Multiply?", " 4.4. Radix Conversion", " 4.5. Rational Arithmetic", " 4.5.1. Fractions", " 4.5.1. The Greatest Common Divisor", " 4.5.3* Analysis of Euclid's Algorithm", " 4.5.1. Factoring into Primes", " 4.6. Polynomial Arithmetic", " 4.6.1. Division of Polynomials", " 4.6.2* Factorization of Polynomials", " 4.6.3. Evaluation of Powers", " 4.6.4. Evaluation of Polynomials", " 4.7* Manipulation of Power Series", "Answers to Exercises", "Appendix A. Tables of Numerical Quantities", " 1. Fundamental Constants (decimal)", " 2. Fundamental Constants (octal)", " 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers", "Appendix B. Index to Notations", "Index and Glossary".
Mesteren selv fortæller hvordan man bør programmere. Heldigvis har folkene bag Mathematica, Maple og lignende programmer læst på lektien, så vi andre ikke behøver være helt så skarpe. show less
Mesteren selv fortæller hvordan man bør programmere. Heldigvis har folkene bag Mathematica, Maple og lignende programmer læst på lektien, så vi andre ikke behøver være helt så skarpe. show less
Nov 8, 2016 (Edited)Danish
Ratings
Members
- Recently Added By
Lists
Well-Made Math Books
11 works; 2 members
Author Information

81 Works 9,646 Members
Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the TEX and METAFONT systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the show more completion of these fascicles and the seven volumes to which they belong. show less
Series
Common Knowledge
- Canonical title
- The Art of Computer Programming, Volume 2: Seminumerical Algorithms
- Original publication date
- 1969
Classifications
- Genres
- Technology, Nonfiction, General Nonfiction
- DDC/MDS
- 005.1 — Computer science, information & general works Computer science, knowledge & systems Artificial Intelligence/Virtual Reality Software development
- LCC
- QA76.6 .K64 — Science Mathematics Mathematics Instruments and machines Calculating machines Electronic computers. Computer science
- BISAC
Statistics
- Members
- 1,125
- Popularity
- 22,438
- Reviews
- 3
- Rating
- (4.54)
- Languages
- 7 — English, French, German, Hungarian, Japanese, Polish, Russian
- Media
- Paper, Ebook
- ISBNs
- 12
- UPCs
- 1
- ASINs
- 6



















































