|
SSJ V. labo. |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectumontreal.iro.lecuyer.discrepancy.Searcher
umontreal.iro.lecuyer.discrepancy.SearcherKorobov
public class SearcherKorobov
This class implements searches to find the best Korobov lattices with respect to a given discrepancy. Given a positive integer n and a multiplier a, the points are defined by
The discrepancy object in the constructor must fix the number of points n, the maximal dimension s of the lattice and possibly, the weight factors γj. Then the search program will examine different lattices with n, s and γj fixed in order to find the best amongst those examined.
Constructor Summary | |
---|---|
SearcherKorobov(Discrepancy disc,
boolean primeN)
The number of points n, the dimension s, and possibly the s weight factors γj must be given in disc. |
Method Summary | |
---|---|
double |
exhaust(int s)
Exhaustive search to find the best Korobov lattice (i.e. |
double |
exhaustPrime(int s)
Similar to exhaust (s), except that only
values of a relatively prime to n are considered. |
int |
getBestA()
Returns the generator a of the lattice which gave the best value of the discrepancy in the last search. |
double |
random(int s,
int k)
Random search to find the best Korobov lattice (with the smallest discrepancy) in dimension s. |
double |
randomPrime(int s,
int k)
Similar to random (s, k), except that only
values of a relatively prime to n are considered. |
Methods inherited from class umontreal.iro.lecuyer.discrepancy.Searcher |
---|
getBestAs, getBestVal, initGen |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public SearcherKorobov(Discrepancy disc, boolean primeN)
Method Detail |
---|
public double exhaust(int s)
exhaust
in class Searcher
public double exhaustPrime(int s)
exhaust
(s), except that only
values of a relatively prime to n are considered.
exhaustPrime
in class Searcher
public double random(int s, int k)
random
in class Searcher
public double randomPrime(int s, int k)
random
(s, k), except that only
values of a relatively prime to n are considered.
randomPrime
in class Searcher
public int getBestA()
|
SSJ V. labo. |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |