The Art of Computer Programming: Seminumerical algorithmsV.1 - Fundamentals algorithms: Basic concepts. Algorithms. Mathematical preliminaries. MIX. Some fundamental programming techniques. Information structures. Linear lists. Trees. Multilinked structures. Dynamic storage allocation. History and bibliography. Random numbers. Generating uniform random numbers. Statistical tests. Other types of random quantities. What is a random sequence? Summary. Arithmetic. Positional number systems. Floating-point arithmetic. Multiple-precision arithmetic. Radix conversion. Rational arithmetic. Polynomial arithmetic. Manipulation of power series. v. 2. Seminumerical algorithms. Random numbers. Arithmetic. |
Contents
Chapter 3Random Numbers | 1 |
Chapter 4Arithmetic | 178 |
Answers to Exercises | 516 |
Copyright | |
2 other sections not shown
Other editions - View all
Common terms and phrases
a₁ addition chain approximately assume average b₁ balanced ternary binary bits calculation chi-square coefficients consider continued fraction decimal defined definition digits discussed distribution divide division elements equal equation Euclid's algorithm evaluate example exercise exponent floating point numbers formula function gcd(u given greatest common divisor hence Horner's rule input integers irreducible irreducible polynomials Lemma linear congruential linear congruential sequence m₁ Math matrix method modulo multiplication multisets nonnegative nonzero normal notation number system obtained operations output overflow period length polynomial u(x positive integers possible prime factors primitive polynomial probability problem proof prove quantity radix radix point random number real numbers relatively prime representation result satisfy Section solution spectral test step subroutine subtraction tensor Theorem U₁ unique factorization domain V₁ vectors Xn+1 zero