Quasirandom Sequence

A sequence of -tuples that fills -space more uniformly than uncorrelated random points. Such a sequence is extremelyuseful in computational problems where numbers are computed on a grid, but it is not known in advance how fine the grid must beto obtain accurate results. Using a quasirandom sequence allows stopping at any point where convergence is observed, whereas theusual approach of halving the interval between subsequent computations requires a huge number of computations between stoppingpoints.

References

Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. ``Quasi- (that is, Sub-) Random Sequences.'' §7.7 in Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed. Cambridge, England: Cambridge University Press, pp. 299-306, 1992.

• Partial Fraction Decomposition
• Partial Latin Square
• Partially Ordered Set
• Partial Order
• Partial Quotient
• Particularly Well-Behaved Functions
• Partisan Game
• Partition
• Partition Function P
• Partition Function Q
• Part Metric
• Party Problem
• Parzen Apodization Function
• Pascal Distribution
• Pascal Line
• Pascal's Formula
• Pascal's Hexagrammum Mysticum
• Pascal's Limaçon
• Pascal's Rule
• Pascal's Theorem
• Pascal's Triangle
• Pascal's Wager
• Pasch's Axiom
• Pasch's Theorem
• Pass Equivalent