|
Latin Hypercube Samples (lhs)
1.0
R, C++, and Rcpp code to generate Latin hypercube samples
|
Functions | |
| int | addelkemp3check (int q, int p, int ncol) |
| int | akeven (GaloisField &gf, int *kay, std::vector< int > &b, std::vector< int > &c, std::vector< int > &k) |
| int | akodd (GaloisField &gf, int *kay, std::vector< int > &b, std::vector< int > &c, std::vector< int > &k) |
| void | addelkempncheck (int q, int p, int akn, int ncol) |
| int | addelkempn (GaloisField &gf, int akn, bclib::matrix< int > &A, int ncol) |
| int | addelkemp3 (GaloisField &gf, bclib::matrix< int > &A, int ncol) |
Addelkemp class
| int oacpp::oaaddelkemp::addelkemp3 | ( | GaloisField & | gf, |
| bclib::matrix< int > & | A, | ||
| int | ncol | ||
| ) |
The addelkemp algorithm for n=3
| gf | galois field |
| A | the orthogonal array |
| ncol | the number of columns |
| int oacpp::oaaddelkemp::addelkemp3check | ( | int | q, |
| int | p, | ||
| int | ncol | ||
| ) |
Check that the parameters of the addelkemp3 algorithm are consistent (ncol <= 2q^2+2q+1
| q | the order of the Galois field or the number of symbols |
| p | the prime basis of the Galois field |
| ncol | the number of columns |
| int oacpp::oaaddelkemp::addelkempn | ( | GaloisField & | gf, |
| int | akn, | ||
| bclib::matrix< int > & | A, | ||
| int | ncol | ||
| ) |
The addelkemp algorithm for general n to produce OA(2q^n,ncol,q,2)
| gf | a Galois Field |
| akn | the akn algorithm produces OA(2q^n,ncol,q,2) |
| A | the orthogonal array |
| ncol | the number of columns |
| void oacpp::oaaddelkemp::addelkempncheck | ( | int | q, |
| int | p, | ||
| int | akn, | ||
| int | ncol | ||
| ) |
Check that the parameters are consistent for the addelkempn algorithm
| q | the order of Galois field or the number of symbols |
| p | the prime basis of the Galois field |
| akn | the akn algorithm produces OA(2q^n,ncol,q,2) |
| ncol | the number of columns |
| runtime_exception |
| int oacpp::oaaddelkemp::akeven | ( | GaloisField & | gf, |
| int * | kay, | ||
| std::vector< int > & | b, | ||
| std::vector< int > & | c, | ||
| std::vector< int > & | k | ||
| ) |
Addelkemp algorithm for even p
| gf | a Galois field |
| kay | the number of columns |
| b | original Addelkemp variable |
| c | original Addelkemp variable |
| k | original Addelkemp variable |
| int oacpp::oaaddelkemp::akodd | ( | GaloisField & | gf, |
| int * | kay, | ||
| std::vector< int > & | b, | ||
| std::vector< int > & | c, | ||
| std::vector< int > & | k | ||
| ) |
Addelkemp algorithm for odd p
| gf | a Galois field object |
| kay | the number of columns |
| b | original Addelkemp variable |
| c | original Addelkemp variable |
| k | original Addelkemp variable |