SSJ
V. labo.

Package umontreal.iro.lecuyer.discrepancy

Class Summary
BigDiscrepancy This abstract class is the base class of all discrepancy classes programmed with floating-point numbers with multi-precision.
BigDiscShiftBaker1 This class computes the same discrepancy as in DiscShiftBaker1 [see eq.], but uses multi-precision real numbers.
BigDiscShiftBaker1Lattice This class computes the same discrepancy as in DiscShiftBaker1Lattice [see eq.], but uses multi-precision real numbers.
DiscL2Hickernell This class computes the Hickernell L2-star discrepancy in for a point set.
DiscL2Star This class computes the traditional L2-star discrepancy D2*(P) for a set of n points P.
DiscL2Symmetric COMPLÉTER LA DOC ICI.
DiscL2Unanchored A discrepancy is said to be reflection-invariant if it has the same value when the points are reflected through any plane xj = 1/2, passing through the center of the unit hypercube, i.e.
Discrepancy This abstract class is the base class of all discrepancy classes.
DiscrepancyContainer This class is used to compute, store and display discrepancies.
DiscShift1 This class computes the discrepancy for randomly shifted points of a set P.
DiscShift1Lattice This class computes the same discrepancy for randomly shifted points of a set L as given in eq.
DiscShift2 This class computes the discrepancy in for the randomly shifted points of a set P.
DiscShift2Lattice This class computes the same discrepancy for randomly shifted points of a set L as given in eq.
DiscShiftBaker1 This class computes the discrepancy for randomly shifted, then baker folded points of a set P.
DiscShiftBaker1Lattice This class computes the same discrepancy in for the randomly shifted points of a set L as given in eq.
Palpha Extends the class Discrepancy and implements the methods required to compute the Pα figure of merit for a lattice point set Ψs which is the intersection of a lattice L and the unit hypercube [0, 1)s in s dimensions.
Searcher This class implements searches to find the best lattices of rank 1, defined as follows.
SearcherCBC This class implements searches to find the best rank-1 lattices with respect to a given discrepancy, using component-by-component (CBC) searches, random or exhaustive for each component.
SearcherKorobov This class implements searches to find the best Korobov lattices with respect to a given discrepancy.
 


SSJ
V. labo.

To submit a bug or ask questions, send an e-mail to Pierre L'Ecuyer.