|
1. Monte Carlo Methods and
Quasi-Monte Carlo Methods
Monte Carlo methods
Quasi-Monte Carlo methods
2. Quasi-Monte Carlo Methods for
Numerical Integration
Discrepancy
Error bounds
3. Low-Discrepancy Point Sets and
Sequences
Classical constructions
General discrepancy bounds
4. Nets and (t,s)-Sequences
Definitions and discrepancy bounds
Combinatorial connections
General construction principles
A special construction of nets
A special construction of (t,s)-sequences
5. Lattice Rules for Numerical
Integration
The method of good lattice points
Existence theorems for good lattice
points
General lattice rules and their
classification
Existence theorems for efficient
lattice rules
6. Quasi-Monte Carlo Methods for
Optimization
General theory of quasirandom search
methods
Low-dispersion point sets and
sequences
7. Random Numbers and Pseudorandom
Numbers
Random number generation
Pseudorandom numbers
Classical generators 8. Nonlinear Congruential
Pseudorandom Numbers
The general nonlinear congruential
method
The inversive congruential method
9. Shift-Register Pseudorandom
Numbers
The digital multistep method
The generalized feedback
shift-register (GFSR) method
10. Pseudorandom Vector Generation
The matrix method
Nonlinear methods |