|
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
public class Searcher
This class implements searches to find the best lattices of rank 1, defined as follows. Given a positive integer n and a s-dimensional integer vector (a0,..., as-1), where 0 <= aj < n for each j, the points are defined by
The discrepancy object in the Searcher 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. Searches may be exhaustive or random.
One may consider only a subset of the possible lattices according to some criterion. Some of these restricted searches are implemented in classes derived from Searcher.
Constructor Summary | |
---|---|
Searcher(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 lattice with the best (the smallest) discrepancy in dimension s. |
double |
exhaustPrime(int s)
Similar to exhaust (s), except that only
values of aj relatively prime to n are considered. |
int[] |
getBestAs()
Returns the generator of the lattice which gave the best value of the discrepancy in the last search. |
double |
getBestVal()
Returns the best value of the discrepancy found in the last search. |
void |
initGen(int seed)
Initializes the random number generator used in random searches with the starting seed seed. |
double |
random(int s,
int k)
Random search to find the lattice with the best (the smallest) discrepancy in dimension s. |
double |
randomPrime(int s,
int k)
Similar to random (s, k), except that only
values of aj relatively prime to n are considered. |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public Searcher(Discrepancy disc, boolean primeN)
Method Detail |
---|
public double exhaust(int s)
public double exhaustPrime(int s)
exhaust
(s), except that only
values of aj relatively prime to n are considered.
public double random(int s, int k)
public double randomPrime(int s, int k)
random
(s, k), except that only
values of aj relatively prime to n are considered.
public double getBestVal()
public int[] getBestAs()
public void initGen(int seed)
|
SSJ V. labo. |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |