Schrage's Algorithm

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediateslarger than 32 bits. It is also useful in certain types of Random Number generators.

References

Bratley, P.; Fox, B. L.; and Schrage, E. L. A Guide to Simulation, 2nd ed. New York: Springer-Verlag, 1996.

Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. ``Random Numbers.'' Ch. 7 in Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed. Cambridge, England: Cambridge University Press, p. 269, 1992.

Schrage, L. ``A More Portable Fortran Random Number Generator.'' ACM Trans. Math. Software 5, 132-138, 1979.

• Point Estimator
• Point Groups
• Point-Line Distance--2-D
• Point-Line Distance--3-D
• Point Picking
• Point-Plane Distance
• Point-Point Distance--1-D
• Point-Point Distance--2-D
• Point-Point Distance--3-D
• Point Probability
• Point-Quadratic Distance
• Point-Set Topology
• Points Problem
• Pointwise Dimension
• Poisson Bracket
• Poisson-Charlier Function
• Poisson-Charlier Polynomial
• Poisson Distribution
• Poisson Integral
• Poisson Integral Representation
• Poisson Kernel
• Poisson Manifold
• Poisson's Bessel Function Formula
• Poisson's Equation
• Poisson's Harmonic Function Formula