Introduction Uniform Distribution Classical Examples Construction Irreducible Polynomials Numerical Integraion Pricing Theory References

 

Application to Numerical Integration

Monte Carlo techniques are methods to calculate a numerical quantity by casting it into a stochastic framework and applying repeated simulation using pseudorandom numbers. The expectation E[X] of a random variable X is approximated by a sample mean. In practice, the uniform distribution is sampled by pseudo-random sequences which are then transformed to the law of [Graphics:../Images/QRDemonstration_gr_362.gif].
Quasi-Monte Carlo techniques replace pseudo-random sequences with low-discrepancy sequences which have a more uniform behaviour. In a certain sense, Quasi-Monte Carlo methods combine the advantages of Monte Carlo and uniform lattice methods. In particular, less quasi-random samples are needed to achieve a similar level of accuracy as obtained by using pseudo-random sequeces.

We consider a test integrand.

[Graphics:../Images/QRDemonstration_gr_363.gif]

Mathematica can symbolically integrate such functions and obtains an exact value:

[Graphics:../Images/QRDemonstration_gr_364.gif]
[Graphics:../Images/QRDemonstration_gr_365.gif]

First we convert the 3-dimensional Niederreiter sequence in base 3 calculated before as rationals to real numbers. This is just to speed up calculation.

[Graphics:../Images/QRDemonstration_gr_366.gif]
[Graphics:../Images/QRDemonstration_gr_367.gif]

Now we build the sample average over the 1000 samples to approximate the integral:

[Graphics:../Images/QRDemonstration_gr_368.gif]
[Graphics:../Images/QRDemonstration_gr_369.gif]

Converted by Mathematica November 18, 1998

 

 

Introduction Uniform Distribution Classical Examples Construction Irreducible Polynomials Numerical Integraion Pricing Theory References