The Art of Computer Programming: Seminumerical algorithms. Random numbers ; ArithmeticAddison-Wesley, 1997 - Computer algorithms This first volume begins with basic programming concepts and techniques, then focuses on information structures--the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. |
From inside the book
Try this search over all volumes: eld
Results 1-0 of 0
Contents
Chapter 3 Random Numbers | 1 |
Chapter 4 Arithmetic | 194 |
Answers to Exercises | 538 |
Copyright | |
2 other sections not shown
Other editions - View all
The Art of Computer Programming: Seminumerical Algorithms, Volume 2 Donald E. Knuth Limited preview - 2014 |
Common terms and phrases
a₁ addition chain approximately assume b₁ binary bits calculation coefficients Comp compute consider continued fraction decimal defined digits discussed distribution divide division elements equation Euclid's algorithm evaluate example exercise exponent floating point floating point numbers formula function given greatest common divisor hence Horner's rule input irreducible irreducible polynomials iterations Lemma linear congruential linear congruential sequence m₁ Math matrix method modulo multiplication multisets nonnegative nonzero normal notation number system obtain operations output overflow period length permutation positive integers possible prime factors primitive polynomial probability problem proof prove quotient radix radix point random number real numbers relatively prime representation result satisfies Section solution spectral test step subroutine subtraction Theorem tijk two's complement U₁ unique factorization domain V₁ variables vectors Xn+1 Y₁ zero