Developer Reference

Contents

Mixture of Distributions

You can split the initial distribution into several simpler distributions:
 
In this case, random numbers for each of the distributions Fi(x) are easy to generate. An appropriate algorithm may be as follows:
  1. Generate a random number
    i
    with the probability
    pi
    .
  2. Generate a random number
    y
    (independent of
    i
    ) with the distribution
    Fi
    (
    x
    ).
  3. Accept
    y
    as a random number
    x
    with the distribution
    F
    (
    x
    ).
This technique is common in the acceptance/rejection method, when for the whole range of acceptable
x
values a density
g(x)
, which would approximate function
f(x)
well enough, is hard to find. In this case, the range is divided into sections so that
g(x)
looks relatively simple in each of the sub-ranges.
Note
Since quasi-random sequences are non-random, you should be careful when using quasi-random basic generators with the mixture methods. 

Product and Performance Information

1

Intel's compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instruction sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserved for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice.

Notice revision #20110804