SolveCongruence: Solve system of linear congruence from HIP paper to order HIP...
In ogansell/MSampNZ: New Zealand Master Sample
Description
Solve system of linear congruence from HIP paper to order HIP boxes.
See page 5 of Robertson et al. 2018 Halton Iterative Partitioning.
This is essentially an internal function and shouldn't be worried about.
Usage
1
SolveCongruence(A, base, J)
Arguments
A
Matrix that is in numeric for computational reasons but is the a_i solutions for all HIP boxes.
base
Co-prime Base but generally for BAS work it is 2 or 3.
J
Integer of 2 values that represent the numbers 2^J1, 3^J2.
ogansell/MSampNZ documentation built on Nov. 14, 2020, 3:31 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description
Solve system of linear congruence from HIP paper to order HIP boxes. See page 5 of Robertson et al. 2018 Halton Iterative Partitioning. This is essentially an internal function and shouldn't be worried about.
Usage
1 | SolveCongruence(A, base, J)
|
Arguments
A |
Matrix that is in numeric for computational reasons but is the a_i solutions for all HIP boxes. |
base |
Co-prime Base but generally for BAS work it is 2 or 3. |
J |
Integer of 2 values that represent the numbers 2^J1, 3^J2. |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.